The Art of Computer Programming Vs Structure and Interpretation of Computer Programs

Books about algorithms past Donald Knuth

The Art of Computer Programming

The Art of Computer Programming, Volume i: Primal Algorithms
Author	Donald Knuth
Country	United States
Linguistic communication	English
Genre	Not-fiction Monograph
Publisher	Addison-Wesley
Publication date	1968– (the book is notwithstanding incomplete)
Media type	Print (Hardcover)
ISBN	0-201-03801-3
Dewey Decimal	519
LC Class	QA76.75

The Art of Computer Programming ( TAOCP ) is a comprehensive monograph written past the figurer scientist Donald Knuth presenting programming algorithms and their assay.

Knuth began the project, originally conceived as a single book with twelve chapters, in 1962. The first three volumes of what was then expected to exist a 7-volume set were published in 1968, 1969, and 1973. Piece of work began in earnest on Volume 4 in 1973, but was suspended in 1977 for piece of work on typesetting prompted past the 2d edition of Volume 2. Writing of the concluding re-create of Book 4A began in longhand in 2001, and the commencement online pre-fascicle, 2A, appeared later in 2001.^[1] The first published installment of Volume 4 appeared in paperback every bit Fascicle 2 in 2005. The hardback Volume 4A, combining Book 4, Fascicles 0–4, was published in 2011. Book four, Fascicle 6 ("Satisfiability") was released in December 2015; Book four, Fascicle v ("Mathematical Preliminaries Redux; Backtracking; Dancing Links") was released in November 2019.

The published Fascicles five and 6 are expected to make up the first 2-thirds of Volume 4B. Knuth has not announced any estimated date for release of Volume 4B, although his method used for Volume 4A is to release the hardback book quondam later release of the paperback fascicles contained in it. About-term publisher estimates put the release engagement at May or June 2019, which proved to be incorrect.^{[2] [3]}

History [edit]

Later winning a Westinghouse Talent Search scholarship, Knuth enrolled at the Instance Plant of Technology (at present Instance Western Reserve University), where his functioning was so outstanding that the kinesthesia voted to honour him a main of science upon his completion of the bachelor degree. During his summer vacations, Knuth was hired past the Burroughs Corporation to write compilers, earning more in his summer months than total professors did for an entire year.^[4] Such exploits made Knuth a topic of word among the mathematics department, which included Richard S. Varga.

In January 1962, when he was a graduate pupil in the mathematics department at Caltech, Knuth was approached past Addison-Wesley to write a book about compiler design, and he proposed a larger scope. He came up with a list of 12 chapter titles the same day. In the summer of 1962 he worked on a FORTRAN compiler for UNIVAC. During this time, he also came up with a mathematical analysis of linear probing, which convinced him to nowadays the material with a quantitative arroyo. After receiving his PhD in June 1963, he began working on his manuscript, of which he finished his first typhoon in June 1965, at 3000 hand-written pages.^[five] He had causeless that about 5 hand-written pages would translate into 1 printed page, but his publisher said instead that about ane+ 1⁄ii paw-written pages translated to one printed page. This meant he had approximately 2000 printed pages of material, which closely matches the size of the first three published volumes. The publisher was nervous near accepting such a project from a graduate student. At this point, Knuth received back up from Richard S. Varga, who was the scientific adviser to the publisher. Varga was visiting Olga Taussky-Todd and John Todd at Caltech. With Varga's enthusiastic endorsement, the publisher accustomed Knuth's expanded plans. In its expanded version, the book would be published in seven volumes, each with just one or two chapters.^[6] Due to the growth in Chapter 7, which was fewer than 100 pages of the 1965 manuscript, per Vol. 4A p. vi, the plan for Volume iv has since expanded to include Volumes 4A, 4B, 4C, 4D, and possibly more.

In 1976, Knuth prepared a second edition of Volume 2, requiring it to be typeset again, but the style of type used in the first edition (called hot blazon) was no longer available. In 1977, he decided to spend some time creating something more suitable. Viii years later, he returned with T_EX, which is currently used for all volumes.

The offering of a so-called Knuth reward check worth "one hexadecimal dollar" (100_HEX base 16 cents, in decimal, is $ii.56) for whatever errors found, and the correction of these errors in subsequent printings, has contributed to the highly polished and however-administrative nature of the work, long later on its first publication. Another feature of the volumes is the variation in the difficulty of the exercises. Knuth fifty-fifty has a numerical difficulty scale for rating those exercises, varying from 0 to l, where 0 is trivial, and 50 is an open question in contemporary research.^[7]

Knuth's dedication reads:

This series of books is affectionately dedicated
to the Type 650 computer once installed at
Instance Institute of Technology,
with whom I take spent many pleasant evenings.^[a]

Associates language in the book [edit]

All examples in the books utilize a linguistic communication chosen "MIX assembly language", which runs on the hypothetical MIX computer. Currently, the MIX calculator is existence replaced by the MMIX figurer, which is a RISC version. Software such every bit GNU MDK exists to provide emulation of the MIX architecture. Knuth considers the use of associates language necessary for the speed and memory usage of algorithms to be judged.

Critical response [edit]

Knuth was awarded the 1974 Turing Honour "for his major contributions to the analysis of algorithms […], and in particular for his contributions to the 'art of computer programming' through his well-known books in a continuous series by this championship."^[8] American Scientist has included this piece of work among "100 or and so Books that shaped a Century of Science", referring to the twentieth century,^[9] and within the informatics community it is regarded as the get-go and still the best comprehensive treatment of its bailiwick. ^{[ failed verification ]} Covers of the third edition of Volume 1 quote Bill Gates as proverb, "If you think you're a really proficient programmer… read (Knuth's) Art of Figurer Programming… You should definitely transport me a résumé if y'all tin read the whole thing."^[10] The New York Times referred to it as "the profession'southward defining treatise".^[11]

Volumes [edit]

Completed [edit]

• Volume 1 – Cardinal Algorithms
  • Chapter 1 – Basic concepts
  • Chapter two – Data structures
• Book 2 – Seminumerical Algorithms
  • Chapter 3 – Random numbers
  • Chapter 4 – Arithmetics
• Volume 3 – Sorting and Searching
  • Chapter v – Sorting
  • Chapter vi – Searching
• Volume 4A – Combinatorial Algorithms
  • Chapter 7 – Combinatorial searching (role 1)

Planned [edit]

• Volume 4B... – Combinatorial Algorithms (chapters 7 & 8 released in several subvolumes)
  • Chapter 7 – Combinatorial searching (connected)
  • Chapter 8 – Recursion
• Volume 5 – Syntactic Algorithms
  • Chapter nine – Lexical scanning (besides includes cord search and data pinch)
  • Chapter x – Parsing techniques
• Book six – The Theory of Context-Gratis Languages
• Volume 7 – Compiler Techniques

Chapter outlines [edit]

Completed [edit]

Volume 1 – Central Algorithms [edit]

• Chapter one – Basic concepts
  • 1.i. Algorithms
  • 1.2. Mathematical Preliminaries
    • i.two.1. Mathematical Consecration
    • 1.ii.2. Numbers, Powers, and Logarithms
    • ane.two.3. Sums and Products
    • one.2.iv. Integer Functions and Simple Number Theory
    • 1.2.v. Permutations and Factorials
    • 1.ii.half dozen. Binomial Coefficients
    • 1.ii.7. Harmonic Numbers
    • 1.ii.viii. Fibonacci Numbers
    • 1.2.nine. Generating Functions
    • i.2.10. Analysis of an Algorithm
    • one.2.11. Asymptotic Representations
      • ane.2.11.1. The O-notation
      • 1.2.11.2. Euler's summation formula
      • i.2.11.3. Some asymptotic calculations
  • 1.3 MMIX (MIX in the hardback re-create just updated by fascicle 1)
    • ane.3.1. Clarification of MMIX
    • 1.iii.2. The MMIX Associates Language
    • 1.3.3. Applications to Permutations
  • 1.four. Some Fundamental Programming Techniques
    • 1.iv.i. Subroutines
    • ane.iv.ii. Coroutines
    • 1.4.three. Interpretive Routines
      • 1.4.3.one. A MIX simulator
      • i.4.three.2. Trace routines
    • 1.4.4. Input and Output
    • i.four.5. History and Bibliography
• Chapter 2 – Data Structures
  • 2.one. Introduction
  • ii.ii. Linear Lists
    • 2.2.1. Stacks, Queues, and Deques
    • 2.2.2. Sequential Allotment
    • ii.2.3. Linked Allocation (topological sorting)
    • 2.2.4. Round Lists
    • 2.2.five. Doubly Linked Lists
    • 2.2.half-dozen. Arrays and Orthogonal Lists
  • 2.iii. Trees
    • 2.3.1. Traversing Binary Trees
    • 2.3.ii. Binary Tree Representation of Trees
    • two.3.iii. Other Representations of Trees
    • 2.3.iv. Basic Mathematical Properties of Trees
      • 2.iii.4.1. Costless copse
      • 2.3.4.2. Oriented trees
      • 2.3.4.3. The "infinity lemma"
      • 2.3.4.iv. Enumeration of trees
      • ii.iii.four.v. Path length
      • 2.3.four.6. History and bibliography
    • 2.3.5. Lists and Garbage Collection
  • 2.4. Multilinked Structures
  • 2.five. Dynamic Storage Resource allotment
  • two.6. History and Bibliography

Volume 2 – Seminumerical Algorithms [edit]

• Affiliate 3 – Random Numbers
  • three.1. Introduction
  • three.ii. Generating Uniform Random Numbers
    • 3.2.ane. The Linear Congruential Method
      • iii.2.one.1. Pick of modulus
      • 3.2.1.ii. Pick of multiplier
      • three.ii.1.3. Potency
    • iii.2.2. Other Methods
  • 3.3. Statistical Tests
    • 3.three.1. General Test Procedures for Studying Random Information
    • 3.3.2. Empirical Tests
    • three.3.3. Theoretical Tests
    • three.three.4. The Spectral Test
  • 3.four. Other Types of Random Quantities
    • 3.4.one. Numerical Distributions
    • 3.4.2. Random Sampling and Shuffling
  • 3.5. What Is a Random Sequence?
  • three.6. Summary
• Chapter iv – Arithmetic
  • 4.1. Positional Number Systems
  • iv.ii. Floating Point Arithmetic
    • 4.2.one. Unmarried-Precision Calculations
    • iv.2.2. Accuracy of Floating Point Arithmetic
    • 4.two.3. Double-Precision Calculations
    • four.2.four. Distribution of Floating Point Numbers
  • 4.three. Multiple Precision Arithmetics
    • iv.3.1. The Classical Algorithms
    • 4.3.2. Modular Arithmetic
    • 4.three.3. How Fast Can We Multiply?
  • 4.iv. Radix Conversion
  • 4.5. Rational Arithmetic
    • 4.v.1. Fractions
    • 4.5.two. The Greatest Common Divisor
    • 4.5.3. Analysis of Euclid's Algorithm
    • 4.v.4. Factoring into Primes
  • 4.6. Polynomial Arithmetic
    • 4.half dozen.1. Sectionalisation of Polynomials
    • 4.vi.2. Factorization of Polynomials
    • 4.vi.3. Evaluation of Powers (addition-chain exponentiation)
    • 4.6.4. Evaluation of Polynomials
  • 4.vii. Manipulation of Power Serial

Volume 3 – Sorting and Searching [edit]

• Chapter 5 – Sorting
  • 5.1. Combinatorial Properties of Permutations
    • 5.one.ane. Inversions
    • 5.one.2. Permutations of a Multiset
    • 5.i.3. Runs
    • 5.ane.4. Tableaux and Involutions
  • v.two. Internal sorting
    • 5.two.ane. Sorting by Insertion
    • 5.2.2. Sorting by Exchanging
    • 5.two.3. Sorting past Selection
    • v.ii.4. Sorting by Merging
    • v.2.5. Sorting by Distribution
  • 5.3. Optimum Sorting
    • five.3.1. Minimum-Comparison Sorting
    • 5.3.2. Minimum-Comparison Merging
    • 5.3.three. Minimum-Comparing Selection
    • 5.3.4. Networks for Sorting
  • 5.4. External Sorting
    • 5.4.1. Multiway Merging and Replacement Selection
    • 5.4.2. The Polyphase Merge
    • 5.4.3. The Cascade Merge
    • v.four.4. Reading Tape Backwards
    • 5.4.five. The Oscillating Sort
    • 5.4.6. Practical Considerations for Tape Merging
    • v.iv.7. External Radix Sorting
    • 5.4.8. Two-Record Sorting
    • v.iv.9. Disks and Drums
  • five.v. Summary, History, and Bibliography
• Chapter vi – Searching
  • six.1. Sequential Searching
  • vi.ii. Searching by Comparing of Keys
    • 6.2.1. Searching an Ordered Table
    • 6.two.2. Binary Tree Searching
    • 6.2.3. Balanced Copse
    • 6.2.iv. Multiway Trees
  • 6.three. Digital Searching
  • 6.4. Hashing
  • 6.5. Retrieval on Secondary Keys

Book 4A – Combinatorial Algorithms, Part 1 [edit]

• Chapter vii – Combinatorial Searching
  • 7.one. Zeros and Ones
    • 7.1.1. Boolean Nuts
    • 7.1.2. Boolean Evaluation
    • 7.1.3. Bitwise Tricks and Techniques
    • 7.1.4. Binary Decision Diagrams
  • vii.2. Generating All Possibilities
    • 7.2.1. Generating Basic Combinatorial Patterns
      • vii.2.1.one. Generating all n-tuples
      • 7.2.1.2. Generating all permutations
      • 7.2.1.3. Generating all combinations
      • 7.2.ane.four. Generating all partitions
      • 7.2.one.v. Generating all set partitions
      • 7.2.1.half-dozen. Generating all trees
      • 7.2.ane.7. History and farther references

Planned [edit]

Volume 4B, 4C, 4D – Combinatorial Algorithms [edit]

• Chapter vii – Combinatorial Searching (connected)
  • 7.2. Generating all possibilities (connected)
    • seven.2.2. Backtrack programming (published in Fascicle five)
      • vii.2.2.1. Dancing links (published in Fascicle v)
      • 7.2.ii.two. Satisfiability (published in Fascicle half-dozen)
      • 7.ii.2.3. Constraint satisfaction
      • 7.2.two.4. Hamiltonian paths and cycles (online draft in pre-fascicle 8A)
      • 7.2.2.5. Cliques
      • 7.two.two.6. Covers (Vertex embrace, Gear up cover trouble, Exact embrace, Clique cover)
      • 7.2.ii.7. Squares
      • 7.ii.2.8. A potpourri of puzzles (online draft in pre-fascicle 9B) (includes Perfect digital invariant)
      • seven.2.2.9. Estimating backtrack costs (chapter 6 of "Selected Papers on Assay of Algorithms", and Fascicle five, pp 44−47, under the heading "Running time estimates")
    • vii.2.iii. Generating inequivalent patterns (includes give-and-take of Pólya enumeration theorem) (run across "Techniques for Isomorph Rejection", Ch 4 of "Classification Algorithms for Codes and Designs" by Kaski and Östergård)
  • 7.iii. Shortest paths
  • vii.4. Graph algorithms
    • 7.four.1. Components and traversal
      • 7.4.1.1. Union-notice algorithms
      • seven.four.1.2. Depth-first search
      • 7.4.1.iii. Vertex and edge connectivity
    • 7.4.2. Special classes of graphs
    • 7.4.3. Expander graphs
    • 7.4.four. Random graphs
  • vii.5. Graphs and optimization
    • 7.5.i. Bipartite matching (including maximum-cardinality matching, Stable marriage problem, Mariages Stables)
    • 7.v.2. The assignment trouble
    • vii.v.three. Network flows
    • seven.5.iv. Optimum subtrees
    • vii.5.5. Optimum matching
    • vii.5.vi. Optimum orderings
  • 7.6. Independence theory
    • 7.6.1. Independence structures
    • 7.6.2. Efficient matroid algorithms
  • 7.7. Discrete dynamic programming (see also Transfer-matrix method)
  • 7.8. Co-operative-and-spring techniques
  • 7.9. Herculean tasks (aka NP-hard problems)
  • vii.10. Near-optimization
• Chapter eight – Recursion (chapter 22 of "Selected Papers on Assay of Algorithms")

Volume 5 – Syntactic Algorithms [edit]

• Chapter nine – Lexical scanning (includes too string search and data compression)
• Affiliate x – Parsing techniques

Volume 6 – The Theory of Context-free Languages^[12] [edit]

Book 7 – Compiler Techniques [edit]

English language editions [edit]

Current editions [edit]

These are the electric current editions in club by volume number:

• The Art of Figurer Programming, Volumes 1-4A Boxed Set. Third Edition (Reading, Massachusetts: Addison-Wesley, 2011), 3168pp. ISBN 978-0-321-75104-1, 0-321-75104-3
  • Book 1: Fundamental Algorithms. Third Edition (Reading, Massachusetts: Addison-Wesley, 1997), xx+650pp. ISBN 978-0-201-89683-i, 0-201-89683-4. Errata: [1] (2011-01-08), [2] (2020-03-26, 27th printing). Addenda: [3] (2011).
  • Volume 2: Seminumerical Algorithms. Third Edition (Reading, Massachusetts: Addison-Wesley, 1997), xiv+762pp. ISBN 978-0-201-89684-eight, 0-201-89684-2. Errata: [four] (2011-01-08), [5] (2020-03-26, 26th press). Addenda: [6] (2011).
  • Volume three: Sorting and Searching. Second Edition (Reading, Massachusetts: Addison-Wesley, 1998), fourteen+780pp.+foldout. ISBN 978-0-201-89685-5, 0-201-89685-0. Errata: [7] (2011-01-08), [8] (2020-03-26, 27th printing). Addenda: [9] (2011).
  • Volume 4A: Combinatorial Algorithms, Part 1. First Edition (Reading, Massachusetts: Addison-Wesley, 2011), fifteen+883pp. ISBN 978-0-201-03804-0, 0-201-03804-8. Errata: [10] (2020-03-26, ? printing).
• Book 1, Fascicle 1: MMIX – A RISC Figurer for the New Millennium. (Addison-Wesley, 2005-02-14) ISBN 0-201-85392-two. Errata: [11] (2020-03-16) (will be in the fourth edition of volume 1)
• Volume iv, Fascicle five: Mathematical Preliminaries Redux; Backtracking; Dancing Links. (Addison-Wesley, 2019-11-22) 13+382pp, ISBN 978-0-xiii-467179-6. Errata: [12] (2020-03-27) (volition go function of volume 4B)
• Volume 4, Fascicle 6: Satisfiability. (Addison-Wesley, 2015-12-08) 13+310pp, ISBN 978-0-13-439760-3. Errata: [xiii] (2020-03-26) (will get part of volume 4B)

Previous editions [edit]

Complete volumes [edit]

These volumes were superseded by newer editions and are in order by date.

• Volume one: Primal Algorithms. Kickoff edition, 1968, xxi+634pp, ISBN 0-201-03801-3.^[13]
• Volume 2: Seminumerical Algorithms. First edition, 1969, xi+624pp, ISBN 0-201-03802-1.^[13]
• Book 3: Sorting and Searching. First edition, 1973, eleven+723pp+foldout, ISBN 0-201-03803-Ten. Errata: [14].
• Book 1: Fundamental Algorithms. 2nd edition, 1973, xxi+634pp, ISBN 0-201-03809-9. Errata: [fifteen].
• Volume two: Seminumerical Algorithms. Second edition, 1981, thirteen+ 688pp, ISBN 0-201-03822-6. Errata: [xvi].
• The Art of Estimator Programming, Volumes 1-3 Boxed Prepare. Second Edition (Reading, Massachusetts: Addison-Wesley, 1998), pp. ISBN 978-0-201-48541-7, 0-201-48541-9

Fascicles [edit]

Volume 4'south fascicles 0–4 were revised and published as Volume 4A:

• Volume 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions. (Addison-Wesley Professional, 2008-04-28) vi+240pp, ISBN 0-321-53496-iv. Errata: [17] (2011-01-01).
• Volume 4, Fascicle i: Bitwise Tricks & Techniques; Binary Conclusion Diagrams. (Addison-Wesley Professional, 2009-03-27) viii+260pp, ISBN 0-321-58050-8. Errata: [eighteen] (2011-01-01).
• Volume iv, Fascicle two: Generating All Tuples and Permutations. (Addison-Wesley, 2005-02-14) v+127pp, ISBN 0-201-85393-0. Errata: [19] (2011-01-01).
• Volume iv, Fascicle iii: Generating All Combinations and Partitions. (Addison-Wesley, 2005-07-26) vi+150pp, ISBN 0-201-85394-9. Errata: [20] (2011-01-01).
• Volume 4, Fascicle 4: Generating All Copse; History of Combinatorial Generation. (Addison-Wesley, 2006-02-06) vi+120pp, ISBN 0-321-33570-viii. Errata: [21] (2011-01-01).

Volume four's fascicles 5–6 volition become part of Volume 4B:

• Volume four, Fascicle 5: Mathematical Preliminaries Redux; Backtracking; Dancing Links. (Addison-Wesley, 2019-eleven-22) 13+382pp, ISBN 978-0-thirteen-467179-vi. Errata: [22] (2020-03-27)
• Volume four, Fascicle 6: Satisfiability. (Addison-Wesley, 2015-12-08) xiii+310pp, ISBN 978-0-13-439760-three. Errata: [23] (2020-03-26)

Pre-fascicles [edit]

Volume 4's pre-fascicles 5A, 5B, and 5C were revised and published as fascicle 5.

Volume 4's pre-fascicle 6A was revised and published as fascicle 6.

• Volume 4, Pre-fascicle 8A: Hamiltonian Paths and Cycles
• Book 4, Pre-fascicle 9B: A Potpourri of Puzzles

See also [edit]

• Introduction to Algorithms

References [edit]

Notes

1. ^ The dedication was worded slightly differently in the first edition.

Citations

1. ^ "notation for box iii, folder 1".
2. ^ "Addison-Wesley Pearson webpage".
3. ^ "Pearson Educational".
4. ^ Frana, Philip L. (2001-11-08). "An Interview with Donald E. Knuth". hdl:11299/107413.
5. ^ Donald Knuth, This Week's Commendation Archetype, Current Contents, Number 34 (August 23, 1993), page 8.
6. ^ Albers, Donald J. (2008). "Donald Knuth". In Albers, Donald J.; Alexanderson, Gerald L. (eds.). Mathematical People: Profiles and Interviews (two ed.). A K Peters. ISBN978-1-56881-340-0.
7. ^ "Reflections on a yr of reading Knuth". infinitepartitions.com . Retrieved 2020-07-25 . I worked, or at to the lowest degree attempted to piece of work, every single trouble in the start volume. In some cases I settled for just understanding what the question was trying to ask for. In some cases I failed even to accomplish that (don't judge me until you attempt information technology yourself). Each trouble is assigned a difficulty rating from 0-50 where 0 is little and fifty is "unsolved enquiry problem" (in the starting time edition, Fermat's last theorem was listed as a fifty, but since Andrew Wiles proved information technology, information technology's bumped down to a 45 in the current edition). I recollect I was able to solve most of the problems rated < xx — it was hit and miss beyond that. Virtually of the problems fell into the 20-thirty difficulty range, but Knuth'southward idea of "difficult" is subjective, and problems that he considers to be of average difficulty ended up stretching my comparatively tiny brain painfully. I've never climbed Mount Everest, merely I imagine the whole ordeal feels like: painful while you're going through information technology, but triumphant when yous achieve the pinnacle.
8. ^ "Donald E. Knuth – A. M. Turing Award Winner". AM Turing . Retrieved 2017-01-25 .
9. ^ Morrison, Philip; Morrison, Phylis (November–December 1999). "100 or so Books that shaped a Century of Scientific discipline". American Scientist. Sigma Eleven, The Scientific Inquiry Society. 87 (6). Archived from the original on 2008-08-20. Retrieved 2008-01-11 .
10. ^ Weinberger, Matt. "Bill Gates once said 'definitely send me a résumé' if yous finish this fiendishly hard volume". Business organization Insider . Retrieved 2016-06-13 .
11. ^ Lohr, Steve (2001-12-17). "Frances E. Holberton, 84, Early Computer Developer". The New York Times . Retrieved 2010-05-17 .
12. ^ "TAOCP – Time to come plans".
13. ^ ^{a b} Wells, Mark B. (1973). "Review: The Fine art of Computer Programming, Book 1. Cardinal Algorithms and Volume 2. Seminumerical Algorithms by Donald Eastward. Knuth" (PDF). Bulletin of the American Mathematical Guild. 79 (3): 501–509. doi:10.1090/s0002-9904-1973-13173-8.

Sources

• Slater, Robert (1987). Portraits in Silicon. MIT Printing. ISBN0-262-19262-four.
• Shasha, Dennis; Lazere, Cathy (1995). Out of Their Minds: The Lives and Discoveries of fifteen Peachy Computer Scientists . Copernicus. ISBN0-387-97992-1.

External links [edit]

• Overview of topics (Knuth's personal homepage)
• Oral history interview with Donald E. Knuth at Charles Babbage Constitute, Academy of Minnesota, Minneapolis. Knuth discusses software patenting, structured programming, collaboration and his development of TeX. The oral history discusses the writing of The Art of Computer Programming.
• "Robert Westward Floyd, In Memoriam", by Donald E. Knuth - (on the influence of Bob Floyd)
• TAoCP and its Influence of Estimator Science (Softpanorama)

houstonpleaus.blogspot.com

Source: https://en.wikipedia.org/wiki/The_Art_of_Computer_Programming

Share this post