Introduction to Algorithms
Introduction to Algorithms is a book on computer programming by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The book has been widely used as the textbook for algorithms courses at many universities and is commonly cited as a reference for algorithms in published papers, with over 10,000 citations documented on CiteSeerX. The book sold half a million copies during its first 20 years. Its fame has led to the common use of the abbreviation "CLRS" (Cormen, Leiserson, Rivest, Stein), or, in the first edition, "CLR" (Cormen, Leiserson, Rivest).
- Artifact100021939
- book
- Book
- Book
- Book106410904
- Creation103129123
- CreativeWork
- Object100002684
- PhysicalEntity100001930
- Product104007894
- Publication106589574
- Q234460
- Q386724
- Q571
- Thing
- Whole100003553
- Wikicat1990Books
- WikicatComputerBooks
- WikicatComputerScienceBooks
- WikicatMITPressBooks
- work
- Work104599396
- WrittenWork
- Author
- Charles E. Leiserson
- Author
- Charles E. Leiserson
- Author
- Clifford Stein
- Author
- Clifford Stein
- Author
- Ron Rivest
- Author
- Ron Rivest
- Author
- Thomas H. Cormen
- Author
- Thomas H. Cormen
- Caption
- enCover of the fourth edition
- Colwidth
- 30
- Comment
- enIntroduction to Algorithms is a book on computer programming by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The book has been widely used as the textbook for algorithms courses at many universities and is commonly cited as a reference for algorithms in published papers, with over 10,000 citations documented on CiteSeerX. The book sold half a million copies during its first 20 years. Its fame has led to the common use of the abbreviation "CLRS" (Cormen, Leiserson, Rivest, Stein), or, in the first edition, "CLR" (Cormen, Leiserson, Rivest).
- Content
- en* I Foundations ** 1 The Role of Algorithms in Computing ** 2 Getting Started ** 3 Characterizing Running Times ** 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 * IV Advanced Design and Analysis Techniques ** 14 Dynamic Programming ** 15 Greedy Algorithms ** 16 Amortized Analysis * V Advanced Data Structures ** 17 Augmenting Data Structures ** 18 B-Trees ** 19 Data Structures for Disjoint Sets * VI Graph Algorithms ** 20 Elementary Graph Algorithms ** 21 Minimum Spanning Trees ** 22 Single-Source Shortest Paths ** 23 All-Pairs Shortest Paths ** 24 Maximum Flow ** 25 Matching in Bipartite Graphs * VII Selected Topics ** 26 Parallel Algorithms ** 27 Online Algorithms ** 28 Matrix Operations ** 29 Linear Programming ** 30 Polynomials and the FFT ** 31 Number-Theoretic Algorithms ** 32 String Matching ** 33 Machine-Learning Algorithms ** 34 NP-Completeness ** 35 Approximation Algorithms * VIII Appendix: Mathematical Background ** A Summations ** B Sets, Etc. ** C Counting and Probability ** D Matrices
- Country
- United States
- Country
- United States
- Depiction
- Has abstract
- enIntroduction to Algorithms is a book on computer programming by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The book has been widely used as the textbook for algorithms courses at many universities and is commonly cited as a reference for algorithms in published papers, with over 10,000 citations documented on CiteSeerX. The book sold half a million copies during its first 20 years. Its fame has led to the common use of the abbreviation "CLRS" (Cormen, Leiserson, Rivest, Stein), or, in the first edition, "CLR" (Cormen, Leiserson, Rivest). In the preface, the authors write about how the book was written to be comprehensive and useful in both teaching and professional environments. Each chapter focuses on an algorithm, and discusses its design techniques and areas of application. Instead of using a specific programming language, the algorithms are written in pseudocode. The descriptions focus on the aspects of the algorithm itself, its mathematical properties, and emphasize efficiency.
- Hypernym
- Book
- Isbn
- 978-0-262-04630-5
- Isbn
- 978
- Is primary topic of
- Introduction to Algorithms
- Label
- enIntroduction to Algorithms
- Language
- English language
- Language
- English language
- Link from a Wikipage to an external page
- mitpress.mit.edu/algorithms
- Link from a Wikipage to another Wikipage
- Academic publishing
- Alexander Calder
- Algorithm
- Book cover
- Category:1990 non-fiction books
- Category:Computer science books
- Category:MIT Press books
- Charles E. Leiserson
- Citation
- CiteSeerX
- Clifford Stein
- Course (education)
- English language
- MIT Press
- Mobile (sculpture)
- New York City
- Nickname
- Pseudocode
- Ron Rivest
- Textbook
- The Art of Computer Programming
- Thomas H. Cormen
- United States
- Universities
- Victoria Fromkin
- Whitney Museum of American Art
- Name
- enIntroduction to Algorithms
- Name
- enIntroduction to Algorithms
- NonFictionSubject
- Algorithm
- NumberOfPages
- 1312
- Pages
- 1312
- PubDate
- 1990
- Publisher
- MIT Press
- Publisher
- MIT Press
- Publisher
- MIT Press
- SameAs
- Alqoritmlərə giriş
- BmqM
- Introducción a los algoritmos
- Introduction à l'algorithmique
- Introduction to Algorithms
- Introduction to Algorithms
- Introduction to Algorithms
- Introduzione agli algoritmi
- m.09gv60
- Q1141518
- Алгоритмы: построение и анализ
- Вступ до алгоритмів
- مقدمة في الخوارزميات (كتاب)
- مقدمهای بر الگوریتمها
- 算法导论
- Subject
- Algorithm
- Subject
- Category:1990 non-fiction books
- Category:Computer science books
- Category:MIT Press books
- Thumbnail
- WasDerivedFrom
- Introduction to Algorithms?oldid=1087027115&ns=0
- WikiPageLength
- 7510
- Wikipage page ID
- 3499226
- Wikipage revision ID
- 1087027115
- WikiPageUsesTemplate
- Template:Div col
- Template:Infobox book
- Template:Introduction to Algorithms
- Template:Reflist
- Template:Short description