The Art of Computer Programming, Volume 1: Fundamental Algorithms¶
Knuth, D. E. (1968). The Art of Computer Programming, Volume 1: Fundamental Algorithms: Fundamental Algorithms. Addison-Wesley.
Cited by¶
4 citations across 4 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Abstract Data Type
- The suppressed implementation is the internal representation, and there are several conforming ones: a contiguous array with a top index, or a singly-linked list with the head as the top.
This sourceStandard reference presenting both sequential (array) and linked-list (linked-allocation) implementations of stacks as interchangeable representations of the same abstract stack operations.
- The suppressed implementation is the internal representation, and there are several conforming ones: a contiguous array with a top index, or a singly-linked list with the head as the top.
- Backtracking
- Search and constraint solving — satisfiability and constraint-satisfaction algorithms, parsing with rollback on failed alternatives, and logic-programming interpreters all rest on the backtracking skeleton.
This sourceFoundational treatment of recursion, backtracking, and tree-structured search underlying constraint solving and parsing.
- Search and constraint solving — satisfiability and constraint-satisfaction algorithms, parsing with rollback on failed alternatives, and logic-programming interpreters all rest on the backtracking skeleton.
- Iteration
- Linearization-Meaning Mismatch
- The pattern recurs in presentations (a deck linearised "by team" presented to an audience reasoning "by decision"), in build systems (a Makefile's authoring order versus the required topological order of the dependency DAG), in legal argument (chronological order of events versus liability-elements order), in narrative prose (chronological versus causal-revelation versus emotional-arc order), in API documentation (alphabetical reference order versus task-flow order versus by-concept order), in database query plans (syntactic clause order versus logical evaluation order versus physical execution order), in music (a fugue's simultaneous voices introduced serially in score-time), and in citation lists (alphabetical versus order-of-appearance versus by-topic).
This sourceTopological sorting of a partial order (DAG) into a valid total order (Section 2.2.3), the canonical algorithm for serializing dependency structure.
- The pattern recurs in presentations (a deck linearised "by team" presented to an audience reasoning "by decision"), in build systems (a Makefile's authoring order versus the required topological order of the dependency DAG), in legal argument (chronological order of events versus liability-elements order), in narrative prose (chronological versus causal-revelation versus emotional-arc order), in API documentation (alphabetical reference order versus task-flow order versus by-concept order), in database query plans (syntactic clause order versus logical evaluation order versus physical execution order), in music (a fugue's simultaneous voices introduced serially in score-time), and in citation lists (alphabetical versus order-of-appearance versus by-topic).
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. 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:2b106578d264 · see in the full table