American computer scientist and mathematician (born 1938)
Donald Knuth
Knuth in 2011
Born
Donald Ervin Knuth
(1938-01-10) January 10, 1938 (age 86)
Milwaukee, Wisconsin, U.S.
Education
Case Institute of Technology (BS, MS)
California Institute of Technology (PhD)
Known for
See list
The Art of Computer Programming,
TeX, METAFONT,
Computer Modern,
Knuth's up-arrow notation,
Knuth–Morris–Pratt algorithm,
Knuth–Bendix completion algorithm,
MMIX,
Robinson–Schensted–Knuth correspondence, LR parser,
Literate programming
Spouse
Nancy Jill Carter
Children
2
Awards
See list
SIGCSE Outstanding Contribution (1986)
Grace Murray Hopper Award (1971)
Turing Award (1974)
Member of the National Academy of Sciences (1975)
National Medal of Science (1979)
John von Neumann Medal (1995)
Harvey Prize (1995)
Kyoto Prize (1996)
Foreign Member of the Royal Society (2003)[1]
Faraday Medal (2011)
BBVA Foundation Frontiers of Knowledge Award (2010)
Turing Lecture (2011)
Flajolet Lecture (2014)
Scientific career
Fields
Mathematics
Computer science
Institutions
Stanford University University of Oslo
Thesis
Finite Semifields and Projective Planes(1963)
Doctoral advisor
Marshall Hall, Jr.[2]
Doctoral students
Leonidas J. Guibas
Michael Fredman
Scott Kim
Vaughan Pratt
Robert Sedgewick
Jeffrey Vitter
Andrei Broder[2]
Website
cs.stanford.edu/~knuth
Donald Ervin Knuth (/kəˈnuːθ/[3]kə-NOOTH; born January 10, 1938) is an American computer scientist and mathematician. He is a professor emeritus at Stanford University. He is the 1974 recipient of the ACM Turing Award, informally considered the Nobel Prize of computer science.[4] Knuth has been called the "father of the analysis of algorithms".[5]
Knuth 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. He strongly opposes the granting of software patents, and has expressed his opinion to the United States Patent and Trademark Office and European Patent Organisation.
^"Professor Donald Knuth ForMemRS". London: Royal Society. Archived from the original on November 17, 2015.
^ abDonald Knuth at the Mathematics Genealogy Project
^Cite error: The named reference faq was invoked but never defined (see the help page).
^Cite error: The named reference Turing Award was invoked but never defined (see the help page).
^Karp, Richard M. (February 1986). "Combinatorics, Complexity, and Randomness". Communications of the ACM. 29 (2): 98–109. doi:10.1145/5657.5658.
Donald Ervin Knuth (/kəˈnuːθ/ kə-NOOTH; born January 10, 1938) is an American computer scientist and mathematician. He is a professor emeritus at Stanford...
The Donald E. Knuth Prize is a prize for outstanding contributions to the foundations of computer science, named after the American computer scientist...
Literate programming is a programming paradigm introduced in 1984 by DonaldKnuth in which a computer program is given as an explanation of how it works...
(TAOCP) is a comprehensive monograph written by the computer scientist DonaldKnuth presenting programming algorithms and their analysis. Volumes 1–5 are...
and written by computer scientist and Stanford University professor DonaldKnuth and first released in 1978. TeX is a popular means of typesetting complex...
Knuth reward checks are checks or check-like certificates awarded by computer scientist DonaldKnuth for finding technical, typographical, or historical...
of typefaces used by the typesetting program TeX. It was created by DonaldKnuth with his Metafont program, and was most recently updated in 1992. Computer...
64-bit reduced instruction set computing (RISC) architecture designed by DonaldKnuth, with significant contributions by John L. Hennessy (who contributed...
Concrete Mathematics: A Foundation for Computer Science, by Ronald Graham, DonaldKnuth, and Oren Patashnik, first published in 1989, is a textbook that is widely...
Stanford University in only 20 months under the supervision of advisor DonaldKnuth. His thesis focused on analysis of the Shellsort sorting algorithm and...
1967. Many of its properties were first published by Chandler Davis and DonaldKnuth. It appeared on the section title pages of the Michael Crichton novel...
fonts that can be embedded into e.g. PostScript. Metafont was devised by DonaldKnuth as a companion to his TeX typesetting system. One of the characteristics...
Alan Perlis, of Carnegie Mellon University. The youngest recipient was DonaldKnuth who won in 1974, at the age of 36, while the oldest recipient was Alfred...
integers modulo Knuth equivalence. Its elements can be identified with semistandard Young tableaux. It was discovered by DonaldKnuth (1970) (who called...
awful algorithm", also calls bubble sort "the generic bad algorithm". DonaldKnuth, in The Art of Computer Programming, concluded that "the bubble sort...
The man or boy test was proposed by computer scientist DonaldKnuth as a means of evaluating implementations of the ALGOL 60 programming language. The...
} In 1976 DonaldKnuth published a paper to justify his use of the Ω {\displaystyle \Omega } -symbol to describe a stronger property. Knuth wrote: "For...
to square brackets, and applications to summation, was advocated by DonaldKnuth to avoid ambiguity in parenthesized logical expressions. There is a direct...
splitting memory into halves to try to give a best fit. According to DonaldKnuth, the buddy system was invented in 1963 by Harry Markowitz, and was first...
anagram). DonaldKnuth used a computer to study word ladders of five-letter words. He felt that three and four were too easy and six was too hard. Knuth used...
Global Information