|
|
Click here to send a message to the publisher requesting email updates about current and future volumes of these books.
At the end of 1999, these books were named among the best twelve physical-science monographs of the century by American Scientist, along with: Dirac on quantum mechanics, Einstein on relativity, Mandelbrot on fractals, Pauling on the chemical bond, Russell and Whitehead on foundations of mathematics, von Neumann and Morgenstern on game theory, Wiener on cybernetics, Woodward and Hoffmann on orbital symmetry, Feynman on quantum electrodynamics, Smith on the search for structure, and Einstein's collected papers. Wow!
Fundamental Algorithms, Third Edition
(Reading, Massachusetts: Addison-Wesley, 1997), xx+650pp.
ISBN 0-201-89683-4
Volume 1 Fascicle 1, MMIX: A RISC Computer for the
New Millennium (2005), v+134pp. ISBN 0-201-85392-2
Translations of previous editions:
Romanian translation by Adrian Davidoviciu, Adrian Petrescu,
Smaranda Dimitriu, and Paul Zamfirescu,
Tratat de programarea calculatoarelor, V. 1:
Algoritmi fundamentali
(Bucharest: Editura tehnica, 1974), 676pp.
Russian translation by Galina P. Babenko and Iu. M. Baiakovskii,
edited by K. I. Babenko, and V. S. Shtarkman,
Iskusstvo programmirovaniia dlia ÉVM, T. 1:
Osnovnye algoritmy
(Moscow: Mir, 1976), 735pp.
Japanese translation, under direction of Takakazu Simauti, in two volumes:
Chinese translation by Guan JiWen and Su YunLin,
Ji Suan Ji Cheng Xu She Ji Ji Qiao, 1. Juan:
Ji Ben Suan Fa
(Beijing: Defense Industry Publishing Co., 1980), 14+573pp.
Spanish translation by Michel Antscherl Harlange and Joan Lluis i Biset,
under direction of Ramón Puigjaner i Trepat,
El Arte de Programar Ordenadores, V. 1:
Algoritmos Fundamentales
(Barcelona: Reverté, 1980), xxiii+672pp.
Hungarian translation, under direction of Miklós Simonovits,
A Számítógép-Programozás Müvészete, V. 1:
Alapvetö Algoritmusok
(Budapest: Müszaki Könyvkiadó, 1987), 654pp.
Translations of the third edition:
Russian translation by S. G. Trigub,
Yu. G. Gordienko, and I. V. Krasikov, edited by S. N. Trigub and
directed by Yu. V. Kozachenko,
Iskusstvo programmirovaniia, T. 1:
Osnovnye algoritmy (Moscow:
Vil'iams, 2000), 713pp.
Chinese translation
by Su YunLin,
Ji Suan Ji Cheng Xu She Ji Yi Shu, 1. Juan:
Ji Ben Suan Fa
(Beijing: National Defense Industry Press, 2002), xx+625pp.
Polish translation by G. Jakacki,
Sztuka Programowania, T. 1:
Algorytmy Podstawowe (Warsaw:
Wydawnictwa Naukowo-Techniczne, 2002),
xxiv+679pp.
Romanian translation by Mihaela Târpa,
Arta programării calculatoarelor, V. 1:
Algoritmi fundamentali
(Bucharest: Editura Teora Bucuresti, 2002), 616pp.
Japanese translation by Takashi Aoki, Kazuhiko Kakehi, Kenichi Suzuki,
and Takahiro Nagao, supervised by Makoto Arisawa and Eiiti Wada (Tokyo:
ASCII Corporation,
2004), xxii+632pp.
Korean
translation by Ryu Gwang (Seoul: Hanbit Media, 2006), 793pp.
German translation by Rüdiger Loos
(Heidelberg: Springer Verlag, 2007), to appear.
French translation, International Thompson Publishing, in preparation.
Czech translation (Brno: Computer Press), in preparation.
Translations of fascicles:
Romanian translation of Volume 1 Fascicle 1, by Ioan Bledea:
MMIX: Un calculator RISC pentru noul mileniu
(Bucharest: Editura Teora, 2005), ix+149pp.
Japanese translation of Volume 1 Fascicle 1,
by Takashi Aoki, supervised by Makoto Arisawa and Eiiti Wada (Tokyo:
ASCII Corporation,
2006), vii+134pp.
Russian translation of Volume 1 Fascicle 1, by Yu. G. Gordienko, edited by S. N. Trigub,
MMIX --- RISC-komp'iuter dlia novogo tysiacheletiia (Moscow:
Vil'iams,
2007), 151pp.
Seminumerical Algorithms, Third Edition
(Reading, Massachusetts: Addison-Wesley, 1997), xiv+762pp.
ISBN 0-201-89684-2
Translations of previous editions:
Russian translation by Galina P. Babenko, É. G. Belaga, and L. V.
Maiorov, edited by K. I. Babenko,
Iskusstvo programmirovaniia dlia ÉVM, T. 2:
Poluchislennye algoritmy
(Moscow: Mir, 1977), 724pp.
Japanese translation, under direction of Takakazu Simauti, in two volumes:
Romanian translation by Florian Petrescu, Ioan Georgescu,
Rolanda Predescu, and Paul Zamfirescu,
Tratat de programarea calculatoarelor, V. 2:
Algoritmi seminumerici
(Bucharest: Editura tehnica, 1983), 722pp.
Chinese translation by Guan JiWen and Su YunLin,
Ji Suan Ji Cheng Xu She Ji Ji Qiao, 2. Juan:
Ban Shu Zhi Suan Fa
(Beijing: Defense Industry Publishing Co., 1992), 10+622pp.
Hungarian translation, under direction of Miklós Simonovits,
A Számítógép-Programozás Müvészete, V. 2:
Szeminumerikus Algoritmusok
(Budapest: Müszaki Könyvkiadó, 1987), 690pp.
Translations of the third edition:
Russian translation by L. F. Kozachenko, V. T. Tertyshnyi, and I. V. Krasikov,
edited by S. N. Trigub and directed by Yu. V. Kozachenko,
Iskusstvo programmirovaniia, T. 2:
Poluchislennye algoritmy (Moscow:
Vil'iams, 2000), 830pp.
German translation of Chapter 4 by Rüdiger Loos
Arithmetik
(Heidelberg: Springer Verlag, 2001), xiii+538pp.
Chinese translation
by Su YunLin,
Ji Suan Ji Cheng Xu She Ji Yi Shu, 2. Juan:
Ban Shu Zhi Suan Fa
(Beijing: National Defense Industry Press, 2002), xii+760pp.
Romanian translation by Mihaela Târpa, Cora Radulian, and Mihai Iosif,
Arta programării calculatoarelor, V. 2:
Algoritmi seminumerici
(Bucharest: Editura Teora Bucuresti, 2002), 663pp.
Polish translation by Adam Malinowski,
Sztuka Programowania, T. 2:
Algorytmy Seminumeryczne (Warsaw:
Wydawnictwa Naukowo-Techniczne, 2002),
xviii+820pp.
Japanese translation by Hiroaki Saito, Takahiro Nagao, Shogo Matsui,
Takao Matsui, and Hitoshi Yamauchi,
supervised by Makoto Arisawa and Eiiti Wada (Tokyo:
ASCII Corporation,
2004), xvi+725pp.
French translation, International Thompson Publishing, in preparation.
Korean translation by Ryu Gwang (Seoul: Hanbit Media), in preparation.
Sorting and Searching, Second Edition
(Reading, Massachusetts: Addison-Wesley, 1998), xiv+780pp.+foldout.
ISBN 0-201-89685-0
Translations of the first edition:
Romanian translation by Rodica Boconcios, A. Davidoviciu,
P. Dimo, Fl. Moraru, A. Petrescu, I. Sipos, and Smaranda Dimitriu,
Tratat de programarea calculatoarelor, V. 3:
Sortare şi căutare
(Bucharest: Editura tehnica, 1976), xii+736pp.
Russian translation by Nadezhda I. V'iukova, V. A. Galatenko, and
A. B. Khodulev, edited by Iu. M. Baiakovskii and V. S. Shtarkman,
Iskusstvo programmirovaniia dlia ÉVM, T. 3:
Sortirovka i poisk
(Moscow: Mir, 1978), 844pp.
Chinese translation by Guan JiWen and Su YunLin,
Ji Suan Ji Cheng Xu She Ji Ji Qiao, 3. Juan:
Pai Xu He Cha Zhao
(Beijing: Defense Industry Publishing Co., 1985), viii+645pp.
Spanish translation by Jaime de Argila y de Chopitea and
Ramón Puigjaner Trepat, under direction of
Ramón Puigjaner Trepat,
El Arte de Programar Ordenadores, V. 3:
Clasificación y Búusqueda
(Barcelona: Reverté, 1980), xxiii+672pp.
Hungarian translation, under direction of Miklós Simonovits,
A Számítógép-Programozás Müvészete, V. 3:
Keresés és Rendezés
(Budapest: Müszaki Könyvkiadó, 1988), 761pp.
Translations of the second edition:
Russian translation by V. T. Tertyshnyi and I. V. Krasikov,
edited by S. N. Trigub and directed by Yu. V. Kozachenko,
Iskusstvo programmirovaniia, T. 3:
Sortirovka i poisk (Moscow:
Vil'iams, 2000), 823pp.
Chinese translation
by Su YunLin,
Ji Suan Ji Cheng Xu She Ji Yi Shu, 3. Juan:
Pai Xu Yu Cha Zhao
(Beijing: National Defense Industry Press, 2002), x+779pp.
Polish translation by K. Diks and A. Malinowski,
Sztuka Programowania, T. 3:
Sortowanie i Wyszukiwanie (Warsaw:
Wydawnictwa Naukowo-Techniczne, 2002),
xviii+838pp.
Romanian translation by Mihaela Târpa,
Arta programării calculatoarelor, V. 3:
Sortare şi căutare
(Bucharest: Editura Teora Bucuresti, 2002), 680pp.
Japanese translation by Yuichiro Ishii, Hiroshi Ichiji, Hiroshi Koide,
Eiko Takaoka, Kumiko Tanaka, and Takahiro Nagao,
supervised by Makoto Arisawa and Eiiti Wada (Tokyo:
ASCII Corporation,
2006), xvi+741pp.
French translation, International Thompson Publishing, in preparation.
Korean translation by Ryu Gwang (Seoul: Hanbit Media), in preparation.
Combinatorial Algorithms,
in preparation. (Some parts are already available; see below.)
Present plans are to publish ``Volume 4'' as at least
three separate subvolumes:
The material will first appear in beta-test form as fascicles of approximately 128 pages each, issued approximately twice per year. These fascicles will represent my best attempt to write a comprehensive account, but computer science has grown to the point where I cannot hope to be an authority on all the material covered in these books. Therefore I'll need feedback from readers in order to prepare the official volumes later.
Volume 4 Fascicle 0, Introduction to Combinatorial Algorithms
and Boolean Functions (2008), xii+216pp. ISBN 0-321-53496-4
Volume 4 Fascicle 2, Generating All Tuples and Permutations
(2005), v+128pp. ISBN 0-201-85393-0
Volume 4 Fascicle 3, Generating All Combinations and Partitions
(2005), vi+150pp. ISBN 0-201-85394-9
Volume 4 Fascicle 4, Generating All Trees; History of
Combinationatorial Generation (2006), vi+120pp. ISBN 0-321-33570-8
Some "pre-fascicles" are also available for alpha-testing:
Pre-Fascicle 1a (Bitwise tricks and techniques).
I've put them online primarily so that experts in the field can check the
contents before I inflict them on a wider audience. But if you want to
help debug them, please go right ahead.
Translations of fascicles:
Romanian translation of Volume 4 Fascicle 2, by Cora Radulian:
Generarea tuturor tuplurilor și permutărilor
(Bucharest: Editura Teora, 2005), vii+144pp.
Japanese translation of Volume 4 Fascicle 2
by Hiroshi Koide, supervised by Makoto Arisawa and Eiiti Wada (Tokyo:
ASCII Corporation,
2006), viii+129pp.
Russian translation of Volume 4 Fascicle 2, by Yu. G. Gordienko:
Generatsiia vsekh kortezheĭ i perestanovok (Moscow:
Vil'iams,
2007), 146pp.
Polish translation of Volume 4 Fascicle 2, by Adam Malinowski:
Generowanie wszystkich krotek i permutacji (Warsaw:
Wydawnictwa Naukowo-Techniczne, 2007),
xiv+137pp.
Russian translation of Volume 4 Fascicle 3, by I. V. Krasikov:
Generatsiia vsekh sochetaniĭ i razbieniĭ (Moscow:
Vil'iams,
2007), 200pp.
Russian translation of Volume 4 Fascicle 4, by I. V. Krasikov:
Generatsiia vsekh derev'ev. Istoriia kombinatornĭ generatsiĭ (Moscow:
Vil'iams,
2007), 156pp.
Syntactic Algorithms, in preparation.
Estimated to be ready in 2015.
As I write Volumes 4 and 5, I'll need to refer to topics that belong logically in Volumes 1--3 but weren't invented yet when I wrote those books. Instead of putting such material artificially into Volumes 4 or 5, I'll put it into fascicle form. The first such fascicle is in fact ready now (see above): It describes MMIX, a RISC machine that will take the place of MIX in all subsequent editions.
Download the 16 Feb 2004 version of Volume 1 Fascicle 1 (583KB of compressed PostScript) (this old version is however no longer being maintained)
After Volume 5 has been completed, I will revise Volumes 1--3 again to bring them up to date. In particular, the new material for those volumes that has been issued in beta-test fascicles will be incorporated at that time.
Then I will publish a ``reader's digest'' edition of Volumes 1--5, condensing the most important material into a single book.
And after Volumes 1--5 are done, God willing, I plan to publish Volume 6 (the theory of context-free languages) and Volume 7 (Compiler techniques), but only if the things I want to say about those topics are still relevant and still haven't been said. Volumes 1--5 represent the central core of computer programming for sequential machines; the subjects of Volumes 6 and 7 are important but more specialized.
Volumes 1--3 are available from the publisher, Addison-Wesley Publishing Company.
The MIX computer will soon be replaced by a RISC machine called MMIX. Meanwhile if you want to try out the existing programs for the original 60s-era machine, you might be able to find suitable software at the following sites:
(Please let me know of any other sites that I should add to this list.)
The main changes between the second and third editions of Volume 1 are listed in the Errata for Volume 1 (2nd ed.) (335K bytes of compressed PostScript, 80pp)---an archival file that is not being kept up to date. But thousands of additional refinements appear in the 3rd edition; you really should ask someone to get it for you next Christmas.
There's also a (shorter) list of changes to the new edition, last updated 26 May 2008:
Note: You can't run that TeX file through TeX; it imports all kinds of other files that are private. But if you have no way to look at compressed PostScript files, you might try reading the TeX code as a last resort; at least you'll be able to figure out the page numbers on which corrections have been made.
And there's also a (much shorter) list of changes to Volume 1 Fascicle 1, last updated 10 Feb 2008:
The main changes between the second and third editions of Volume 2 are listed in the Errata for Volume 2 (2nd ed.) (555K bytes of compressed PostScript, 142pp)---an archival file that is not being kept up to date. But thousands of additional refinements appear in the 3rd edition; you really should ask someone to get it for you next Christmas.
There's also a (shorter) list of changes to the new edition, last updated 27 May 2008:
Note: You can't run that TeX file through TeX; it imports all kinds of other files that are private. But if you have no way to look at compressed PostScript files, you might try reading the TeX code as a last resort; at least you'll be able to figure out the page numbers on which corrections have been made.
The main changes between the first and second editions of Volume 3 are listed in the Errata for Volume 3 (1st ed.) (430K bytes of compressed PostScript, 109pp)---an archival file that is not being kept up to date. But thousands of additional refinements appear in the 2nd edition; you really should ask someone to get it for you next Christmas.
There's also a (shorter) list of changes to the new edition, last updated 26 May 2008:
Note: You can't run that TeX file through TeX; it imports all kinds of other files that are private. But if you have no way to look at compressed PostScript files, you might try reading the TeX code as a last resort; at least you'll be able to figure out the page numbers on which corrections have been made.
Finally, here are the changes-so-far for the fascicles-so-far of Volume 4, last updated 02 May 2008.
Note: You can't run those TeX files through TeX; they import all kinds of other files that are private. But if you have no way to look at compressed PostScript files, you might try reading the TeX code as a last resort; at least you'll be able to figure out the page numbers on which corrections have been made.
The first finder of any error in my books receives $2.56; significant suggestions are also worth $0.32 each. If you are really a careful reader, you may be able to recoup more than the cost of the books this way.
However, people who have read the book Eats, Shoots & Leaves should not expect a reward for criticizing the ways in which I use commas. Punctuation is extremely important to me, but I insist on doing it my own way.
Please send your comments either by email to taocp@cs.stanford.edu or by old-fashioned mail to
Donald E. Knuth
Computer Science Department
Gates Building 4B
Stanford University
Stanford, CA 94305-9045 USA.
SPECIAL NOTE TO THE SPEAKERS OF FRENCH AND OTHER EXOTIC LANGUAGES: Numerous quotations and bibliographic citations found in this book have been copied verbatim from the original sources. If you believe you have found a typographic error, you must prove it by showing that the original was incorrectly transcribed; believe it or not, your language has changed over the years, just as English has.
Although I'm working full time on Volume 4 these days, I will try to reply to all such messages within six months of receipt.
BUT PLEASE DO NOT SEND EMAIL TO TAOCP EXCEPT TO REPORT ERRORS IN THE ART OF COMPUTER PROGRAMMING. And if you do report an error via email, please do not include attachments of any kind; your message should be readable on brand-X operating systems for all values of X.
Don Knuth's home page
Don Knuth's other books