Introduction to Algorithms

E32449

computer science book textbook

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.

Try in SPARQL Jump to: Surface forms Disambiguation Statements Elicitation Referenced by

All labels observed (4)

Label	Occurrences
Introduction to Algorithms canonical	6
"Introduction to Algorithms"	2
CLRS	1
co-authoring Introduction to Algorithms	1

How this entity was disambiguated

This entity first appeared as the object of triple T249040 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.

NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07

Target entity: Introduction to Algorithms
Context triple: [Addison-Wesley, hasPublished, Introduction to Algorithms]

A. Randomness and Computation
"Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
B. Computer Graphics: Principles and Practice
Computer Graphics: Principles and Practice is a foundational textbook that comprehensively covers the theory and algorithms underlying modern computer graphics.
C. ACM Computing Surveys
ACM Computing Surveys is a leading peer-reviewed journal that publishes comprehensive, in-depth survey articles covering major areas of computer science and computing research.
D. Journal of the ACM
Journal of the ACM is a leading peer-reviewed scientific journal in computer science that publishes foundational research across the breadth of computing theory and practice.
E. The Advancement of Learning
The Advancement of Learning is a 1605 philosophical treatise by Francis Bacon that argues for the systematic reform and expansion of human knowledge through empirical inquiry and the scientific method.
F. None of above. chosen
G. Unsure - the case is ambiguous/there is not enough information to decide.

NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07

Target entity: Introduction to Algorithms
Target entity description: 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.

A. Randomness and Computation
"Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
B. Computer Graphics: Principles and Practice
Computer Graphics: Principles and Practice is a foundational textbook that comprehensively covers the theory and algorithms underlying modern computer graphics.
C. ACM Computing Surveys
ACM Computing Surveys is a leading peer-reviewed journal that publishes comprehensive, in-depth survey articles covering major areas of computer science and computing research.
D. Journal of the ACM
Journal of the ACM is a leading peer-reviewed scientific journal in computer science that publishes foundational research across the breadth of computing theory and practice.
E. The Advancement of Learning
The Advancement of Learning is a 1605 philosophical treatise by Francis Bacon that argues for the systematic reform and expansion of human knowledge through empirical inquiry and the scientific method.
F. None of above. chosen

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 ⓘ

How these facts were elicited

Referenced by (10)

Full triples — surface form annotated when it differs from this entity's canonical label.

Addison-Wesley → hasPublished → Introduction to Algorithms ⓘ

MIT Press → notablePublication → Introduction to Algorithms ⓘ

Introduction to Algorithms → hasShortName → Introduction to Algorithms self-linksurface differs ⓘ

this entity surface form: CLRS

Thomas H. Cormen → notableWork → Introduction to Algorithms ⓘ

Thomas H. Cormen → coAuthorOf → Introduction to Algorithms ⓘ

Thomas H. Cormen → knownFor → Introduction to Algorithms ⓘ

this entity surface form: co-authoring Introduction to Algorithms

Charles E. Leiserson → coAuthorOf → Introduction to Algorithms ⓘ

Charles E. Leiserson → authorOf → Introduction to Algorithms ⓘ

Clifford Stein → coAuthorOf → Introduction to Algorithms ⓘ

this entity surface form: "Introduction to Algorithms"

Clifford Stein → notableWork → Introduction to Algorithms ⓘ