Statements (58)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:book
|
| gptkbp:author |
gptkb:Ronald_L._Rivest
gptkb:Charles_E._Leiserson gptkb:Clifford_Stein gptkb:Thomas_H._Cormen |
| gptkbp:chapter |
gptkb:Dynamic_Programming
gptkb:Graph_Algorithms gptkb:Quicksort gptkb:Heapsort Data Structures Greedy Algorithms Advanced Data Structures Advanced Topics in Algorithms Amortized Analysis Approximation Algorithms B-Trees Binary Search Trees Counting Sort Elementary Data Structures Elementary Graph Algorithms Hash Tables Linear Programming Matrix Operations Maximum Flow Minimum Spanning Trees Multithreaded Algorithms NP-Completeness Number-Theoretic Algorithms Polynomials and FFT Radix Sort Red-Black Trees Shortest Paths Sorting |
| gptkbp:countryOfOrigin |
gptkb:United_States
|
| gptkbp:edition |
2nd edition
1st edition 3rd edition 4th edition |
| gptkbp:firstPublished |
1990
|
| gptkbp:fullTitle |
gptkb:Introduction_to_Algorithms
|
| https://www.w3.org/2000/01/rdf-schema#label |
CLRS
|
| gptkbp:ISBN |
978-0-262-03384-8
|
| gptkbp:language |
English
|
| gptkbp:nickname |
gptkb:The_Algorithms_Bible
gptkb:CLRS |
| gptkbp:notableFor |
comprehensive coverage of algorithms
widely used in academia pseudocode-based explanations |
| gptkbp:publisher |
gptkb:MIT_Press
gptkb:McGraw-Hill |
| gptkbp:subject |
computer science
algorithms |
| gptkbp:targetAudience |
students
professionals instructors |
| gptkbp:usedIn |
university courses
|
| gptkbp:bfsParent |
gptkb:Introduction_to_Algorithms
|
| gptkbp:bfsLayer |
5
|