Introduction to Algorithms
E32449
Introduction to Algorithms is a widely used, comprehensive textbook on algorithms and data structures, renowned for its rigorous yet accessible coverage of theoretical and practical topics in computer science.
Observed surface forms (1)
| Surface form | As subject | As object |
|---|---|---|
| CLRS | 0 | 1 |
Statements (51)
| Predicate | Object |
|---|---|
| instanceOf |
computer science book
→
textbook → |
| coversTopic |
NP-completeness
→
amortized analysis → approximation algorithms → asymptotic notation → binary search trees → divide-and-conquer algorithms → dynamic programming → graph algorithms → greedy algorithms → hash tables → heaps → maximum flow → minimum spanning trees → randomized algorithms → red-black trees → searching algorithms → shortest paths → sorting algorithms → string matching → |
| hasAuthor |
Charles E. Leiserson
→
Clifford Stein → Ronald L. Rivest → Thomas H. Cormen → |
| hasEdition |
first edition
→
fourth edition → second edition → third edition → |
| hasFeature |
case studies
→
exercises → problems → pseudocode-based presentation → |
| hasLanguage | English → |
| hasPublisher |
MIT Press
→
McGraw-Hill → |
| hasShortName |
Introduction to Algorithms
self-linksurface differs
→
surface form:
CLRS
|
| hasStyle |
accessible
→
mathematically oriented → rigorous → |
| hasSubject |
algorithm analysis
→
algorithm design → algorithms → data structures → theoretical computer science → |
| isRenownedFor |
comprehensive coverage of algorithms
→
standard reference in computer science education → |
| isUsedAs | university textbook → |
| isUsedIn |
computer science curricula
→
graduate courses → undergraduate courses → |
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
CLRS