Donald Knuth
Donald Knuth
Born Donald Ervin Knuth
(1938-01-10) January 10, 1938 (age 79)
Milwaukee, Wisconsin, U.S.
Nationality American
Alma mater Case Institute of Technology
(B.S., M.S.)
California Institute of Technology
Known for The Art of Computer Programming
Knuth-Morris-Pratt algorithm
Knuth-Bendix completion algorithm
Robinson-Schensted-Knuth correspondence
Scientific career
Fields Mathematics
Computer science
Institutions Stanford University
Thesis Finite Semifields and Projective Planes (1963)
Doctoral advisor Marshall Hall, Jr.[3]
Doctoral students

Donald Ervin Knuth ([4]k?-NOOTH; born January 10, 1938) is an American computer scientist, mathematician, and professor emeritus at Stanford University.

He is the author of the multi-volume work The Art of Computer Programming. He contributed to the development of the rigorous analysis of the computational complexity of algorithms and systematized formal mathematical techniques for it. In the process he also popularized the asymptotic notation. In addition to fundamental contributions in several branches of theoretical computer science, Knuth is the creator of the TeX computer typesetting system, the related METAFONT font definition language and rendering system, and the Computer Modern family of typefaces.

As a writer and scholar, Knuth created the WEB and CWEB computer programming systems designed to encourage and facilitate literate programming, and designed the MIX/MMIX instruction set architectures. Knuth strongly opposes granting software patents, having expressed his opinion to the United States Patent and Trademark Office and European Patent Organisation.


Early life

Knuth was born in Milwaukee, Wisconsin, to German-Americans Ervin Henry Knuth and Louise Marie Bohning.[5] His father had two jobs: running a small printing company and teaching bookkeeping at Milwaukee Lutheran High School.[6] Donald, a student at Milwaukee Lutheran High School, received academic accolades there, especially because of the ingenious ways that he thought of solving problems.[6] For example, in eighth grade, he entered a contest to find the number of words that the letters in "Ziegler's Giant Bar" could be rearranged to create. Although the judges only had 2,500 words on their list, Donald found 4,500 words, winning the contest. As prizes, the school received a new television and enough candy bars for all of his schoolmates to eat.[7][6]


Knuth had a difficult time choosing physics over music as his major at Case Institute of Technology (now part of Case Western Reserve University). He also joined Beta Nu Chapter of the Theta Chi fraternity. While studying physics at the Case Institute of Technology, Knuth was introduced to the IBM 650, one of the early mainframes. After reading the computer's manual, Knuth decided to rewrite the assembly and compiler code for the machine used in his school, because he believed he could do it better.[8]

In 1958, Knuth created a program to help his school's basketball team win their games. He assigned "values" to players in order to gauge their probability of getting points, a novel approach that Newsweek and CBS Evening News later reported on.[8]

Knuth was one of the founding editors of the Engineering and Science Review, which won a national award as best technical magazine in 1959.[9] He then switched from physics to mathematics, and in 1960 he received his bachelor of science degree, simultaneously being given a master of science degree by a special award of the faculty who considered his work exceptionally outstanding.[8][10]

In 1963, with mathematician Marshall Hall as his adviser,[3] he earned a PhD in mathematics from the California Institute of Technology.[11]

Early work

After receiving his PhD, Knuth joined Caltech's faculty as an associate professor.

He accepted a commission to write a book on computer programming language compilers. While working on this project, Knuth decided that he could not adequately treat the topic without first developing a fundamental theory of computer programming, which became The Art of Computer Programming. He originally planned to publish this as a single book. As Knuth developed his outline for the book, he concluded that he required six volumes, and then seven, to thoroughly cover the subject. He published the first volume in 1968.[12]

Just before publishing the first volume of The Art of Computer Programming, Knuth left Caltech to accept employment with the Institute for Defense Analyses' Communications Research Division, then situated on the Princeton University campus, which was performing mathematical research in cryptography to support the National Security Agency.

Knuth then left this position to join the Stanford University faculty, where he is now professor emeritus.[13]


Knuth is a writer as well as a computer scientist.[14] Knuth has been called the "father of the analysis of algorithms."[15]

The Art of Computer Programming (TAOCP)

In the 1970s, Knuth described computer science as "a totally new field with no real identity. And the standard of available publications was not that high. A lot of the papers coming out were quite simply wrong. ... So one of my motivations was to put straight a story that had been very badly told."[16] After producing the third volume of his series in 1976, he expressed such frustration with the nascent state of the then newly developed electronic publishing tools (especially those that provided input to phototypesetters) that he took time out to work on typesetting and created the TeX and Metafont tools. By 2013, the first three volumes and part one of volume four of his series had been published.[17]Concrete Mathematics: A Foundation for Computer Science 2nd ed., which originated with an expansion of the mathematical preliminaries section of Volume 1 of TAoCP, has also been published.

Bill Gates has praised the difficulty of the subject matter in The Art of Computer Programming, stating, "If you think you're a really good programmer ... You should definitely send me a résumé if you can read the whole thing."[18]

Other works

Knuth is also the author of Surreal Numbers,[19] a mathematical novelette on John Conway's set theory construction of an alternate system of numbers. Instead of simply explaining the subject, the book seeks to show the development of the mathematics. Knuth wanted the book to prepare students for doing original, creative research.

In 1995, Knuth wrote the foreword to the book A=B by Marko Petkov?ek, Herbert Wilf and Doron Zeilberger.[20] Knuth is also an occasional contributor of language puzzles to Word Ways: The Journal of Recreational Linguistics.

Knuth has also delved into recreational mathematics. He contributed articles to the Journal of Recreational Mathematics beginning in the 1960s, and was acknowledged as a major contributor in Joseph Madachy's Mathematics on Vacation.[21]

Works regarding Knuth's religious beliefs

In addition to his writings on computer science, Knuth, a Lutheran,[22] is also the author of 3:16 Bible Texts Illuminated,[23] in which he examines the Bible by a process of systematic sampling, namely an analysis of chapter 3, verse 16 of each book. Each verse is accompanied by a rendering in calligraphic art, contributed by a group of calligraphers under the leadership of Hermann Zapf. Subsequently he was invited to give a set of lectures on his 3:16 project, resulting in another book, Things a Computer Scientist Rarely Talks About, where he published the lectures "God and Computer Science".

Opinion on software patents

As a member of the academic and scientific community, Knuth is strongly opposed to the policy of granting software patents for trivial solutions that should be obvious, but has expressed more nuanced views for nontrivial solutions such as the integer point method of linear programming.[24] He has expressed his disagreement directly to both the United States Patent and Trademark Office and European Patent Organisation.[25]

Computer Musings

Knuth gives informal lectures a few times a year at Stanford University, which he titled "Computer Musings". He is a visiting professor at the Oxford University Department of Computer Science in the United Kingdom and an Honorary Fellow of Magdalen College.[26][27]

Personal life

Chinese name

Knuth's Chinese name is Gao Dena (simplified Chinese: ???; traditional Chinese: ???; pinyin: G?o dé nà).[28][4] In 1977, he was given this name by Frances Yao, shortly before making a 3-week trip to China.[4][29] In his 1980 volume of The Art of Computer Programming (simplified Chinese: ?????????; traditional Chinese: ????????; pinyin: Jìsuànj? chéngxù shèjì yìshù), Knuth explains that he embraced his Chinese name because he wanted to be known by the growing numbers of computer programmers in China at the time. In 1989, his Chinese name was placed atop the Journal of Computer Science and Technology header, which Knuth says "makes me feel close to all Chinese people although I cannot speak your language".[29]

Health concerns

In 2006, Knuth was diagnosed with prostate cancer. He underwent surgery in December that year and started "a little bit of radiation therapy... as a precaution but the prognosis looks pretty good", as he reported in his video autobiography.[30]


"Nested parens"--Donald Knuth (on Jacob Appelbaum's shirt within the two parentheses), Jacob Appelbaum, and Donald Knuth

Knuth used to pay a finder's fee of $2.56 for any typographical errors or mistakes discovered in his books, because "256 pennies is one hexadecimal dollar", and $0.32 for "valuable suggestions". According to an article in the Massachusetts Institute of Technology's Technology Review, these Knuth reward checks are "among computerdom's most prized trophies". Knuth had to stop sending real checks in 2008 due to bank fraud, and instead now gives each error finder a "certificate of deposit" from a publicly listed balance in his fictitious "Bank of San Serriffe".[31]

He once warned a correspondent, "Beware of bugs in the above code; I have only proved it correct, not tried it."[32]

Knuth published his first "scientific" article in a school magazine in 1957 under the title "Potrzebie System of Weights and Measures." In it, he defined the fundamental unit of length as the thickness of Mad No. 26, and named the fundamental unit of force "whatmeworry." Mad published the article in issue No. 33 (June 1957).[33]

To demonstrate the concept of recursion, Knuth intentionally referred "Circular definition" and "Definition, circular" to each other in the index of The Art of Computer Programming, Volume 1.

At the TUG 2010 Conference, Knuth announced a satirical XML-based successor to TeX, titled "iTeX" (pronounced [i:???t?ks??], performed with a bell ringing), which would support features such as arbitrarily scaled irrational units, 3D printing, input from seismographs and heart monitors, animation, and stereophonic sound.[34][35][36]

Awards and honors

In 1971, Knuth was the recipient of the first ACM Grace Murray Hopper Award. He has received various other awards including the Turing Award, the National Medal of Science, the John von Neumann Medal, and the Kyoto Prize.

Knuth was elected a Distinguished Fellow of the British Computer Society (DFBCS) in 1980 in recognition of Knuth's contributions to the field of computer science.

In 1990 he was awarded the one-of-a-kind academic title of Professor of The Art of Computer Programming, which has since been revised to Professor Emeritus of The Art of Computer Programming.

Knuth was elected to the National Academy of Sciences in 1975. In 1992, he became an associate of the French Academy of Sciences. Also that year, he retired from regular research and teaching at Stanford University in order to finish The Art of Computer Programming. He was elected a Foreign Member of the Royal Society (ForMemRS) in 2003.[2]

Knuth was elected as a Fellow (first class of Fellows) of the Society for Industrial and Applied Mathematics in 2009 for his outstanding contributions to mathematics.[37] He is a member of the Norwegian Academy of Science and Letters.[38] In 2012, he became a fellow of the American Mathematical Society.[39] Other awards and honors include:


A short list of his publications include:[48]

The Art of Computer Programming:

  1. ------ (1997). "The Art of Computer Programming". 1: Fundamental Algorithms (3rd ed.). Addison-Wesley Professional. ISBN 0-201-89683-4. 
  2. ------ (1997). "The Art of Computer Programming". 2: Seminumerical Algorithms (3rd ed.). Addison-Wesley Professional. ISBN 0-201-89684-2. 
  3. ------ (1998). "The Art of Computer Programming". 3: Sorting and Searching (2nd ed.). Addison-Wesley Professional. ISBN 0-201-89685-0. 
  4. ------ (2011). "The Art of Computer Programming". 4A: Combinatorial Algorithms. Addison-Wesley Professional. ISBN 0-201-03804-8. 
  5. ------ (2005). "MMIX--A RISC Computer for the New Millennium". 1, Fascicle 1. ISBN 0-201-85392-2. 
  6. ------ (2008). "The Art of Computer Programming". 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions. ISBN 0-321-53496-4. 
  7. ------ (2009). "The Art of Computer Programming". 4, Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams. ISBN 0-321-58050-8. 
  8. ------ (2005). "The Art of Computer Programming". 4, Fascicle 2: Generating All Tuples and Permutations. ISBN 0-201-85393-0. 
  9. ------ (2005). "The Art of Computer Programming". 4, Fascicle 3: Generating All Combinations and Partitions. ISBN 0-201-85394-9. 
  10. ------ (2006). "The Art of Computer Programming". 4, Fascicle 4: Generating All Trees--History of Combinatorial Generation. ISBN 0-321-33570-8. 
  11. ------ (2017). "The Art of Computer Programming". 4, Fascicle 5: Mathematical Preliminaries Redux; Backtracking; Dancing Links. ISBN 0-134-67179-1. 
  12. ------ (2015). "The Art of Computer Programming". 4, Fascicle 6: Satisfiability. ISBN 0-134-39760-6. 

Computers and Typesetting (all books are hardcover unless otherwise noted):

  1. ------ (1984). Computers & Typesetting. A, The TeXbook. Reading, MA: Addison-Wesley. ISBN 0-201-13447-0. , x+483pp.
  2. ------ (1984). Computers & Typesetting. A, The TeXbook. Reading, MA: Addison-Wesley. ISBN 0-201-13448-9.  (softcover).
  3. ------ (1986). Computers & Typesetting. B, TeX: The Program. Reading, MA: Addison-Wesley. ISBN 0-201-13437-3. , xviii+600pp.
  4. ------ (1986). Computers & Typesetting. C, The METAFONTbook. Reading, MA: Addison-Wesley. ISBN 0-201-13445-4. , xii+361pp.
  5. ------ (1986). Computers & Typesetting. C, The METAFONTbook. Reading, MA: Addison-Wesley. ISBN 0-201-13444-6.  (softcover).
  6. ------ (1986). Computers & Typesetting. D, METAFONT: The Program. Reading, MA: Addison-Wesley. ISBN 0-201-13438-1. , xviii+566pp.
  7. ------ (1986). Computers & Typesetting. E, Computer Modern Typefaces. Reading, MA: Addison-Wesley. ISBN 0-201-13446-2. , xvi+588pp.
  8. ------ (2000). Computers & Typesetting. A-E Boxed Set. Reading, MA: Addison-Wesley. ISBN 0-201-73416-8. 

Books of collected papers:

  1. ------ (1992). "Literate Programming". Lecture Notes (27). Stanford, CA: Center for the Study of Language and Information--CSLI. ISBN 0-937073-80-6. [49]
  2. ------ (1996). "Selected Papers on Computer Science". Lecture Notes (59). Stanford, CA: Center for the Study of Language and Information--CSLI. ISBN 1-881526-91-7. [50]
  3. ------ (1999). "Digital Typography". Lecture Notes (78). Stanford, CA: Center for the Study of Language and Information--CSLI. ISBN 1-57586-010-4. [51]
  4. ------ (2000). "Selected Papers on Analysis of Algorithms". Lecture Notes (102). Stanford, CA: Center for the Study of Language and Information--CSLI. ISBN 1-57586-212-3. [52]
  5. ------ (2003). "Selected Papers on Computer Languages" (cloth). Lecture Notes (139). Stanford, CA: Center for the Study of Language and Information--CSLI. ISBN 1-57586-381-2. , ISBN 1-57586-382-0 (paperback)[53]
  6. ------ (2003). "Selected Papers on Discrete Mathematics" (cloth). Lecture Notes (106). Stanford, CA: Center for the Study of Language and Information--CSLI. ISBN 1-57586-249-2. , ISBN 1-57586-248-4 (paperback)[54]
  7. Donald E. Knuth, Selected Papers on Design of Algorithms (Stanford, California: Center for the Study of Language and Information--CSLI Lecture Notes, no. 191), 2010. ISBN 1-57586-583-1 (cloth), ISBN 1-57586-582-3 (paperback)[55]
  8. Donald E. Knuth, Selected Papers on Fun and Games (Stanford, California: Center for the Study of Language and Information--CSLI Lecture Notes, no. 192), 2011. ISBN 978-1-57586-585-0 (cloth), ISBN 978-1-57586-584-3 (paperback)[56]
  9. Donald E. Knuth, Companion to the Papers of Donald Knuth (Stanford, California: Center for the Study of Language and Information--CSLI Lecture Notes, no. 202), 2011. ISBN 978-1-57586-635-2 (cloth), ISBN 978-1-57586-634-5 (paperback)[57]

Other books:

  1. Graham, Ronald L; Knuth, Donald E.; Patashnik, Oren (1994). "Concrete mathematics: A foundation for computer science" (Second ed.). Reading, MA: Addison-Wesley. ISBN 0-201-55802-5. MR 1397498.  xiv+657 pp.
  2. Knuth, Donald Ervin (1974). "Surreal numbers: how two ex-students turned on to pure mathematics and found total happiness: a mathematical novelette". Addison-Wesley. ISBN 978-0-201-03812-5. [19]
  3. Donald E. Knuth, The Stanford GraphBase: A Platform for Combinatorial Computing (New York, ACM Press) 1993. second paperback printing 2009. ISBN 0-321-60632-9
  4. Donald E. Knuth, 3:16 Bible Texts Illuminated (Madison, Wisconsin: A-R Editions), 1990. ISBN 0-89579-252-4
  5. Donald E. Knuth, Things a Computer Scientist Rarely Talks About (Center for the Study of Language and Information--CSLI Lecture Notes no 136), 2001. ISBN 1-57586-326-X
  6. Donald E. Knuth, MMIXware: A RISC Computer for the Third Millennium (Heidelberg: Springer-Verlag-- Lecture Notes in Computer Science, no. 1750), 1999. viii+550pp. ISBN 978-3-540-66938-8
  7. Donald E. Knuth and Silvio Levy, The CWEB System of Structured Documentation (Reading, Massachusetts: Addison-Wesley), 1993. iv+227pp. ISBN 0-201-57569-8. Third printing 2001 with hypertext support, ii + 237 pp.
  8. Donald E. Knuth, Tracy L. Larrabee, and Paul M. Roberts, Mathematical Writing (Washington, D.C.: Mathematical Association of America), 1989. ii+115pp
  9. Daniel H. Greene and Donald E. Knuth, Mathematics for the Analysis of Algorithms (Boston: Birkhäuser), 1990. viii+132pp.
  10. Donald E. Knuth, Mariages Stables: et leurs relations avec d'autres problèmes combinatoires (Montréal: Les Presses de l'Université de Montréal), 1976. 106pp.
  11. Donald E. Knuth, Axioms and Hulls (Heidelberg: Springer-Verlag--Lecture Notes in Computer Science, no. 606), 1992. ix+109pp. ISBN 3-540-55611-7


See also


  1. ^ a b "Donald Knuth: 1998 Fellow". Computer History Museum. 2015. Retrieved 2015. 
  2. ^ a b "Professor Donald Knuth ForMemRS". London: Royal Society. Archived from the original on 2015-11-17. 
  3. ^ a b c Donald Knuth at the Mathematics Genealogy Project
  4. ^ a b c Knuth, Donald Ervin. "Frequently Asked Questions". Home page. Stanford University. Retrieved . 
  5. ^ "Donald E. Knuth". Retrieved 2016. 
  6. ^ a b c Molly Knight Raskin (2013). No Better Time: The Brief, Remarkable Life of Danny Lewin--the Genius who Transformed the Internet. Da Capo Press, Incorporated. pp. 61-62. ISBN 978-0-306-82166-0. 
  7. ^ Shasha, Dennis Elliott; Lazere, Cathy A (1998). Out of their minds: the lives and discoveries of 15 great computer scientists. Springer. p. 90. ISBN 978-0-387-98269-4. 
  8. ^ a b c Koshy, Thomas (2004). Discrete mathematics with applications. Academic Press. p. 244. ISBN 978-0-12-421180-3. Retrieved 2011. 
  9. ^ History of Beta Nu Chapter. "Theta Chi". CWRU. 
  10. ^ "A.M. Turing Award; Donald ("Don") Erwin Knuth". ACM. 1974. 
  11. ^ Knuth, Donald Ervin (1963). "Finite Semifields and Projective Planes" (PDF). CaltechPhD dissertation 
  12. ^ "The Art of Computer Programming". Stanford University. 
  13. ^ Knuth, Donald Ervin. "Home page". Stanford University. Retrieved . 
  14. ^ Knuth, Donald Ervin. "Curriculum vitae". Stanford University. 
  15. ^ Karp, Richard M. (February 1986). "Combinatorics, Complexity, and Randomness". Communications of the ACM. New York, NY, USA: ACM. 29 (2): 98-109. doi:10.1145/5657.5658. 
  16. ^ "BBVA Foundation Frontiers of Knowledge Awards". Retrieved 2016. 
  17. ^ Knuth, Donald Ervin. "The Art of Computer Programming (TAOCP)". Retrieved 2012. 
  18. ^ Weinberger, Matt (26 April 2016). "Bill Gates once said 'definitely send me a résumé' if you finish this fiendishly difficult book'". Retrieved 2016. "If you think you're a really good programmer... read (Knuth's) Art of Computer Programming... You should definitely send me a résumé if you can read the whole thing," read a quote from Bill Gates on the cover of the third edition of the first volume. 
  19. ^ a b Knuth, Donald Ervin. "Surreal numbers". Home page. 
  20. ^ Zeilberg. "DEK". Rutgers. 
  21. ^ Madachy, Joseph S.,Mathematics on Vacation, Thomas Nelson & Sons Ltd. 1966
  22. ^ Platoni 2006.
  23. ^ Knuth, Donald Ervin (1991). 3:16 : Bible texts illuminated. Madison, WI: A-R Eds. ISBN 978-0-89579-252-5. 
  24. ^ "All Questions Answered" (PDF). Notices (article). The American Mathematical Society. March 2002. 
  25. ^ Knuth, Donald Ervin. "Against software patents" (PDF)Letter  to the patent offices in the USA and Europe.
  26. ^ "Professor Donald Knuth". Magdalen College. Retrieved 2010. 
  27. ^ "Notices". Oxford University Gazette. October 30, 2014. Retrieved 2015. 
  28. ^ Reutenauer, Arthur. "A brief history of TeX, volume II". TUGboat: 68-72. ISSN 0896-3207. 
  29. ^ a b Knuth, Donald Ervin (1980). ????????? (Ji suan ji cheng xu she ji ji qiao) [The Art of Computer Programming]. Translated by Guan, JiWen; Su, Yunlin. Beijing: Defense Industry Publishing Co. I fondly hope that many Chinese computer programmers will learn to recognize my Chinese name Gao Dena, which was given to me by Francis Yao just before I visited your country in 1977. I still have very fond memories of that three-week visit, and I have been glad to see Gao Dena on the masthead of the Journal of Computer Science and Technology since 1989. This name makes me feel close to all Chinese people although I cannot speak your language. 
  30. ^ "Donald Knuth: 85 - Coping with cancer". Web of Stories. April 2006. Retrieved 2012. 
  31. ^ "Rewriting the Bible in 0s and 1s". Technology Review. Massachusetts Institute of Technology. 
  32. ^ Knuth, Donald Ervin. "Frequently Asked Questions". Home page. Stanford University. Retrieved 2010. 
  33. ^ Knuth, Donald Ervin (June 1957). "Potrzebie System of Weights & Measures". Mad Magazine (33). 
  34. ^ Don Knuth (2010). "TUG". Zeeba TVconference 
  35. ^ Knuth, Donald Ervin, An Earth-shaking announcement, Zeeba TVvideo recording 
  36. ^ Knuth, Donald Ervin (2010). "An Earthshaking Announcement" (PDF). TUGboat. 31 (2): 121-24. ISSN 0896-3207. 
  37. ^ "Fellows". Siam. 2009. 
  38. ^ "Gruppe 1: Matematiske fag" (in Norwegian). Norwegian Academy of Science and Letters. Archived from the original on November 10, 2013. Retrieved 2010. 
  39. ^ List of Fellows of the American Mathematical Society, retrieved 2013-01-27.
  40. ^ Knuth, D. E. (1974). "Computer science and its relation to mathematics". Amer. Math. Monthly. 81: 323-343. doi:10.2307/2318994. 
  41. ^ Knuth, D. E. (1992). "Two notes on notation". Amer. Math. Monthly. 99: 403-422. arXiv:math/9205211 Freely accessible. doi:10.2307/2325085. 
  42. ^ "American Mathematical Society". Retrieved 2016. 
  43. ^ Knuth, Donald E. (1979). "Mathematical typography". Bull. Amer. Math. Soc. (N.S.). 1 (2): 337-372. MR 520078. doi:10.1090/s0273-0979-1979-14598-1. 
  44. ^ "Harvey". IL: Technion. 1995. 
  45. ^ "Katayanagi". CMU. 
  46. ^ Galardonados (2010). "Fronteras" (in Spanish). ES: FBBVA. 
  47. ^ Myers, Andrew (June 1, 2001). "Stanford's Don Knuth, a pioneering hero of computer programming". Stanford Report. Retrieved 2011. 
  48. ^ Knuth, Donald Ervin. "Books". Home page (list). 
  49. ^ Knuth, Donald Ervin. "Literate Programming". Home page. 
  50. ^ Knuth, Donald Ervin. "Selected Papers on Computer Science". Home page. 
  51. ^ Knuth, Donald Ervin. "Digital Typography". Home page. 
  52. ^ Knuth, Donald Ervin. "Selected Papers on Analysis of Algorithms". Home page. 
  53. ^ Knuth, Donald Ervin. "Selected Papers on Computer Languages". Home page. 
  54. ^ Knuth, Donald Ervin. "Selected Papers on Discrete Mathematics". Home page. 
  55. ^ Knuth, Donald Ervin. "Selected Papers on Design of Algorithms". Home page. 
  56. ^ Knuth, Donald Ervin. "Selected Papers on Fun and Games". Home page. 
  57. ^ Knuth, Donald Ervin. "Companion to the Papers of Donald Knuth"]". Home page. 


External links

  This article uses material from the Wikipedia page available here. It is released under the Creative Commons Attribution-Share-Alike License 3.0.


Connect with defaultLogic
What We've Done
Led Digital Marketing Efforts of Top 500 e-Retailers.
Worked with Top Brands at Leading Agencies.
Successfully Managed Over $50 million in Digital Ad Spend.
Developed Strategies and Processes that Enabled Brands to Grow During an Economic Downturn.
Taught Advanced Internet Marketing Strategies at the graduate level.

Manage research, learning and skills at defaultLogic. Create an account using LinkedIn or facebook to manage and organize your IT knowledge. defaultLogic works like a shopping cart for information -- helping you to save, discuss and share.

  Contact Us