– Parsing techniques Volume 6 – The Theory of Context-free Languages Volume 7 – Compiler Techniques English editions Current editions These are the current editions in order by volume number: The Art of Computer Programming, Volumes 1-4B Boxed Set. (Reading, Massachusetts: Addison-Wesley, 2023), 3904pp. Volume 1: Fundamental Algorithms. Third Edition (Reading, Massachusetts: Addison-Wesley, 1997), xx+650pp. . Errata: (2011-01-08), (2020-03-26, 27th printing). Addenda: (2011). Volume 2: Seminumerical Algorithms. Third Edition (Reading, Massachusetts: Addison-Wesley, 1997), xiv+762pp. . Errata: (2011-01-08), (2020-03-26, 26th printing). Addenda: (2011). Volume 3: Sorting and Searching. Second Edition (Reading, Massachusetts: Addison-Wesley, 1998), xiv+780pp.+foldout. . Errata: (2011-01-08), (2020-03-26, 27th printing). Addenda: (2011). Volume 4A: Combinatorial Algorithms, Part 1. First Edition (Upper Saddle River, New Jersey: Addison-Wesley, 2011), xv+883pp. . Errata: (2020-03-26?, 22nd printing). Volume 4B: Combinatorial Algorithms, Part 2. First Edition (Upper Saddle River, New Jersey: Addison-Wesley, 2023), xviii+714pp. (2022-11-??, 2nd printing). Volume 1, Fascicle 1: MMIX – A RISC Computer for the New Millennium. (Addison-Wesley, 2005-02-14) . Errata: (2020-03-16) (will be in the fourth edition of volume 1) Previous editions Complete volumes These volumes were superseded by newer editions and are in order by date. Volume 1: Fundamental Algorithms. First edition, 1968, xxi+634pp, . Volume 2: Seminumerical Algorithms. First edition, 1969, xi+624pp, . Volume 3: Sorting and Searching. First edition, 1973, xi+723pp+foldout, . Errata: . Volume 1: Fundamental Algorithms. Second edition, 1973, xxi+634pp, . Errata: . Volume 2: Seminumerical Algorithms. Second edition, 1981, xiii+ 688pp, . Errata: . The Art of Computer Programming, Volumes 1-3 Boxed Set. Second Edition (Reading, Massachusetts: Addison-Wesley, 1998), pp. The Art of Computer Programming, Volumes 1-4A Boxed Set. Third Edition (Reading, Massachusetts: Addison-Wesley, 2011), 3168pp. Fascicles Volume 4 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, . Errata: (2011-01-01). Volume 4, Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams. (Addison-Wesley Professional, 2009-03-27) viii+260pp, . Errata: (2011-01-01). Volume 4, Fascicle 2: Generating All Tuples and Permutations. (Addison-Wesley, 2005-02-14) v+127pp, . Errata: (2011-01-01). Volume 4, Fascicle 3: Generating All Combinations and Partitions. (Addison-Wesley, 2005-07-26) vi+150pp, . Errata: (2011-01-01). Volume 4, Fascicle 4: Generating All Trees; History of Combinatorial Generation. (Addison-Wesley, 2006-02-06) vi+120pp, . Errata: (2011-01-01). Volume 4 fascicles 5–6 were revised and partially published as Volume 4B: Volume 4, Fascicle 5: Mathematical Preliminaries Redux; Backtracking; Dancing Links. (Addison-Wesley, 2019-11-22) xiii+382pp, . Errata: (2020-03-27) Volume 4, Fascicle 6: Satisfiability. (Addison-Wesley,