The Art of Computer Programming, Volume 1¶
Knuth, D. E. (1973). The Art of Computer Programming, Volume 1: Fundamental Algorithms. Addison-Wesley.
Cited by¶
4 citations across 4 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Associativity
This sourceTree and information-structure algorithms exploit associativity of underlying operations to re-group/balance computation trees.
- Commutativity
This sourceTree-balancing and parsing algorithms exploit associativity of underlying operations (concatenation, expression composition) to permit re-grouping of computation trees for efficient evaluation and search; foundational treatment of how associativity in computational structures enables optimization and balanced data-structure design.
- Complexity (Time/Space)
- The distinction between worst-case, average-case, and amortized complexity variants
This sourceFoundational treatment of algorithm analysis — worst-case and average-case asymptotic analysis and how cost scales with input size — supports D30-137, D30-142, D30-150.
- The distinction between worst-case, average-case, and amortized complexity variants
- Idempotence
This sourceTree-balancing and parsing algorithms exploit associativity of underlying operations (concatenation, expression composition) to permit re-grouping of computation trees for efficient evaluation and search; foundational treatment of how associativity in computational structures enables optimization and balanced data-structure design.
Verification¶
Does it exist? Not checked yet. This work's ISBN is recorded above but has not been resolved against an external catalogue, so nothing here confirms the work exists.
Does it back the claim? Not recorded. Neither this nor any other of the 4 citations of this work carries a recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Links previously used in the corpus¶
Before the registry existed this work was also linked 1 other way.
Registry ID ref:ca2a987b7857 · see in the full table