The Art of Computer Programming, Volume 1
GPTKB entity
Statements (57)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
book
|
| gptkbp:author |
Donald Knuth
|
| gptkbp:contains |
Dynamic programming
Statistics Trees Backtracking Data structures Probability theory Recursion Computational geometry Mathematical induction Graphs Lists Queues Stacks Asymptotic analysis Greedy algorithms Sets Algorithm analysis Data representation Heuristic algorithms Algorithm efficiency Hashing Searching algorithms Sorting algorithms Graph algorithms Complexity theory Binary trees B-trees Divide and conquer Priority queues AVL trees Combinatorial algorithms Numerical algorithms Random numbers Tries Algorithm design techniques Skip lists String algorithms Algorithm correctness Basic data structures Graphs and networks Mathematical analysis of algorithms Mathematical preliminaries Red-black trees |
| gptkbp:editor |
Donald Knuth
|
| gptkbp:focus |
Fundamental algorithms
|
| gptkbp:format |
Print
|
| https://www.w3.org/2000/01/rdf-schema#label |
The Art of Computer Programming, Volume 1
|
| gptkbp:ISBN |
978-0201896831
|
| gptkbp:language |
English
|
| gptkbp:pageCount |
672
|
| gptkbp:passenger_traffic |
1
|
| gptkbp:publisher |
gptkb:Addison-Wesley
|
| gptkbp:releaseYear |
1968
|
| gptkbp:series |
gptkb:The_Art_of_Computer_Programming
|
| gptkbp:subject |
Computer algorithms
|