|
gptkbp:instance_of
|
gptkb:book
|
|
gptkbp:amended_by
|
gptkb:2001
gptkb:2009
gptkb:2022
|
|
gptkbp:anatomy
|
Algorithm Complexity
Additional Exercises
Mathematical Background
Solutions to Exercises
|
|
gptkbp:author
|
gptkb:Charles_E._Leiserson
gptkb:Thomas_H._Cormen
gptkb:Ronald_L._Rivest
gptkb:Clifford_Stein
|
|
gptkbp:available_in
|
gptkb:print
Digital Format
|
|
gptkbp:available_on
|
gptkb:Amazon
gptkb:Google_Books
gptkb:Barnes_&_Noble
MIT Press Website
|
|
gptkbp:awarded_for
|
Best Book in Computer Science
|
|
gptkbp:contains
|
gptkb:illustrations
Case Studies
Exercises
Pseudocode
|
|
gptkbp:covers
|
Data Structures
Dynamic Programming
Graph Algorithms
Sorting Algorithms
Greedy Algorithms
Mathematical Foundations
|
|
gptkbp:field
|
Computer Science
|
|
gptkbp:first_edition
|
gptkb:3rd
|
|
gptkbp:first_published
|
gptkb:1990
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Introduction to Algorithms
|
|
gptkbp:influenced_by
|
gptkb:Robert_Sedgewick
gptkb:Donald_Knuth
|
|
gptkbp:is_cited_in
|
Numerous Academic Papers
|
|
gptkbp:is_reviewed_by
|
Academic Journals
|
|
gptkbp:isbn
|
978-0262033848
|
|
gptkbp:language
|
English
|
|
gptkbp:page_count
|
1312
|
|
gptkbp:published_year
|
gptkb:1990
|
|
gptkbp:publisher
|
gptkb:The_MIT_Press
|
|
gptkbp:related_to
|
gptkb:The_Art_of_Computer_Programming
gptkb:Algorithms_Unlocked
|
|
gptkbp:subject
|
gptkb:Algorithms
|
|
gptkbp:target_audience
|
gptkb:students
gptkb:researchers
Professionals
|
|
gptkbp:translated_into
|
Multiple Languages
|
|
gptkbp:used_in
|
Computer Science Education
|
|
gptkbp:bfsParent
|
gptkb:Ron_Rivest
|
|
gptkbp:bfsLayer
|
3
|