Skip to search
Skip to main content
Catalog
Help
Feedback
Your Account
Library Account
Bookmarks
(
0
)
Search History
Search in
Keyword
Title (keyword)
Author (keyword)
Subject (keyword)
Title starts with
Subject (browse)
Author (browse)
Author (sorted by title)
Call number (browse)
search for
Search
Advanced Search
Bookmarks
(
0
)
Princeton University Library Catalog
Start over
Cite
Send
to
SMS
Email
EndNote
RefWorks
RIS
Printer
Bookmark
Introduction to algorithms [electronic resource] / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein.
Format
Book
Language
English
Εdition
3rd ed.
Published/Created
Cambridge, Mass. : MIT Press, 2009.
Description
1 online resource (xix, 1293 pages) : illustrations
Details
Subject(s)
Computer programming
[Browse]
Computer algorithms
[Browse]
Related name
EbscoHost (Servicio en línea)
[Browse]
Cormen, Thomas H.
[Browse]
Leiserson, Charles E.
[Browse]
Rivest, Ronald L.
[Browse]
Stein, Clifford
[Browse]
Notes
Description based upon print version of record.
Bibliographic references
Includes bibliographical references (p. [1231]-1250) and index.
Language note
English
Contents
""Contents""; ""Preface""; ""I Foundations""; ""1 The Role of Algorithms in Computing""; ""2 Getting Started""; ""3 Growth of Functions""; ""4 Divide-and-Conquer""; ""5 Probabilistic Analysis and Randomized Algorithms""; ""II Sorting and Order Statistics""; ""6 Heapsort""; ""7 Quicksort""; ""8 Sorting in Linear Time""; ""9 Medians and Order Statistics""; ""III Data Structures""; ""10 Elementary Data Structures""; ""11 Hash Tables""; ""12 Binary Search Trees""; ""13 Red-Black Trees""; ""14 Augmenting Data Structures""; ""IV Advanced Design and Analysis Techniques""; ""15 Dynamic Programming""
""16 Greedy Algorithms""""17 Amortized Analysis""; ""V Advanced Data Structures""; ""18 B-Trees""; ""19 Fibonacci Heaps""; ""20 van Emde Boas Trees""; ""21 Data Structures for Disjoint Sets""; ""VI Graph Algorithms""; ""22 Elementary Graph Algorithms""; ""23 Minimum Spanning Trees""; ""24 Single-Source Shortest Paths""; ""25 All-Pairs Shortest Paths""; ""26 Maximum Flow""; ""VII Selected Topics""; ""27 Multithreaded Algorithms""; ""28 Matrix Operations""; ""29 Linear Programming""; ""30 Polynomials and the FFT""; ""31 Number-Theoretic Algorithms""; ""32 String Matching""
""33 Computational Geometry""""34 NP-Completeness""; ""35 Approximation Algorithms""; ""VIII Appendix: Mathematical Background""; ""A Summations""; ""B Sets, Etc.""; ""C Counting and Probability""; ""D Matrices""; ""Bibliography""; ""Index""
ISBN
9780262270830
9780262533058
9780262033848
Statement on language in description
Princeton University Library aims to describe library materials in a manner that is respectful to the individuals and communities who create, use, and are represented in the collections we manage.
Read more...
Other views
Staff view
Ask a Question
Suggest a Correction
Report Harmful Language
Supplementary Information
Other versions
Introduction to algorithms / Thomas H. Cormen ... [et al.].
id
9958991083506421