The Art of Computer Programming Volume 2 Seminumerical Algorithms

Books about algorithms by Donald Knuth

The Art of Figurer Programming

The Art of Reckoner Programming, Volume 1: Fundamental Algorithms
Writer	Donald Knuth
Country	United States
Linguistic communication	English
Genre	Non-fiction Monograph
Publisher	Addison-Wesley
Publication date	1968– (the volume is still 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 by the reckoner scientist Donald Knuth presenting programming algorithms and their analysis.

Knuth began the project, originally conceived as a single book with twelve chapters, in 1962. The commencement iii volumes of what was then expected to be a seven-book set were published in 1968, 1969, and 1973. Work began in earnest on Book iv in 1973, but was suspended in 1977 for piece of work on typesetting prompted by the 2nd edition of Volume 2. Writing of the final re-create of Volume 4A began in longhand in 2001, and the first online pre-fascicle, 2A, appeared after in 2001.^[one] The starting time published installment of Volume iv appeared in paperback equally Fascicle 2 in 2005. The hardback Volume 4A, combining Book 4, Fascicles 0–4, was published in 2011. Book 4, Fascicle 6 ("Satisfiability") was released in December 2015; Volume four, Fascicle v ("Mathematical Preliminaries Redux; Backtracking; Dancing Links") was released in November 2019.

The published Fascicles 5 and half-dozen are expected to make upwards the first two-thirds of Volume 4B. Knuth has non appear whatever estimated date for release of Book 4B, although his method used for Volume 4A is to release the hardback volume onetime after release of the paperback fascicles contained in it. Near-term publisher estimates put the release engagement at May or June 2019, which proved to be incorrect.^{[2] [three]}

History [edit]

Subsequently winning a Westinghouse Talent Search scholarship, Knuth enrolled at the Case Institute of Technology (now Case Western Reserve University), where his functioning was and so outstanding that the faculty voted to award him a principal of science upon his completion of the bachelor caste. 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 unabridged year.^[four] Such exploits made Knuth a topic of discussion amongst the mathematics department, which included Richard S. Varga.

In January 1962, when he was a graduate student in the mathematics section at Caltech, Knuth was approached by Addison-Wesley to write a book nearly compiler design, and he proposed a larger scope. He came upwardly with a list of 12 chapter titles the aforementioned day. In the summertime of 1962 he worked on a FORTRAN compiler for UNIVAC. During this time, he as well came upwardly with a mathematical analysis of linear probing, which convinced him to present the material with a quantitative arroyo. After receiving his PhD in June 1963, he began working on his manuscript, of which he finished his beginning typhoon in June 1965, at 3000 mitt-written pages.^[5] He had causeless that well-nigh v mitt-written pages would translate into one printed page, but his publisher said instead that about 1+ 1⁄2 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 almost accepting such a project from a graduate student. At this point, Knuth received support 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'south enthusiastic endorsement, the publisher accepted Knuth'southward expanded plans. In its expanded version, the book would be published in 7 volumes, each with just ane or 2 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 programme for Book iv has since expanded to include Volumes 4A, 4B, 4C, 4D, and possibly more.

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

The offering of a then-called Knuth reward check worth "one hexadecimal dollar" (100_HEX base of operations 16 cents, in decimal, is $2.56) for any errors found, and the correction of these errors in subsequent printings, has contributed to the highly polished and yet-authoritative nature of the work, long after its first publication. Another characteristic of the volumes is the variation in the difficulty of the exercises. Knuth even has a numerical difficulty scale for rating those exercises, varying from 0 to 50, where 0 is trivial, and 50 is an open question in contemporary research.^[7]

Knuth'due south dedication reads:

This series of books is affectionately defended
to the Type 650 computer one time installed at
Case Institute of Technology,
with whom I accept spent many pleasant evenings.^[a]

Assembly language in the book [edit]

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

Critical response [edit]

Knuth was awarded the 1974 Turing Award "for his major contributions to the analysis of algorithms […], and in particular for his contributions to the 'fine art of computer programming' through his well-known books in a continuous series past this title."^[8] American Scientist has included this work among "100 or and so Books that shaped a Century of Science", referring to the twentieth century,^[ix] and within the computer scientific discipline community information technology is regarded equally the first and nonetheless the best comprehensive handling of its subject. ^{[ failed verification ]} Covers of the 3rd edition of Book 1 quote Beak Gates as saying, "If you call back you're a really practiced programmer… read (Knuth's) Art of Calculator Programming… You should definitely send me a résumé if you can read the whole thing."^[10] The New York Times referred to it equally "the profession's defining treatise".^[xi]

Volumes [edit]

Completed [edit]

• Volume ane – Fundamental Algorithms
  • Chapter 1 – Basic concepts
  • Chapter 2 – Data structures
• Volume two – Seminumerical Algorithms
  • Chapter 3 – Random numbers
  • Chapter four – Arithmetic
• Volume 3 – Sorting and Searching
  • Chapter 5 – Sorting
  • Affiliate 6 – Searching
• Volume 4A – Combinatorial Algorithms
  • Affiliate 7 – Combinatorial searching (part 1)

Planned [edit]

• Volume 4B... – Combinatorial Algorithms (chapters 7 & eight released in several subvolumes)
  • Chapter 7 – Combinatorial searching (continued)
  • Affiliate 8 – Recursion
• Volume 5 – Syntactic Algorithms
  • Chapter nine – Lexical scanning (also includes string search and data compression)
  • Chapter ten – Parsing techniques
• Volume 6 – The Theory of Context-Free Languages
• Volume seven – Compiler Techniques

Affiliate outlines [edit]

Completed [edit]

Volume one – Fundamental Algorithms [edit]

• Chapter 1 – Basic concepts
  • i.1. Algorithms
  • i.2. Mathematical Preliminaries
    • one.two.1. Mathematical Consecration
    • 1.2.ii. Numbers, Powers, and Logarithms
    • 1.2.3. Sums and Products
    • i.2.4. Integer Functions and Simple Number Theory
    • ane.2.5. Permutations and Factorials
    • ane.2.6. Binomial Coefficients
    • one.2.vii. Harmonic Numbers
    • ane.ii.eight. Fibonacci Numbers
    • 1.2.9. Generating Functions
    • 1.2.10. Assay of an Algorithm
    • 1.2.eleven. Asymptotic Representations
      • 1.2.11.1. The O-notation
      • 1.2.eleven.2. Euler's summation formula
      • one.two.11.iii. Some asymptotic calculations
  • 1.3 MMIX (MIX in the hardback copy just updated by fascicle 1)
    • 1.three.1. Clarification of MMIX
    • 1.3.two. The MMIX Assembly Language
    • ane.3.iii. Applications to Permutations
  • 1.4. Some Fundamental Programming Techniques
    • 1.4.i. Subroutines
    • 1.4.2. Coroutines
    • one.4.three. Interpretive Routines
      • ane.iv.iii.1. A MIX simulator
      • 1.four.3.2. Trace routines
    • 1.4.4. Input and Output
    • 1.4.v. History and Bibliography
• Chapter two – Information Structures
  • ii.ane. Introduction
  • two.two. Linear Lists
    • 2.2.1. Stacks, Queues, and Deques
    • 2.two.two. Sequential Allocation
    • 2.2.3. Linked Allocation (topological sorting)
    • 2.2.4. Round Lists
    • 2.2.5. Doubly Linked Lists
    • ii.2.six. Arrays and Orthogonal Lists
  • ii.3. Trees
    • 2.3.1. Traversing Binary Trees
    • 2.3.2. Binary Tree Representation of Trees
    • 2.3.3. Other Representations of Trees
    • 2.3.iv. Basic Mathematical Properties of Trees
      • 2.3.4.1. Complimentary trees
      • ii.iii.four.2. Oriented trees
      • 2.3.4.3. The "infinity lemma"
      • 2.3.4.4. Enumeration of trees
      • two.3.4.5. Path length
      • two.iii.4.6. History and bibliography
    • 2.3.5. Lists and Garbage Collection
  • 2.4. Multilinked Structures
  • 2.5. Dynamic Storage Allocation
  • two.6. History and Bibliography

Volume two – Seminumerical Algorithms [edit]

• Chapter iii – Random Numbers
  • three.1. Introduction
  • 3.ii. Generating Uniform Random Numbers
    • 3.2.ane. The Linear Congruential Method
      • 3.2.1.one. Choice of modulus
      • 3.2.1.two. Selection of multiplier
      • 3.two.1.iii. Authority
    • three.two.2. Other Methods
  • three.3. Statistical Tests
    • iii.3.1. General Test Procedures for Studying Random Data
    • iii.3.two. Empirical Tests
    • iii.3.3. Theoretical Tests
    • 3.iii.4. The Spectral Test
  • 3.four. Other Types of Random Quantities
    • 3.iv.1. Numerical Distributions
    • 3.4.2. Random Sampling and Shuffling
  • 3.5. What Is a Random Sequence?
  • 3.6. Summary
• Chapter 4 – Arithmetic
  • four.one. Positional Number Systems
  • 4.2. Floating Point Arithmetic
    • 4.two.1. Unmarried-Precision Calculations
    • 4.2.two. Accuracy of Floating Point Arithmetic
    • 4.2.3. Double-Precision Calculations
    • 4.2.4. Distribution of Floating Point Numbers
  • 4.3. Multiple Precision Arithmetic
    • iv.3.one. The Classical Algorithms
    • 4.iii.2. Modular Arithmetic
    • iv.3.three. How Fast Can We Multiply?
  • iv.4. Radix Conversion
  • 4.v. Rational Arithmetic
    • 4.five.1. Fractions
    • four.5.2. The Greatest Mutual Divisor
    • 4.five.3. Analysis of Euclid's Algorithm
    • 4.5.iv. Factoring into Primes
  • 4.6. Polynomial Arithmetic
    • iv.6.1. Division of Polynomials
    • 4.6.2. Factorization of Polynomials
    • 4.vi.iii. Evaluation of Powers (addition-chain exponentiation)
    • 4.half dozen.4. Evaluation of Polynomials
  • iv.seven. Manipulation of Power Serial

Volume 3 – Sorting and Searching [edit]

• Chapter 5 – Sorting
  • v.1. Combinatorial Backdrop of Permutations
    • 5.ane.1. Inversions
    • five.i.2. Permutations of a Multiset
    • 5.ane.three. Runs
    • 5.1.4. Tableaux and Involutions
  • 5.two. Internal sorting
    • 5.2.ane. Sorting past Insertion
    • 5.2.ii. Sorting by Exchanging
    • v.ii.3. Sorting by Pick
    • 5.2.4. Sorting past Merging
    • 5.two.5. Sorting by Distribution
  • 5.3. Optimum Sorting
    • 5.3.1. Minimum-Comparing Sorting
    • 5.3.2. Minimum-Comparing Merging
    • v.three.3. Minimum-Comparing Selection
    • 5.three.iv. Networks for Sorting
  • 5.4. External Sorting
    • v.iv.1. Multiway Merging and Replacement Selection
    • five.4.2. The Polyphase Merge
    • five.4.iii. The Cascade Merge
    • 5.4.iv. Reading Tape Backwards
    • 5.iv.5. The Oscillating Sort
    • 5.4.vi. Applied Considerations for Tape Merging
    • 5.4.7. External Radix Sorting
    • 5.four.eight. Two-Tape Sorting
    • 5.4.nine. Disks and Drums
  • 5.5. Summary, History, and Bibliography
• Affiliate 6 – Searching
  • 6.1. Sequential Searching
  • 6.2. Searching by Comparison of Keys
    • 6.2.1. Searching an Ordered Tabular array
    • 6.2.2. Binary Tree Searching
    • 6.2.3. Balanced Trees
    • half-dozen.2.4. Multiway Copse
  • vi.iii. Digital Searching
  • six.4. Hashing
  • six.5. Retrieval on Secondary Keys

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

• Chapter 7 – Combinatorial Searching
  • 7.1. Zeros and Ones
    • 7.i.ane. Boolean Basics
    • seven.ane.2. Boolean Evaluation
    • 7.1.3. Bitwise Tricks and Techniques
    • vii.1.4. Binary Decision Diagrams
  • 7.2. Generating All Possibilities
    • seven.two.ane. Generating Basic Combinatorial Patterns
      • seven.2.ane.1. Generating all n-tuples
      • 7.2.1.2. Generating all permutations
      • 7.2.1.three. Generating all combinations
      • seven.2.i.4. Generating all partitions
      • 7.ii.one.5. Generating all gear up partitions
      • seven.2.one.6. Generating all trees
      • seven.2.1.7. History and farther references

Planned [edit]

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

• Chapter vii – Combinatorial Searching (connected)
  • seven.two. Generating all possibilities (continued)
    • 7.2.ii. Backtrack programming (published in Fascicle 5)
      • 7.2.2.ane. Dancing links (published in Fascicle 5)
      • 7.2.2.2. Satisfiability (published in Fascicle 6)
      • 7.2.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, Set cover problem, Exact cover, Clique cover)
      • 7.ii.2.7. Squares
      • 7.two.2.8. A potpourri of puzzles (online draft in pre-fascicle 9B) (includes Perfect digital invariant)
      • 7.two.2.9. Estimating backtrack costs (chapter half dozen of "Selected Papers on Analysis of Algorithms", and Fascicle 5, pp 44−47, under the heading "Running time estimates")
    • 7.2.iii. Generating inequivalent patterns (includes discussion of Pólya enumeration theorem) (run across "Techniques for Isomorph Rejection", Ch 4 of "Nomenclature Algorithms for Codes and Designs" past Kaski and Östergård)
  • 7.three. Shortest paths
  • seven.four. Graph algorithms
    • vii.4.ane. Components and traversal
      • seven.4.one.i. Matrimony-find algorithms
      • vii.4.1.2. Depth-first search
      • 7.iv.1.3. Vertex and edge connectivity
    • 7.4.2. Special classes of graphs
    • vii.four.3. Expander graphs
    • 7.4.4. Random graphs
  • vii.five. Graphs and optimization
    • vii.v.1. Bipartite matching (including maximum-cardinality matching, Stable marriage problem, Mariages Stables)
    • 7.5.ii. The consignment trouble
    • 7.five.3. Network flows
    • 7.5.four. Optimum subtrees
    • 7.5.5. Optimum matching
    • 7.5.vi. Optimum orderings
  • 7.6. Independence theory
    • 7.six.ane. Independence structures
    • 7.6.2. Efficient matroid algorithms
  • 7.7. Discrete dynamic programming (see likewise Transfer-matrix method)
  • 7.eight. Branch-and-leap techniques
  • 7.ix. Herculean tasks (aka NP-difficult bug)
  • 7.10. Near-optimization
• Chapter 8 – Recursion (chapter 22 of "Selected Papers on Analysis of Algorithms")

Volume 5 – Syntactic Algorithms [edit]

• Chapter 9 – Lexical scanning (includes also string search and data compression)
• Affiliate 10 – Parsing techniques

Volume six – The Theory of Context-costless Languages^[12] [edit]

Volume 7 – Compiler Techniques [edit]

English language editions [edit]

Current editions [edit]

These are the current editions in gild by volume number:

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

Previous editions [edit]

Complete volumes [edit]

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

• Book one: Primal Algorithms. Starting time edition, 1968, xxi+634pp, ISBN 0-201-03801-iii.^[13]
• Volume two: Seminumerical Algorithms. Starting time edition, 1969, xi+624pp, ISBN 0-201-03802-1.^[13]
• Volume three: Sorting and Searching. First edition, 1973, xi+723pp+foldout, ISBN 0-201-03803-X. Errata: [14].
• Volume one: Central Algorithms. 2nd edition, 1973, xxi+634pp, ISBN 0-201-03809-nine. Errata: [15].
• Volume 2: Seminumerical Algorithms. Second edition, 1981, xiii+ 688pp, ISBN 0-201-03822-6. Errata: [16].
• The Art of Computer Programming, Volumes 1-3 Boxed Fix. Second Edition (Reading, Massachusetts: Addison-Wesley, 1998), pp. ISBN 978-0-201-48541-vii, 0-201-48541-9

Fascicles [edit]

Volume four's fascicles 0–4 were revised and published every bit Volume 4A:

• Volume 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions. (Addison-Wesley Professional, 2008-04-28) six+240pp, ISBN 0-321-53496-4. Errata: [17] (2011-01-01).
• Volume 4, Fascicle one: Bitwise Tricks & Techniques; Binary Decision Diagrams. (Addison-Wesley Professional, 2009-03-27) viii+260pp, ISBN 0-321-58050-8. Errata: [18] (2011-01-01).
• Volume 4, Fascicle 2: Generating All Tuples and Permutations. (Addison-Wesley, 2005-02-14) five+127pp, ISBN 0-201-85393-0. Errata: [xix] (2011-01-01).
• Volume 4, Fascicle iii: Generating All Combinations and Partitions. (Addison-Wesley, 2005-07-26) 6+150pp, ISBN 0-201-85394-9. Errata: [xx] (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 4's fascicles 5–6 will get function of Book 4B:

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

Pre-fascicles [edit]

Book four'south pre-fascicles 5A, 5B, and 5C were revised and published as fascicle 5.

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

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

See besides [edit]

• Introduction to Algorithms

References [edit]

Notes

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

Citations

1. ^ "note for box iii, folder 1".
2. ^ "Addison-Wesley Pearson webpage".
3. ^ "Pearson Educational".
4. ^ Frana, Philip L. (2001-11-08). "An Interview with Donald Eastward. Knuth". hdl:11299/107413.
5. ^ Donald Knuth, This Calendar week'southward Citation Archetype, Current Contents, Number 34 (August 23, 1993), page 8.
6. ^ Albers, Donald J. (2008). "Donald Knuth". In Albers, Donald J.; Alexanderson, Gerald 50. (eds.). Mathematical People: Profiles and Interviews (two ed.). A Yard Peters. ISBN978-one-56881-340-0.
7. ^ "Reflections on a year of reading Knuth". infinitepartitions.com . Retrieved 2020-07-25 . I worked, or at least attempted to piece of work, every unmarried problem in the first volume. In some cases I settled for just understanding what the question was trying to inquire for. In some cases I failed fifty-fifty to accomplish that (don't guess me until you lot try it yourself). Each problem is assigned a difficulty rating from 0-l where 0 is piddling and 50 is "unsolved research problem" (in the offset edition, Fermat's final theorem was listed as a 50, but since Andrew Wiles proved information technology, it's bumped down to a 45 in the current edition). I remember I was able to solve well-nigh of the problems rated < 20 — it was hit and miss across that. Well-nigh of the problems fell into the 20-30 difficulty range, simply Knuth'due south thought of "difficult" is subjective, and bug that he considers to be of average difficulty concluded upward stretching my comparatively tiny encephalon painfully. I've never climbed Mount Everest, but I imagine the whole ordeal feels like: painful while y'all're going through it, but triumphant when you reach the pinnacle.
8. ^ "Donald Eastward. Knuth – A. K. Turing Award Winner". AM Turing . Retrieved 2017-01-25 .
9. ^ Morrison, Philip; Morrison, Phylis (Nov–December 1999). "100 or so Books that shaped a Century of Science". American Scientist. Sigma Xi, The Scientific Research Society. 87 (6). Archived from the original on 2008-08-20. Retrieved 2008-01-xi .
10. ^ Weinberger, Matt. "Neb Gates once said 'definitely send me a résumé' if you finish this fiendishly difficult volume". Business Insider . Retrieved 2016-06-13 .
11. ^ Lohr, Steve (2001-12-17). "Frances E. Holberton, 84, Early Calculator Programmer". The New York Times . Retrieved 2010-05-17 .
12. ^ "TAOCP – Future plans".
13. ^ ^{a b} Wells, Marking B. (1973). "Review: The Art of Reckoner Programming, Book ane. Fundamental Algorithms and Volume ii. Seminumerical Algorithms by Donald E. Knuth" (PDF). Bulletin of the American Mathematical Society. 79 (iii): 501–509. doi:10.1090/s0002-9904-1973-13173-viii.

Sources

• Slater, Robert (1987). Portraits in Silicon. MIT Press. ISBN0-262-19262-four.
• Shasha, Dennis; Lazere, Cathy (1995). Out of Their Minds: The Lives and Discoveries of 15 Great Reckoner 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 Found, 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 Reckoner Programming.
• "Robert W Floyd, In Memoriam", by Donald E. Knuth - (on the influence of Bob Floyd)
• TAoCP and its Influence of Information science (Softpanorama)

bullockmilteven.blogspot.com

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

Share this post