36:
209:
337:, is $ 2.56) for any errors found, and the correction of these errors in subsequent printings, has contributed to the highly polished and still-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.
298:. With Varga's enthusiastic endorsement, the publisher accepted Knuth's expanded plans. In its expanded version, the book would be published in seven volumes, each with just one or two chapters. 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 4 has since expanded to include Volumes 4A, 4B, 4C, 4D, and possibly more.
190:
When Knuth began the project in 1962, he originally conceived of it as a single book with twelve chapters. The first three volumes of what was then expected to be a seven-volume set were published in 1968, 1969, and 1973. Work began in earnest on Volume 4 in 1973, but was suspended in 1977 for work
195:
2 in 2005. The hardback Volume 4A, combining Volume 4, Fascicles 0–4, was published in 2011. Volume 4, Fascicle 6 ("Satisfiability") was released in
December 2015; Volume 4, Fascicle 5 ("Mathematical Preliminaries Redux; Backtracking; Dancing Links") was released in November 2019.
199:
Volume 4B consists of material evolved from
Fascicles 5 and 6. The manuscript was sent to the publisher on August 1, 2022, and the volume was published in September 2022. Fascicle 7, planned for Volume 4C, was the subject of Knuth's talk on August 3, 2022.
191:
on typesetting prompted by the second edition of Volume 2. Writing of the final copy of Volume 4A began in longhand in 2001, and the first online pre-fascicle, 2A, appeared later in 2001. The first published installment of Volume 4 appeared in paperback as
285:
printed pages of material, which closely matches the size of the first three published volumes. At this point, Knuth received support from
Richard S. Varga, who was the scientific adviser to the publisher. Varga was visiting
263:, which convinced him to present the material with a quantitative approach. After receiving his Ph.D. in June 1963, he began working on his manuscript, of which he finished his first draft in June 1965, at
240:, earning more in his summer months than full professors did for an entire year. Such exploits made Knuth a topic of discussion among the mathematics department, which included
2564:
1466:
7.2.2.9. Estimating backtrack costs (chapter 6 of "Selected Papers on
Analysis of Algorithms", and Fascicle 5, pp. 44−47, under the heading "Running time estimates")
251:
to write a book about compiler design, and he proposed a larger scope. He came up with a list of twelve chapter titles the same day. In the summer of 1962 he worked on a
412:
has included this work among "100 or so Books that shaped a
Century of Science", referring to the twentieth century. Covers of the third edition of Volume 1 quote
267:
hand-written pages. He had assumed that about five hand-written pages would translate into one printed page, but his publisher said instead that about
406:, and in particular for his contributions to the 'art of computer programming' through his well-known books in a continuous series by this title."
3074:
2942:
309:) was no longer available. In 1977, he decided to spend some time creating something more suitable. Eight years later, he returned with
2598:
2648:
379:
2713:
2576:
2391:
2365:
1475:) (see "Techniques for Isomorph Rejection", chapter 4 of "Classification Algorithms for Codes and Designs" by Kaski and Östergård)
3207:
2883:
3059:
2496:
2119:
2102:
1981:
1964:
1830:
1806:
1779:
1752:
1721:
1704:
865:
3064:
1637:
3212:
3192:
2663:
Now 82, he's hard at work on part B of volume 4, and he anticipates that the book will have at least parts A through F.
370:
assembly language", which runs on the hypothetical MIX computer. Currently, the MIX computer is being replaced by the
2798:
2772:
2401:
2375:
2080:
2063:
2046:
2029:
2012:
1985:
1968:
1947:
1930:
1913:
1899:
1885:
1853:
1834:
1810:
1783:
1756:
1725:
1708:
125:
247:
In
January 1962, when he was a graduate student in the mathematics department at Caltech, Knuth was approached by
3222:
3217:
3197:
3182:
3177:
3172:
3167:
3162:
3079:
2949:
1419:
731:
221:
217:
3202:
1008:
903:
291:
3187:
1069:
949:
909:
3121:
3090:
1533:
690:
352:
187:. Volumes 1–5 are intended to represent the central core of computer programming for sequential machines.
133:
2234:
The remaining pre-fascicles contain draft material that is set to appear in future fascicles and volumes.
1472:
1261:
20:
2876:
2305:
783:
779:
548:
526:
Volume 4C, 4D, ... Combinatorial
Algorithms (chapters 7 & 8 released in several subvolumes)
2921:
2825:
2458:
1460:
876:
773:
3069:
2351:
1425:
958:
3085:
2914:
2599:"Bill Gates once said 'definitely send me a résumé' if you finish this fiendishly difficult book"
1611:
1537:
1278:
3054:
2979:
2935:
2829:
2480:
1590:
809:
707:
620:
458:
403:
367:
184:
3131:
2869:
1481:
1255:
818:
568:
306:
233:
3141:
3023:
2928:
2536:
1554:
1496:
651:
229:
177:
2692:
2623:
8:
3227:
2139:
1586:
1326:
1045:
981:
796:
678:
669:
848:
3111:
2853:
2454:
1548:
1502:
1320:
787:
422:
408:
321:
2794:
2768:
2492:
2397:
2371:
2115:
2098:
2076:
2059:
2042:
2025:
2008:
1977:
1960:
1943:
1926:
1909:
1895:
1881:
1849:
1826:
1825:. First Edition (Upper Saddle River, New Jersey: Addison-Wesley, 2023), xviii+714pp.
1802:
1775:
1774:. Second Edition (Reading, Massachusetts: Addison-Wesley, 1998), xiv+780pp.+foldout.
1748:
1717:
1700:
1442:
1314:
1271:
1096:
482:
472:
387:
287:
225:
120:
2741:
2005:
Volume 4, Fascicle 0: Introduction to
Combinatorial Algorithms and Boolean Functions
2736:
2675:
2436:
2095:
Volume 4, Fascicle 5: Mathematical
Preliminaries Redux; Backtracking; Dancing Links
1633:
1597:
1487:
1202:
1162:
663:
552:
544:
488:
476:
281:
hand-written pages translated to one printed page. This meant he had approximately
241:
144:
2828:, University of Minnesota, Minneapolis, 2001. Knuth discusses software patenting,
2432:
1801:. First Edition (Upper Saddle River, New Jersey: Addison-Wesley, 2011), xv+883pp.
224:), where his performance was so outstanding that the faculty voted to award him a
3126:
3008:
2847:
2787:
2762:
2560:
1997:
1814:
1032:
966:
657:
192:
1787:
1760:
1729:
3013:
2291:
2284:
2274:
2073:
Volume 4, Fascicle 4: Generating All Trees; History of
Combinatorial Generation
2022:
Volume 4, Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams
1951:
1934:
1917:
1516:
1432:
1371:
987:
684:
447:
260:
248:
83:
2277:
2267:
2260:
2253:
2246:
2239:
2227:
2220:
2216:
2212:
2205:
2201:
2194:
2190:
2183:
2179:
2172:
2168:
2161:
2157:
2153:
2123:
2106:
2084:
2067:
2050:
2033:
2016:
1857:
1793:
1766:
1739:
3156:
3106:
2789:
Out of Their Minds: The Lives and Discoveries of 15 Great Computer Scientists
2782:
1838:
1817:
1360:
1122:
894:
635:
508:
496:
208:
2815:
2512:
1790:
1763:
1732:
2892:
2488:
2150:
1747:. Third Edition (Reading, Massachusetts: Addison-Wesley, 1997), xiv+762pp.
1735:
1522:
1450:
1438:
1412:
1354:
1081:
754:
420:… You should definitely send me a résumé if you can read the whole thing."
399:
173:
51:
35:
1873:
These volumes were superseded by newer editions and are in order by date.
1716:. Third Edition (Reading, Massachusetts: Addison-Wesley, 1997), xx+650pp.
3116:
1541:
1446:
1364:
1308:
1302:
1102:
824:
720:
641:
416:
as saying, "If you think you're a really good programmer… read (Knuth's)
330:
326:
302:
301:
In 1976, Knuth prepared a second edition of Volume 2, requiring it to be
69:
2843:
2440:
1976:. Third Edition (Reading, Massachusetts: Addison-Wesley, 2011), 3168pp.
1846:
Volume 1, Fascicle 1: MMIX – A RISC Computer for the New Millennium
2418:"CP 2022 All Questions Answered, July 31–August 5, 2022, Haifa, Israel"
2417:
1234:
1211:
1056:
464:
413:
2090:
Volume 4, Fascicles 5–6 were revised and published as Volume 4B.
3046:
3003:
1959:. Second Edition (Reading, Massachusetts: Addison-Wesley, 1998), pp.
1619:
737:
645:
626:
611:
533:
390:
necessary for the speed and memory usage of algorithms to be judged.
220:
scholarship, Knuth enrolled at the Case Institute of Technology (now
180:
169:
112:
73:
2330:
The dedication was worded slightly differently in the first edition.
1388:
259:. During this time, he also came up with a mathematical analysis of
2973:
2960:
842:
579:
383:
237:
1651:
3136:
2716:
The Art of Computer Programming, Volume 1. Fundamental Algorithms
1644:
1604:
1577:
559:
347:
334:
295:
252:
41:
The Art of Computer Programming, Volume 1: Fundamental Algorithms
2479:
Albers, Donald J. (2008). "Donald Knuth". In Albers, Donald J.;
2056:
Volume 4, Fascicle 3: Generating All Combinations and Partitions
1471:
7.2.3. Generating inequivalent patterns (includes discussion of
2861:
1341:
1245:
305:
again, but the style of type used in the first edition (called
256:
2575:(6). Sigma Xi, The Scientific Research Society. Archived from
2821:
1296:
1025:
2039:
Volume 4, Fascicle 2: Generating All Tuples and Permutations
3036:
2995:
2984:
1622:(chapter 22 of "Selected Papers on Analysis of Algorithms")
703:
375:
371:
1699:. (Reading, Massachusetts: Addison-Wesley, 2023), 3904pp.
1692:
These are the current editions in order by volume number:
145:
3031:
2968:
2833:
310:
2024:. (Addison-Wesley Professional, 2009-03-27) viii+260pp,
1859:(2024-05-14) (will be in the fourth edition of volume 1)
426:
referred to it as "the profession's defining treatise".
2649:"The Computer Scientist Who Can't Stop Telling Stories"
2247:
Volume 4, Pre-fascicle 8A: Hamiltonian Paths and Cycles
1974:
The Art of Computer Programming, Volumes 1-4A Boxed Set
1697:
The Art of Computer Programming, Volumes 1-4B Boxed Set
934:
3.3.1. General Test Procedures for Studying Random Data
2007:. (Addison-Wesley Professional, 2008-04-28) vi+240pp,
1957:
The Art of Computer Programming, Volumes 1-3 Boxed Set
887:
232:. During his summer vacations, Knuth was hired by the
2624:"Frances E. Holberton, 84, Early Computer Programmer"
2292:
Volume 4, Pre-fascicle 16A: Introduction to Recursion
2268:
Volume 4, Pre-fascicle 9C: Estimating Backtrack Costs
2208:
were revised * and published as Volume 4, fascicle 4.
1405:
Chapter 7 – Combinatorial Searching (continued)
1347:
Chapter 7 – Combinatorial Searching (continued)
2857:
and its Influence of Computer Science (Softpanorama)
2275:
Volume 4, Pre-fascicle 12A: Components and Traversal
1652:
Volume 6 – The Theory of Context-free Languages
601:
529:
Chapter 7 – Combinatorial searching (continued)
386:
of the MIX architecture. Knuth considers the use of
2223:
were revised and published as Volume 4, fascicle 5.
2197:
were revised and published as Volume 4, fascicle 3.
2186:
were revised and published as Volume 4, fascicle 2.
2175:
were revised and published as Volume 4, fascicle 1.
2164:
were revised and published as Volume 4, fascicle 0.
1089:
2786:
2565:"100 or so Books that shaped a Century of Science"
2513:"GNU MDK - GNU Project - Free Software Foundation"
2240:Volume 4, Pre-fascicle 7A: Constraint Satisfaction
2230:was revised and published as Volume 4, fascicle 6.
2142:was revised and published as Volume 1, fascicle 1.
2000:0–4 were revised and published as Volume 4A.
1678:Chapter 12 – Programming Language Translation
1626:
585:Chapter 12 – Programming Language Translation
2844:"Robert W Floyd, In Memoriam", by Donald E. Knuth
2261:Volume 4, Pre-fascicle 9B: A Potpourri of Puzzles
1672:
1389:Volumes 4C, 4D, 4E, 4F – Combinatorial Algorithms
1342:Volume 4B – Combinatorial Algorithms, Part 2
1246:Volume 4A – Combinatorial Algorithms, Part 1
1167:5.4.1. Multiway Merging and Replacement Selection
514:Chapter 7 – Combinatorial searching (part 2)
502:Chapter 7 – Combinatorial searching (part 1)
366:All examples in the books use a language called "
3154:
2559:
1182:5.4.6. Practical Considerations for Tape Merging
710:in the hardback copy but updated by fascicle 1)
361:
344:This series of books is affectionately dedicated
1288:7.2.1. Generating Basic Combinatorial Patterns
2943:Things a Computer Scientist Rarely Talks About
2707:
2705:
2646:
2285:Volume 4, Pre-fascicle 14A: Bipartite Matching
1408:7.2. Generating all possibilities (continued)
1350:7.2. Generating all possibilities (continued)
835:2.3.4. Basic Mathematical Properties of Trees
357:with whom I have spent many pleasant evenings.
2877:
2729:Bulletin of the American Mathematical Society
2563:; Morrison, Phylis (November–December 1999).
2537:"Donald E. Knuth – A. M. Turing Award Winner"
1002:4.2.4. Distribution of Floating Point Numbers
727:1.4. Some Fundamental Programming Techniques
2836:. The oral history discusses the writing of
2781:
2485:Mathematical People: Profiles and Interviews
996:4.2.2. Accuracy of Floating Point Arithmetic
2822:Oral history interview with Donald E. Knuth
2702:
2687:
2685:
2396:. Addison-Wesley Professional. 2022-09-28.
2370:. Addison-Wesley Professional. 2022-09-28.
2114:. (Addison-Wesley, 2015-12-08) xiii+310pp,
2097:. (Addison-Wesley, 2019-11-22) xiii+382pp,
1823:Volume 4B: Combinatorial Algorithms, Part 2
1799:Volume 4A: Combinatorial Algorithms, Part 1
317:, which is currently used for all volumes.
2884:
2870:
1668:Chapter 11 – Mathematical Linguistics
1459:7.2.2.8. A potpourri of puzzles (includes
829:2.3.2. Binary Tree Representation of Trees
573:Chapter 11 – Mathematical Linguistics
34:
2740:
2367:Pearson InformIT webpage book Content tab
2075:. (Addison-Wesley, 2006-02-06) vi+120pp,
2058:. (Addison-Wesley, 2005-07-26) vi+150pp,
1908:. First edition, 1973, xi+723pp+foldout,
1251:Chapter 7 – Combinatorial Searching
454:Volume 2 – Seminumerical Algorithms
3142:Potrzebie system of weights and measures
2682:
2041:. (Addison-Wesley, 2005-02-14) v+127pp,
888:Volume 2 – Seminumerical Algorithms
766:Chapter 2 – Information Structures
634:1.2.4. Integer Functions and Elementary
207:
3075:Robinson–Schensted–Knuth correspondence
2832:, collaboration and his development of
1848:. (Addison-Wesley, 2005-02-14), 144pp.
1331:7.2.1.7. History and further references
1196:5.5. Summary, History, and Bibliography
440:Volume 1 – Fundamental Algorithms
3155:
2760:
2596:
2478:
695:1.2.11.3. Some asymptotic calculations
602:Volume 1 – Fundamental Algorithms
16:Books about algorithms by Donald Knuth
2865:
2711:
2453:
2430:
1942:. Second edition, 1981, xiii+ 688pp,
1532:7.5.1. Bipartite matching (including
1507:7.4.1.3. Vertex and edge connectivity
1090:Volume 3 – Sorting and Searching
832:2.3.3. Other Representations of Trees
540:Volume 5 – Syntactic Algorithms
2621:
2615:
2112:Volume 4, Fascicle 6: Satisfiability
1863:
1627:Volume 5 – Syntactic Algorithms
999:4.2.3. Double-Precision Calculations
993:4.2.1. Single-Precision Calculations
402:"for his major contributions to the
393:
95:1968– (the book is still incomplete)
2433:"An Interview with Donald E. Knuth"
1925:. Second edition, 1973, xxi+634pp,
1868:
1687:
1682:
1673:Volume 7 – Compiler Techniques
1153:5.3.3. Minimum-Comparison Selection
1065:4.6.2. Factorization of Polynomials
591:
324:worth "one hexadecimal dollar" (100
13:
2720:Volume 2. Seminumerical Algorithms
2254:Volume 4, Pre-fascicle 8B: Cliques
1940:Volume 2: Seminumerical Algorithms
1892:Volume 2: Seminumerical Algorithms
1880:. First edition, 1968, xxi+634pp,
1745:Volume 2: Seminumerical Algorithms
1285:7.2. Generating All Possibilities
1041:4.5.2. The Greatest Common Divisor
172:written by the computer scientist
14:
3239:
3060:Knuth–Bendix completion algorithm
2809:
1894:. First edition, 1969, xi+624pp,
1216:6.2.1. Searching an Ordered Table
1150:5.3.2. Minimum-Comparison Merging
1147:5.3.1. Minimum-Comparison Sorting
1110:5.1.2. Permutations of a Multiset
1101:5.1. Combinatorial Properties of
904:Generating Uniform Random Numbers
859:2.3.4.6. History and bibliography
716:1.3.2. The MMIX Assembly Language
2891:
2647:D'Agostino, Susan (2020-04-16).
2129:
1923:Volume 1: Fundamental Algorithms
1878:Volume 1: Fundamental Algorithms
1792:(2022, 45th printing). Addenda:
1765:(2022, 45th printing). Addenda:
1714:Volume 1: Fundamental Algorithms
1512:7.4.2. Special classes of graphs
1492:7.4.1. Components and traversal
1239:6.5. Retrieval on Secondary Keys
1210:6.2. Searching by Comparison of
1075:4.6.4. Evaluation of Polynomials
1019:4.3.3. How Fast Can We Multiply?
950:Other Types of Random Quantities
674:1.2.10. Analysis of an Algorithm
616:1.2. Mathematical Preliminaries
607:Chapter 1 – Basic concepts
29:The Art of Computer Programming
2908:The Art of Computer Programming
2838:The Art of Computer Programming
2742:10.1090/s0002-9904-1973-13173-8
2668:
2640:
2590:
2553:
2529:
2431:Frana, Philip L. (2001-11-08).
1906:Volume 3: Sorting and Searching
1772:Volume 3: Sorting and Searching
1116:5.1.4. Tableaux and Involutions
1013:4.3.1. The Classical Algorithms
759:1.4.5. History and Bibliography
443:Chapter 1 – Basic concepts
222:Case Western Reserve University
159:The Art of Computer Programming
3208:Computer arithmetic algorithms
2846:, 2003 - (on the influence of
2505:
2472:
2459:"This Week's Citation Classic"
2447:
2424:
2410:
2384:
2358:
2344:
2324:
1573:7.6.1. Independence structures
1139:5.2.5. Sorting by Distribution
1062:4.6.1. Division of Polynomials
954:3.4.1. Numerical Distributions
596:
567:Volume 6 – The Theory of
1:
2312:
1529:7.5. Graphs and optimization
1185:5.4.7. External Radix Sorting
1176:5.4.4. Reading Tape Backwards
1070:addition-chain exponentiation
1068:4.6.3. Evaluation of Powers (
1009:Multiple Precision Arithmetic
918:3.2.1.2. Choice of multiplier
881:2.6. History and Bibliography
853:2.3.4.4. Enumeration of trees
742:1.4.3. Interpretive Routines
446:Chapter 2 – Information
362:Assembly language in the book
3065:Knuth–Morris–Pratt algorithm
1991:
1534:maximum-cardinality matching
1383:
1219:6.2.2. Binary Tree Searching
1130:5.2.2. Sorting by Exchanging
1050:4.5.4. Factoring into Primes
977:Chapter 4 – Arithmetic
792:2.2.2. Sequential Allocation
625:1.2.2. Numbers, Powers, and
434:
353:Case Institute of Technology
7:
3080:Trabb Pardo–Knuth algorithm
2818:(Knuth's personal homepage)
2298:
1179:5.4.5. The Oscillating Sort
1156:5.3.4. Networks for Sorting
1133:5.2.3. Sorting by Selection
1127:5.2.1. Sorting by Insertion
957:3.4.2. Random Sampling and
872:2.4. Multilinked Structures
418:Art of Computer Programming
398:Knuth was awarded the 1974
228:upon his completion of the
21:The Art of Unix Programming
10:
3246:
3213:Computer programming books
3193:American non-fiction books
2622:Lohr, Steve (2001-12-17).
2352:"note for box 3, folder 1"
2306:Introduction to Algorithms
1603:7.9. Herculean tasks (aka
1170:5.4.2. The Polyphase Merge
915:3.2.1.1. Choice of modulus
877:Dynamic Storage Allocation
805:2.2.5. Doubly Linked Lists
795:2.2.3. Linked Allocation (
713:1.3.1. Description of MMIX
679:Asymptotic Representations
520:
429:
378:version. Software such as
340:Knuth's dedication reads:
218:Westinghouse Talent Search
203:
18:
3122:Knuth's up-arrow notation
3099:
3091:Knuth's Simpath algorithm
3045:
3022:
2994:
2959:
2922:Computers and Typesetting
2899:
2826:Charles Babbage Institute
1570:7.6. Independence theory
1473:Pólya enumeration theorem
1461:Perfect digital invariant
1267:7.1.2. Boolean Evaluation
1207:6.1. Sequential Searching
1136:5.2.4. Sorting by Merging
1016:4.3.2. Modular Arithmetic
982:Positional Number Systems
691:Euler's summation formula
320:The offer of a so-called
143:
131:
119:
107:
99:
89:
79:
65:
57:
47:
33:
2785:; Lazere, Cathy (1995).
2393:Pearson InformIT webpage
1565:7.5.6. Optimum orderings
1363:(includes discussion of
1325:7.2.1.6. Generating all
1319:7.2.1.5. Generating all
1313:7.2.1.4. Generating all
1307:7.2.1.3. Generating all
1301:7.2.1.2. Generating all
1291:7.2.1.1. Generating all
1279:Binary Decision Diagrams
1173:5.4.3. The Cascade Merge
943:3.3.4. The Spectral Test
940:3.3.3. Theoretical Tests
745:1.4.3.1. A MIX simulator
631:1.2.3. Sums and Products
19:Not to be confused with
2915:The Complexity of Songs
2761:Slater, Robert (1987).
2712:Wells, Mark B. (1973).
2481:Alexanderson, Gerald L.
1562:7.5.5. Optimum matching
1559:7.5.4. Optimum subtrees
1538:Stable marriage problem
1420:Constraint satisfaction
1188:5.4.8. Two-Tape Sorting
931:3.3. Statistical Tests
748:1.4.3.2. Trace routines
719:1.3.3. Applications to
3223:English-language books
3218:Computer science books
3198:Analysis of algorithms
3183:2011 non-fiction books
3178:1981 non-fiction books
3173:1973 non-fiction books
3168:1969 non-fiction books
3163:1968 non-fiction books
2950:Selected papers series
2830:structured programming
2676:"TAOCP – Future plans"
1819:(2022, 22nd printing).
1591:Transfer-matrix method
1549:The assignment problem
1230:6.3. Digital Searching
1191:5.4.9. Disks and Drums
937:3.3.2. Empirical Tests
621:Mathematical Induction
569:Context-Free Languages
404:analysis of algorithms
359:
213:
3203:Books by Donald Knuth
3132:Quater-imaginary base
1840:(2023, 1st printing).
1640:and data compression)
1497:Union-find algorithms
1413:Backtrack programming
1355:Backtrack programming
1274:Tricks and Techniques
1225:6.2.4. Multiway Trees
1222:6.2.3. Balanced Trees
1144:5.3. Optimum Sorting
1080:4.7. Manipulation of
802:2.2.4. Circular Lists
652:Binomial Coefficients
374:computer, which is a
342:
234:Burroughs Corporation
211:
168:) is a comprehensive
3188:Addison-Wesley books
3086:Dijkstra's algorithm
3024:Literate programming
2929:Concrete Mathematics
2764:Portraits in Silicon
926:3.2.2. Other Methods
856:2.3.4.5. Path length
849:The "infinity lemma"
812:and Orthogonal Lists
670:Generating Functions
212:Donald Knuth in 2005
3055:Knuth's Algorithm X
2722:by Donald E. Knuth"
1587:dynamic programming
1044:4.5.3. Analysis of
910:Linear Congruential
838:2.3.4.1. Free trees
797:topological sorting
30:
3112:Knuth reward check
3084:Generalization of
2816:Overview of topics
2693:"TAOCP – Brochure"
2628:The New York Times
2597:Weinberger, Matt.
2569:American Scientist
1643:Chapter 10 –
1503:Depth-first search
1315:integer partitions
1046:Euclid's Algorithm
866:Garbage Collection
823:2.3.1. Traversing
558:Chapter 10 –
423:The New York Times
409:American Scientist
382:exists to provide
322:Knuth reward check
214:
28:
3150:
3149:
2498:978-1-56881-340-0
2120:978-0-13-439760-3
2103:978-0-13-467179-6
1982:978-0-321-75104-1
1965:978-0-201-48541-7
1864:Previous editions
1831:978-0-201-03806-4
1807:978-0-201-03804-0
1780:978-0-201-89685-5
1753:978-0-201-89684-8
1722:978-0-201-89683-1
1705:978-0-13-793510-9
1632:Chapter 9 –
1618:Chapter 8 –
1612:Near-optimization
1576:7.6.2. Efficient
1443:Set cover problem
1437:7.2.2.6. Covers (
1426:Hamiltonian paths
1201:Chapter 6 –
1107:5.1.1. Inversions
1095:Chapter 5 –
899:3.1. Introduction
893:Chapter 3 –
864:2.3.5. Lists and
769:2.1. Introduction
664:Fibonacci Numbers
543:Chapter 9 –
532:Chapter 8 –
507:Volume 4B –
495:Volume 4A –
487:Chapter 6 –
481:Chapter 5 –
463:Chapter 4 –
457:Chapter 3 –
394:Critical response
388:assembly language
350:once installed at
348:Type 650 computer
288:Olga Taussky-Todd
230:bachelor's degree
226:master of science
155:
154:
100:Publication place
3235:
2886:
2879:
2872:
2863:
2862:
2804:
2792:
2778:
2747:
2746:
2744:
2726:
2709:
2700:
2699:
2697:
2689:
2680:
2679:
2672:
2666:
2665:
2660:
2659:
2644:
2638:
2637:
2635:
2634:
2619:
2613:
2612:
2610:
2609:
2603:Business Insider
2594:
2588:
2587:
2585:
2584:
2561:Morrison, Philip
2557:
2551:
2550:
2548:
2547:
2533:
2527:
2526:
2524:
2523:
2509:
2503:
2502:
2476:
2470:
2469:
2466:Current Contents
2463:
2455:Knuth, Donald E.
2451:
2445:
2444:
2428:
2422:
2421:
2414:
2408:
2407:
2388:
2382:
2381:
2362:
2356:
2355:
2348:
2331:
2328:
1869:Complete volumes
1688:Current editions
1683:English editions
1664:
1663:
1659:
1634:Lexical scanning
1598:Branch-and-bound
1542:Mariages Stables
1488:Graph algorithms
1456:7.2.2.7. Squares
1401:
1400:
1396:
1163:External Sorting
1123:Internal sorting
1038:4.5.1. Fractions
921:3.2.1.3. Potency
755:Input and Output
658:Harmonic Numbers
592:Chapter outlines
578:Volume 7 –
553:data compression
545:Lexical scanning
471:Volume 3 –
284:
280:
279:
275:
272:
266:
242:Richard S. Varga
216:After winning a
147:
91:Publication date
38:
31:
27:
3245:
3244:
3238:
3237:
3236:
3234:
3233:
3232:
3153:
3152:
3151:
3146:
3127:Man or boy test
3095:
3041:
3018:
3009:Computer Modern
2990:
2955:
2936:Surreal Numbers
2895:
2890:
2812:
2807:
2801:
2775:
2751:
2750:
2724:
2710:
2703:
2695:
2691:
2690:
2683:
2674:
2673:
2669:
2657:
2655:
2653:Quanta Magazine
2645:
2641:
2632:
2630:
2620:
2616:
2607:
2605:
2595:
2591:
2582:
2580:
2558:
2554:
2545:
2543:
2535:
2534:
2530:
2521:
2519:
2511:
2510:
2506:
2499:
2477:
2473:
2461:
2452:
2448:
2429:
2425:
2416:
2415:
2411:
2404:
2390:
2389:
2385:
2378:
2364:
2363:
2359:
2350:
2349:
2345:
2335:
2334:
2329:
2325:
2315:
2301:
2132:
1994:
1871:
1866:
1690:
1685:
1675:
1665:
1661:
1657:
1655:
1654:
1636:(includes also
1629:
1517:Expander graphs
1402:
1398:
1394:
1392:
1391:
1386:
1344:
1248:
1092:
967:Random Sequence
965:3.5. What Is a
890:
604:
599:
594:
547:(also includes
523:
437:
432:
396:
364:
356:
351:
345:
329:
314:
282:
277:
273:
270:
268:
264:
206:
136:
108:Media type
92:
72:
43:
24:
17:
12:
11:
5:
3243:
3242:
3231:
3230:
3225:
3220:
3215:
3210:
3205:
3200:
3195:
3190:
3185:
3180:
3175:
3170:
3165:
3148:
3147:
3145:
3144:
3139:
3134:
3129:
3124:
3119:
3114:
3109:
3103:
3101:
3097:
3096:
3094:
3093:
3088:
3082:
3077:
3072:
3067:
3062:
3057:
3051:
3049:
3043:
3042:
3040:
3039:
3034:
3028:
3026:
3020:
3019:
3017:
3016:
3014:Concrete Roman
3011:
3006:
3000:
2998:
2992:
2991:
2989:
2988:
2982:
2976:
2971:
2965:
2963:
2957:
2956:
2954:
2953:
2946:
2939:
2932:
2925:
2918:
2911:
2903:
2901:
2897:
2896:
2889:
2888:
2881:
2874:
2866:
2860:
2859:
2851:
2841:
2819:
2811:
2810:External links
2808:
2806:
2805:
2799:
2793:. Copernicus.
2783:Shasha, Dennis
2779:
2773:
2757:
2749:
2748:
2735:(3): 501–509.
2701:
2681:
2667:
2639:
2614:
2589:
2552:
2528:
2504:
2497:
2487:(2 ed.).
2471:
2457:(1993-08-23).
2446:
2423:
2409:
2402:
2383:
2376:
2357:
2342:
2341:
2333:
2332:
2322:
2321:
2314:
2311:
2310:
2309:
2300:
2297:
2296:
2295:
2288:
2281:
2278:(PDF Version)
2271:
2264:
2257:
2250:
2243:
2232:
2231:
2224:
2211:Pre-fascicles
2209:
2200:Pre-fascicles
2198:
2189:Pre-fascicles
2187:
2178:Pre-fascicles
2176:
2167:Pre-fascicles
2165:
2144:
2143:
2131:
2128:
2127:
2126:
2109:
2088:
2087:
2070:
2053:
2036:
2019:
1993:
1990:
1989:
1988:
1971:
1954:
1937:
1920:
1903:
1889:
1870:
1867:
1865:
1862:
1861:
1860:
1843:
1842:
1841:
1820:
1796:
1789:(2011-01-08),
1769:
1762:(2011-01-08),
1742:
1731:(2011-01-08),
1689:
1686:
1684:
1681:
1680:
1679:
1674:
1671:
1670:
1669:
1653:
1650:
1649:
1648:
1641:
1628:
1625:
1624:
1623:
1616:
1615:
1614:
1608:
1601:
1594:
1585:7.7. Discrete
1583:
1582:
1581:
1574:
1568:
1567:
1566:
1563:
1560:
1557:
1551:
1545:
1527:
1526:
1525:
1519:
1513:
1510:
1509:
1508:
1505:
1499:
1484:
1482:Shortest paths
1478:
1477:
1476:
1469:
1468:
1467:
1464:
1457:
1454:
1435:
1429:
1422:
1390:
1387:
1385:
1382:
1381:
1380:
1379:
1378:
1377:
1376:
1375:
1374:
1372:Satisfiability
1368:
1343:
1340:
1339:
1338:
1337:
1336:
1335:
1334:
1333:
1332:
1329:
1323:
1321:set partitions
1317:
1311:
1305:
1299:
1283:
1282:
1281:
1275:
1268:
1265:
1256:Zeros and Ones
1247:
1244:
1243:
1242:
1241:
1240:
1237:
1231:
1228:
1227:
1226:
1223:
1220:
1217:
1208:
1199:
1198:
1197:
1194:
1193:
1192:
1189:
1186:
1183:
1180:
1177:
1174:
1171:
1168:
1159:
1158:
1157:
1154:
1151:
1148:
1142:
1141:
1140:
1137:
1134:
1131:
1128:
1119:
1118:
1117:
1114:
1111:
1108:
1091:
1088:
1087:
1086:
1085:
1084:
1078:
1077:
1076:
1073:
1066:
1063:
1053:
1052:
1051:
1048:
1042:
1039:
1029:
1022:
1021:
1020:
1017:
1014:
1005:
1004:
1003:
1000:
997:
994:
988:Floating Point
984:
975:
974:
973:
970:
963:
962:
961:
955:
946:
945:
944:
941:
938:
935:
929:
928:
927:
924:
923:
922:
919:
916:
900:
895:Random Numbers
889:
886:
885:
884:
883:
882:
879:
873:
870:
869:
868:
862:
861:
860:
857:
854:
851:
845:
843:Oriented trees
839:
833:
830:
827:
815:
814:
813:
806:
803:
800:
793:
790:
770:
764:
763:
762:
761:
760:
757:
751:
750:
749:
746:
740:
734:
725:
724:
723:
717:
714:
700:
699:
698:
697:
696:
693:
687:
683:1.2.11.1. The
675:
672:
666:
660:
654:
648:
638:
632:
629:
623:
614:
603:
600:
598:
595:
593:
590:
589:
588:
587:
586:
576:
575:
574:
565:
564:
563:
556:
538:
537:
536:
530:
522:
519:
518:
517:
516:
515:
505:
504:
503:
493:
492:
491:
485:
469:
468:
467:
461:
459:Random numbers
452:
451:
450:
444:
436:
433:
431:
428:
395:
392:
363:
360:
325:
312:
261:linear probing
249:Addison-Wesley
205:
202:
185:their analysis
153:
152:
149:
141:
140:
137:
132:
129:
128:
123:
117:
116:
109:
105:
104:
101:
97:
96:
93:
90:
87:
86:
84:Addison-Wesley
81:
77:
76:
67:
63:
62:
59:
55:
54:
49:
45:
44:
39:
15:
9:
6:
4:
3:
2:
3241:
3240:
3229:
3226:
3224:
3221:
3219:
3216:
3214:
3211:
3209:
3206:
3204:
3201:
3199:
3196:
3194:
3191:
3189:
3186:
3184:
3181:
3179:
3176:
3174:
3171:
3169:
3166:
3164:
3161:
3160:
3158:
3143:
3140:
3138:
3135:
3133:
3130:
3128:
3125:
3123:
3120:
3118:
3115:
3113:
3110:
3108:
3107:Dancing Links
3105:
3104:
3102:
3098:
3092:
3089:
3087:
3083:
3081:
3078:
3076:
3073:
3071:
3070:Knuth shuffle
3068:
3066:
3063:
3061:
3058:
3056:
3053:
3052:
3050:
3048:
3044:
3038:
3035:
3033:
3030:
3029:
3027:
3025:
3021:
3015:
3012:
3010:
3007:
3005:
3002:
3001:
2999:
2997:
2993:
2986:
2983:
2981:
2977:
2975:
2972:
2970:
2967:
2966:
2964:
2962:
2958:
2952:
2951:
2947:
2945:
2944:
2940:
2938:
2937:
2933:
2931:
2930:
2926:
2924:
2923:
2919:
2916:
2912:
2910:
2909:
2905:
2904:
2902:
2898:
2894:
2887:
2882:
2880:
2875:
2873:
2868:
2867:
2864:
2858:
2856:
2852:
2849:
2845:
2842:
2839:
2835:
2831:
2827:
2823:
2820:
2817:
2814:
2813:
2802:
2800:0-387-97992-1
2796:
2791:
2790:
2784:
2780:
2776:
2774:0-262-19262-4
2770:
2767:. MIT Press.
2766:
2765:
2759:
2758:
2756:
2755:
2743:
2738:
2734:
2730:
2723:
2721:
2717:
2708:
2706:
2694:
2688:
2686:
2677:
2671:
2664:
2654:
2650:
2643:
2629:
2625:
2618:
2604:
2600:
2593:
2579:on 2008-08-20
2578:
2574:
2570:
2566:
2562:
2556:
2542:
2538:
2532:
2518:
2514:
2508:
2500:
2494:
2490:
2486:
2482:
2475:
2467:
2460:
2456:
2450:
2442:
2438:
2434:
2427:
2419:
2413:
2405:
2403:9780201038064
2399:
2395:
2394:
2387:
2379:
2377:9780201038064
2373:
2369:
2368:
2361:
2353:
2347:
2343:
2340:
2339:
2327:
2323:
2320:
2319:
2308:
2307:
2303:
2302:
2294:
2293:
2289:
2287:
2286:
2282:
2280:
2279:
2276:
2272:
2270:
2269:
2265:
2263:
2262:
2258:
2256:
2255:
2251:
2249:
2248:
2244:
2242:
2241:
2237:
2236:
2235:
2229:
2226:Pre-fascicle
2225:
2222:
2218:
2214:
2210:
2207:
2203:
2199:
2196:
2192:
2188:
2185:
2181:
2177:
2174:
2170:
2166:
2163:
2159:
2155:
2152:
2151:Pre-fascicles
2149:
2148:
2147:
2141:
2138:Pre-fascicle
2137:
2136:
2135:
2130:Pre-fascicles
2124:
2121:
2117:
2113:
2110:
2107:
2104:
2100:
2096:
2093:
2092:
2091:
2086:(2011-01-01).
2085:
2082:
2081:0-321-33570-8
2078:
2074:
2071:
2069:(2011-01-01).
2068:
2065:
2064:0-201-85394-9
2061:
2057:
2054:
2052:(2011-01-01).
2051:
2048:
2047:0-201-85393-0
2044:
2040:
2037:
2035:(2011-01-01).
2034:
2031:
2030:0-321-58050-8
2027:
2023:
2020:
2018:(2011-01-01).
2017:
2014:
2013:0-321-53496-4
2010:
2006:
2003:
2002:
2001:
1999:
1987:
1986:0-321-75104-3
1983:
1979:
1975:
1972:
1970:
1969:0-201-48541-9
1966:
1962:
1958:
1955:
1952:
1949:
1948:0-201-03822-6
1945:
1941:
1938:
1935:
1932:
1931:0-201-03809-9
1928:
1924:
1921:
1918:
1915:
1914:0-201-03803-X
1911:
1907:
1904:
1901:
1900:0-201-03802-1
1897:
1893:
1890:
1887:
1886:0-201-03801-3
1883:
1879:
1876:
1875:
1874:
1858:
1855:
1854:0-201-85392-2
1851:
1847:
1844:
1839:
1836:
1835:0-201-03806-4
1832:
1828:
1824:
1821:
1818:
1815:
1812:
1811:0-201-03804-8
1808:
1804:
1800:
1797:
1794:
1791:
1788:
1785:
1784:0-201-89685-0
1781:
1777:
1773:
1770:
1767:
1764:
1761:
1758:
1757:0-201-89684-2
1754:
1750:
1746:
1743:
1740:
1737:
1733:
1730:
1727:
1726:0-201-89683-4
1723:
1719:
1715:
1712:
1711:
1710:
1709:0-13-793510-2
1706:
1702:
1698:
1695:
1694:
1693:
1677:
1676:
1667:
1666:
1660:
1646:
1642:
1639:
1638:string search
1635:
1631:
1630:
1621:
1617:
1613:
1609:
1606:
1602:
1599:
1595:
1592:
1588:
1584:
1579:
1575:
1572:
1571:
1569:
1564:
1561:
1558:
1556:
1555:Network flows
1552:
1550:
1546:
1543:
1539:
1535:
1531:
1530:
1528:
1524:
1523:Random graphs
1520:
1518:
1514:
1511:
1506:
1504:
1500:
1498:
1494:
1493:
1491:
1490:
1489:
1485:
1483:
1479:
1474:
1470:
1465:
1462:
1458:
1455:
1452:
1448:
1444:
1440:
1436:
1434:
1430:
1427:
1423:
1421:
1417:
1416:
1414:
1410:
1409:
1407:
1406:
1404:
1403:
1397:
1373:
1369:
1366:
1362:
1361:Dancing links
1358:
1357:
1356:
1352:
1351:
1349:
1348:
1346:
1345:
1330:
1328:
1324:
1322:
1318:
1316:
1312:
1310:
1306:
1304:
1300:
1298:
1294:
1290:
1289:
1287:
1286:
1284:
1280:
1276:
1273:
1269:
1266:
1263:
1259:
1258:
1257:
1253:
1252:
1250:
1249:
1238:
1236:
1232:
1229:
1224:
1221:
1218:
1215:
1214:
1213:
1209:
1206:
1205:
1204:
1200:
1195:
1190:
1187:
1184:
1181:
1178:
1175:
1172:
1169:
1166:
1165:
1164:
1160:
1155:
1152:
1149:
1146:
1145:
1143:
1138:
1135:
1132:
1129:
1126:
1125:
1124:
1120:
1115:
1112:
1109:
1106:
1105:
1104:
1100:
1099:
1098:
1094:
1093:
1083:
1079:
1074:
1071:
1067:
1064:
1061:
1060:
1058:
1054:
1049:
1047:
1043:
1040:
1037:
1036:
1034:
1030:
1027:
1023:
1018:
1015:
1012:
1011:
1010:
1006:
1001:
998:
995:
992:
991:
989:
985:
983:
979:
978:
976:
971:
968:
964:
960:
956:
953:
952:
951:
947:
942:
939:
936:
933:
932:
930:
925:
920:
917:
914:
913:
911:
907:
906:
905:
901:
898:
897:
896:
892:
891:
880:
878:
874:
871:
867:
863:
858:
855:
852:
850:
846:
844:
840:
837:
836:
834:
831:
828:
826:
822:
821:
820:
816:
811:
807:
804:
801:
798:
794:
791:
789:
785:
781:
777:
776:
775:
771:
768:
767:
765:
758:
756:
752:
747:
744:
743:
741:
739:
735:
733:
729:
728:
726:
722:
718:
715:
712:
711:
709:
705:
701:
694:
692:
688:
686:
682:
681:
680:
676:
673:
671:
667:
665:
661:
659:
655:
653:
649:
647:
643:
639:
637:
636:Number Theory
633:
630:
628:
624:
622:
618:
617:
615:
613:
609:
608:
606:
605:
584:
583:
581:
577:
572:
571:
570:
566:
561:
557:
554:
550:
549:string search
546:
542:
541:
539:
535:
531:
528:
527:
525:
524:
513:
512:
510:
509:Combinatorial
506:
501:
500:
498:
497:Combinatorial
494:
490:
486:
484:
480:
479:
478:
474:
470:
466:
462:
460:
456:
455:
453:
449:
445:
442:
441:
439:
438:
427:
425:
424:
419:
415:
411:
410:
405:
401:
391:
389:
385:
381:
377:
373:
369:
358:
354:
349:
341:
338:
336:
332:
328:
323:
318:
316:
308:
304:
299:
297:
293:
289:
262:
258:
255:compiler for
254:
250:
245:
243:
239:
235:
231:
227:
223:
219:
210:
201:
197:
194:
188:
186:
182:
179:
175:
171:
167:
166:
161:
160:
150:
148:
146:LC Class
142:
138:
135:
134:Dewey Decimal
130:
127:
126:0-201-03801-3
124:
122:
118:
114:
110:
106:
103:United States
102:
98:
94:
88:
85:
82:
78:
75:
71:
68:
64:
60:
56:
53:
50:
46:
42:
37:
32:
26:
22:
2948:
2941:
2934:
2927:
2920:
2907:
2906:
2900:Publications
2893:Donald Knuth
2854:
2837:
2788:
2763:
2753:
2752:
2732:
2728:
2719:
2715:
2670:
2662:
2656:. Retrieved
2652:
2642:
2631:. Retrieved
2627:
2617:
2606:. Retrieved
2602:
2592:
2581:. Retrieved
2577:the original
2572:
2568:
2555:
2544:. Retrieved
2540:
2531:
2520:. Retrieved
2516:
2507:
2489:A. K. Peters
2484:
2474:
2468:. p. 8.
2465:
2449:
2441:11299/107413
2426:
2412:
2392:
2386:
2366:
2360:
2346:
2337:
2336:
2326:
2317:
2316:
2304:
2290:
2283:
2273:
2266:
2259:
2252:
2245:
2238:
2233:
2145:
2133:
2125:(2020-03-26)
2111:
2108:(2020-03-27)
2094:
2089:
2072:
2055:
2038:
2021:
2004:
1995:
1973:
1956:
1939:
1922:
1905:
1891:
1877:
1872:
1845:
1822:
1798:
1771:
1744:
1738:). Addenda:
1734:(2022, 49th
1713:
1696:
1691:
1451:Clique cover
1439:Vertex cover
1415:(continued)
1309:combinations
1303:permutations
1292:
1103:Permutations
1082:Power Series
972:3.6. Summary
825:Binary Trees
774:Linear Lists
721:Permutations
642:Permutations
421:
417:
407:
400:Turing Award
397:
365:
343:
339:
319:
300:
246:
215:
198:
189:
174:Donald Knuth
164:
163:
158:
157:
156:
52:Donald Knuth
40:
25:
3117:Knuth Prize
2517:www.gnu.org
1447:Exact cover
1365:Exact cover
1113:5.1.3. Runs
1059:Arithmetic
1035:Arithmetic
990:Arithmetic
908:3.2.1. The
732:Subroutines
582:Techniques
511:Algorithms
499:Algorithms
178:programming
176:presenting
70:Non-fiction
3228:Monographs
3157:Categories
3047:Algorithms
2658:2023-06-26
2633:2010-05-17
2608:2016-06-13
2583:2008-01-11
2546:2017-01-25
2522:2022-10-23
2313:References
2122:. Errata:
2105:. Errata:
2083:. Errata:
2066:. Errata:
2049:. Errata:
2032:. Errata:
2015:. Errata:
1996:Volume 4,
1950:. Errata:
1933:. Errata:
1916:. Errata:
1856:. Errata:
1837:. Errata:
1813:. Errata:
1786:. Errata:
1759:. Errata:
1728:. Errata:
1647:techniques
1600:techniques
1589:(see also
1580:algorithms
1428:and cycles
1057:Polynomial
1028:Conversion
738:Coroutines
689:1.2.11.2.
685:O-notation
646:Factorials
627:Logarithms
612:Algorithms
562:techniques
465:Arithmetic
448:structures
414:Bill Gates
333:cents, in
181:algorithms
3004:AMS Euler
2848:Bob Floyd
2714:"Review:
2541:AM Turing
2338:Citations
2146:Volume 4
2134:Volume 1
1998:Fascicles
1992:Fascicles
1620:Recursion
1607:problems)
1501:7.4.1.2.
1495:7.4.1.1.
1431:7.2.2.5.
1424:7.2.2.4.
1418:7.2.2.3.
1370:7.2.2.2.
1359:7.2.2.1.
1203:Searching
959:Shuffling
847:2.3.4.3.
841:2.3.4.2.
597:Completed
534:Recursion
489:Searching
477:Searching
435:Completed
384:emulation
292:John Todd
238:compilers
236:to write
170:monograph
113:Hardcover
80:Publisher
74:Monograph
2974:Metafont
2961:Software
2483:(eds.).
2299:See also
1816:(2011),
1736:printing
1033:Rational
677:1.2.11.
580:Compiler
307:hot type
193:Fascicle
58:Language
3137:-yllion
2978:MIXAL (
2754:Sources
1795:(2011).
1768:(2011).
1741:(2011).
1645:Parsing
1605:NP-hard
1578:matroid
1553:7.5.3.
1547:7.5.2.
1521:7.4.4.
1515:7.4.3.
1433:Cliques
1411:7.2.2.
1384:Planned
1353:7.2.2.
1277:7.1.4.
1272:Bitwise
1270:7.1.3.
1262:Boolean
1260:7.1.1.
1235:Hashing
1097:Sorting
912:Method
808:2.2.6.
778:2.2.1.
753:1.4.4.
736:1.4.2.
730:1.4.1.
668:1.2.9.
662:1.2.8.
656:1.2.7.
650:1.2.6.
640:1.2.5.
619:1.2.1.
560:Parsing
521:Planned
483:Sorting
473:Sorting
430:Volumes
380:GNU MDK
346:to the
335:decimal
331:base 16
303:typeset
296:Caltech
276:⁄
253:FORTRAN
204:History
151:QA76.75
111:Print (
61:English
2797:
2771:
2495:
2400:
2374:
2219:, and
2160:, and
2118:
2101:
2079:
2062:
2045:
2028:
2011:
1980:
1963:
1946:
1929:
1912:
1898:
1884:
1852:
1829:
1805:
1778:
1751:
1720:
1703:
1656:": -->
1610:7.10.
1393:": -->
1297:tuples
1264:Basics
810:Arrays
788:Deques
786:, and
784:Queues
780:Stacks
257:UNIVAC
48:Author
3100:Other
2996:Fonts
2855:TAoCP
2725:(PDF)
2696:(PDF)
2462:(PDF)
2318:Notes
1596:7.8.
1486:7.4.
1480:7.3.
1327:trees
1254:7.1.
1233:6.4.
1161:5.4.
1121:5.2.
1055:4.6.
1031:4.5.
1026:Radix
1024:4.4.
1007:4.3.
986:4.2.
980:4.1.
948:3.4.
902:3.2.
875:2.5.
819:Trees
817:2.3.
772:2.2.
610:1.1.
165:TAOCP
66:Genre
3037:CWEB
2985:MMIX
2795:ISBN
2769:ISBN
2718:and
2493:ISBN
2398:ISBN
2372:ISBN
2204:and
2193:and
2182:and
2171:and
2116:ISBN
2099:ISBN
2077:ISBN
2060:ISBN
2043:ISBN
2026:ISBN
2009:ISBN
1978:ISBN
1961:ISBN
1944:ISBN
1927:ISBN
1910:ISBN
1896:ISBN
1882:ISBN
1850:ISBN
1827:ISBN
1803:ISBN
1776:ISBN
1749:ISBN
1718:ISBN
1701:ISBN
1658:edit
1395:edit
1212:Keys
704:MMIX
702:1.3
644:and
551:and
475:and
376:RISC
372:MMIX
290:and
283:2000
265:3000
183:and
121:ISBN
3032:WEB
2980:MIX
2969:TeX
2834:TeX
2824:at
2737:doi
2437:hdl
708:MIX
368:MIX
327:HEX
294:at
139:519
3159::
2733:79
2731:.
2727:.
2704:^
2684:^
2661:.
2651:.
2626:.
2601:.
2573:87
2571:.
2567:.
2539:.
2515:.
2491:.
2464:.
2435:.
2228:6A
2221:5C
2217:5B
2215:,
2213:5A
2206:4B
2202:4A
2195:3B
2191:3A
2184:2B
2180:2A
2173:1B
2169:1A
2162:0C
2158:0B
2156:,
2154:0A
1984:,
1967:,
1833:,
1809:,
1782:,
1755:,
1724:,
1707:,
1540:,
1536:,
1449:,
1445:,
1441:,
782:,
244:.
2987:)
2917:"
2913:"
2885:e
2878:t
2871:v
2850:)
2840:.
2803:.
2777:.
2745:.
2739::
2698:.
2678:.
2636:.
2611:.
2586:.
2549:.
2525:.
2501:.
2443:.
2439::
2420:.
2406:.
2380:.
2354:.
2140:1
1953:.
1936:.
1919:.
1902:.
1888:.
1662:]
1593:)
1544:)
1463:)
1453:)
1399:]
1367:)
1295:-
1293:n
1072:)
969:?
799:)
706:(
555:)
355:,
315:X
313:E
311:T
278:2
274:1
271:+
269:1
162:(
115:)
23:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
