#4063 Overall Influence

American computer scientist

Knuth is professor emeritus of computer science at Stanford University. He received his Ph.D. in Mathematics at the California Institute of Technology (Cal Tech). As an undergraduate at the Case Institute of Technology (now Case Western Reserve University), Knuth received the extraordinary honor of receiving his bachelor of science degree together with a master of science in mathematics based on the strength of his work at Case. He also helped redesign an early IBM computer while at Case, and made fundamental contributions to programming—writing a program to help predict the scores of basketball players on his college team.

While an associate professor at Caltech, Knuth wrote the influential The Art of Computer Programming, a tome of seven volumes that quickly became a go-to book for anyone interested in the how’s and why’s of computer programming. Knuth’s publication is a notoriously deep-dive into programming. In fact, Microsoft Chairman Bill Gates once quipped that “If you think you’re a really good programmer ... You should definitely send me a résumé if you can read the whole thing.” His name has become synonymous with the fundamentals of computer programming. Knuth is also the author of Surreal Numbers, a book exploring alternate systems of numbers, as well as numerous articles and contributions to recreational mathematics. He spearheaded the idea of “literate programming,” inviting programmers to think of programming as works of literature, or writing. Winner of many awards, Knuth was inducted into the National Academy of Sciences in 1975. He is one of the true pioneers in that most central of areas of computer science, the art (and science) of writing programs.

**Featured in Top Influential Computer Scientists Today**

Donald Ervin Knuth is an American computer scientist, mathematician, and professor emeritus at Stanford University. He is the 1974 recipient of the ACM Turing Award, informally considered the Nobel Prize of computer science. Knuth has been called the "father of the analysis of algorithms".

Source: Wikipedia- On the LambertW function
- Fast Pattern Matching in Strings
- Semantics of context-free languages
- Literate Programming
- An analysis of alpha-beta pruning
- On the translation of languages from left to right
- Structured Programming with go to Statements
- An empirical study of FORTRAN programs
- Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.
- Permutations, matrices, and generalized Young tableaux
- Big Omicron and big Omega and big Theta
- Dynamic huffman coding
- Optimum binary search trees
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Digital halftones by dot diffusion
- Complexity Results for Bandwidth Minimization
- The birth of the giant component
- Finite semifields and projective planes
- Semantics of context-free languages: Correction
- A generalization of Dijkstra's algorithm
- Estimating the Efficiency of Backtrack Programs
- Two Notes on Notation
- The Sandwich Theorem
- Additional comments on a problem in concurrent programming control
- The Problem of Compatible Representatives
- backus normal form vs. Backus Naur form
- Computer programming as an art
- Computer programming as an art
- Concrete Mathematics: A Foundation for Computer Science
- Enumeration of plane partitions
- Breaking paragraphs into lines
- Top-down syntax analysis
- A sequence of series for the Lambert W function
- THE AVERAGE HEIGHT OF PLANTED PLANE TREES
- Notes on avoiding “go to” statements
- Analysis of a simple factorization algorithm
- Mathematics and Computer Science: Coping with Finiteness
- Two Notes on Notation
- Stable Marriage and Its Relation to Other Combinatorial Problems
- Johann Faulhaber and sums of powers
- Mathematical typography
- A characterization of parenthesis languages
- The first cycles in an evolving graph
- The errors of tex
- The expected linearity of a simple equivalence algorithm
- A structured program to generate all topological sorting arrangements
- Computation of tangent, Euler, and Bernoulli numbers
- Computer Science and its Relation to Mathematics
- Ancient Babylonian algorithms
- Deletions That Preserve Randomness
- Randomized incremental construction of delaunay and Voronoi diagrams
- Mathematics for the Analysis of Algorithms
- A imaginary number system
- Subspaces, subsets, and partitions
- Notes on generalized Dedekind sums
- Computer-drawn flowcharts
- Computer Science and Its Relation to Mathematics
- Stable husbands
- A trivial algorithm whose analysis isn't
- Optimal measurement points for program frequency counts
- Analysis of the subtractive algorithm for greatest common divisors
- The remaining trouble spots in ALGOL 60
- Simple Word Problems in Universal Algebras
- Linear Probing and Graphs
- Notes on central groupoids
- Von Neumann's First Computer Program
- Recurrence relations based on minimization
- Postscript about NP-hard problems
- Programming pearls
- The asymptotic number of geometries
- A class of projective planes
- The genesis of attribute grammars
- Estimating the efficiency of backtrack programs
- Algorithmic Thinking and Mathematical Thinking
- Overlapping Pfaffians
- Nested satisfiability
- Examples of formal semantics
- An analysis of optimum caching
- A recurrence related to trees
- The Average Time for Carry Propagation
- Algorithms
- A note on solid partitions
- Activity in an Interleaved Memory
- On Methods of Constructing Sets of Mutually Orthogonal Latin Squares Using a Computer. I
- Efficient representation of perm groups
- Verification of link-level protocols
- Inhomogeneous sorting
- Complements and transitive closures
- A note on strategy elimination in bimatrix games
- Evaluation of Porter's constant
- A proposal for input-output conventions in ALGOL 60
- Programming pearls
- Fibonacci Multiplication
- Oriented subtrees of an arc digraph
- Algorithmic Thinking and Mathematical Thinking
- Evaluation of polynomials by computer
- Combinatorial Analysis and Computers
- A terminological proposal
- A Permanent Inequality
- Another Enumeration of Trees
- Wheels within wheels
- SOLߞA Symbolic Language for General-Purpose Systems Simulation
- Recounting the Rationals, Continued: 10906
- George Forsythe and the development of computer science
- Huffman's algorithm via algebra
- An Exact Analysis of Stable Allocation
- Evading the drift in floating-point addition
- A short proof of Darboux's lemma
- Semi-optimal bases for linear dependencies
- ALGOL 60 confidential
- Algorithms in modern mathematics and computer science
- Supernatural Numbers
- The Bose-Nelson Sorting Problem††The preparation of this report has been supported in part by the National Science Foundation, and in part by the Office of Naval Research.
- A Permanent Inequality
- Two-Way Rounding
- Optimal prepaging and font caching
- Minimizing Drum Latency Time
- Programming Language for Automata
- The complexity of songs
- Length of strings for a merge sort
- RUNCIBLE—algebraic translation on a limited computer
- Shellsort with three increments
- A one-way, stackless quicksort algorithm
- Random matroids
- A Formal Definition of SOL
- Addition Machines
- Son of seminumerical algorithms
- Textbook Examples of Recursion
- The IBM 650: An Appreciation from the Field
- A Simple Program Whose Proof Isn’t
- Construction of a random sequence
- The distribution of continued fraction approximations
- The average time for carry propagation
- The Early Development of Programming Languages**The preparation of this paper has been supported in part by National Science Foundation Grant No. MCS 72-03752 A03, by the Office of Naval Research contract N00014-76-C-0330, and by IBM Corporation. The authors wish to thank the originators of the languages cited for their many helpful comments on early drafts of this paper.††Reprinted from J. Belzer, A. G. Holzman, and A. Kent (eds.), “Encyclopedia of Computer Science and Technology,” Vol. 6, pp. 419–493. Dekker, New York, 1977. Courtesy of Marcel Dekker, Inc.
- Lexicographic permutations with restrictions
- Theory and practice
- On Methods of Constructing Sets of Mutually Orthogonal Latin Squares Using a Computer. II
- A Random Knockout Tournament (D. E. Knuth)
- InterviewDonald Knuth: A life's work interrupted
- The Toilet Paper Problem
- Combinatorial Analysis and Computers
- Irredundant intervals
- Elementary Problems: E2611-E2616
- Elementary Problems: E3301-E3306
- E3432
- Optimum binary search trees
- An experiment in optimal sorting
- A Fibonacci-like Sequence of Composite Numbers
- The calculation of Easter…
- Robert W Floyd, In Memoriam
- A Fibonacci-Like Sequence of Composite Numbers
- 11151
- Polynomials Involving the Floor Function.
- The letter S
- The Toilet Paper Problem
- Euler's Constant to 1271 Places
- The Art of Computer Programming, Vol. 3: Sorting and Searching
- E2307
- Learning from our Errors
- Notes on avoiding “go to” statements
- The Dangers of Computer-Science Theory
- A Reverse Card Shuffle (David Berman and M. S. Klamkin)
- The complexity of songs
- SMALGOL-61
- Letters to the editor
- The Art of Computer Programming. Volume 1: Fundamental Algorithms.
- Leaper Graphs
- Insel der Zahlen
- Efficient Coroutine Generation of Constrained Gray Sequences
- An algorithm for Brownian zeroes
- Permutations with nonnegative partial sums
- A bijection for ordered factorizations
- History of binary and other nondecimal numeration
- A short proof of Darboux's lemma
- Fibonacci multiplication
- Context-Free Multilanguages
- Serial Isogons of 90 Degrees
- Euler’s constant to $1271$ places
- InterviewThe 'art' of being Donald Knuth
- Bottom-up education
- Bottom-up education
- The Art of Programming, Vol. I: Fundamental Algorithms
- 5264
- Very Magic Squares
- E3303
- 6581
- 6575
- E3429
- Elementary Problems: E3427-E3432
- 10689
- Serial Isogons of 90 Degrees
- 10871
- 10832
- 10875
- Problems: 10466-10472
- Elementary Problems: E2980-E2985
- Concrete Mathematics, a Foundation for Computer Science
- Some Bernstein Polynomials: 10985
- A symmetrical Eulerian identity
- The Knowlton–Graham Partition Problem
- MMMIX
- MMOTYPE
- MMIX
- MMIX-ARITH
- MMIX-CONFIG
- MMIX-IO
- MMIX-MEM
- MMIX-PIPE
- MMIXAL
- Boundless Interests, A Common Thread
- Disappearances
- Der Stein
- Sätze
- Der Antrag
- Unheil
- Wiederherstellung
- Das Universum
- Unendlich
- Multiplikation
- Nachwort
- Symbole
- Beweise
- Schlechte Zahlen
- Fortschritte
- Der dritte Tag
- Entdeckung
- Addition
- Die Antwort
- Satisfiability and The Art of Computer Programming
- Arithmetik
- Arithmetik
- The Remaining Troublespots in Algol 60
- Mathematical Vanity Plates
- Fibonacci multiplication
- Fibonacci multiplication
- Foreword
- Database Scripting using Non-Java Languages
- Very Magic Squares
- Representing Numbers Using Only One 4
- The Chinese Domino Challenge
- Herbert S. Wilf (1931–2012)
- The Chinese Domino Challenge
- Two Thousand Years of Combinatorics
- A Binomial Summation (Gengzhe Chang and Zun Shan)
- A Random Knockout Tournament
- Analysis of the subtractive algorithm for greatest common divisors
- An Algorithmic View of the Universe
- Let's not dumb down the history of computer science
- Backus' language
- Invited papers
- Randomness in Music
- International Olympiad in Informatics: Roads to Algorithmic Thinking
- Analysis of a Simple Factorization Algorithm
- The Computer Modern Family of Typefaces
- Progress in the Analysis of Algorithms at Sanford
- The Art of Computer Programming--Errata et Addenda
- The Art of Computer Programming. Vol. II: Seminumerical Algorithms
- Tables of Tangent Numbers, Euler Numbers, and Bernoulli Numbers
- Advanced Problems: 5240,5261-5269
- The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
- E2328
- Surreal Numbers.
- Elementary Problems: E2492-E2496
- E2492
- Advanced Problems: 6048-6053
- Elementary Problems: E2635-E2640
- 6049
- 6050
- E2636
- E2613
- Advanced Problems: 6579-6582
- E3061
- Elementary Problems: E3265-E3268
- E3062
- Elementary Problems: E3105-E3110
- Elementary Problems: E3307-E3312
- E3166
- 6480
- E3106
- E3463
- Advanced Problems: 6649-6651
- Elementary Problems: E3331-E3336
- E2982
- Elementary Problems: E3415-E3420
- E3411
- Elementary Problems: E3463-E3468
- Elementary Problems: E3409-E3414
- E3335
- Concrete Mathematics: A Foundation for Computer Science.
- E3267
- E3309
- Problems: 10274-10281
- E3415
- Problems: 10298-10305
- 6649
- Minimal Special Matrices: 10470
- Subtracting Square Roots Repeatedly: 10568
- A Card-Matching Game: 10576
- Negatively Correlated Vectors of Signs: 10593
- 10691
- A Parity Problem in Combinatorial Enumeration: 10546
- On a Convolution of Eulerian Numbers: 10609
- 10726
- 10720
- Representing Numbers Using Only One 4
- Problems
- Problems
- Problems
- Problems
- Problems
- Problems
- Problems
- Problems
- The Probability of Being in a State: 10726
- 10858
- 10913
- The Real Numbers, Algebraically: 10689
- 10906
- Leaves of Ordered Trees: 10757
- A Stirling Series: 10832
- Cube-Free Sums: 11078
- 11243
- Problems
- Problems: 10396-10402
- Problems: 10585-10591
- 10424
- 10280
- Problems: 10564-10570
- Problems: 10543-10549
- Problems: 10571-10577
- Problems: 10606-10612
- 10401
- 10298
- 11142
- A Modular Triple: 11021
- Problems
- A Conversation with Don Knuth: Part 2
- A Conversation with Don Knuth: Part I
- 10985
- Highly Variable Lists: 10691
- Exploring All Binary Mazes: 10720
- A Fibonacci-Lucas Extremum: 10825
- Min-Plus Matrix Multiplication: 10834
- Min-Plus Matrix Multiplication: 10834
- Problems
- Balanced Neighborhood Squares: 10871
- Products of Transpositions: 10913
- Animals in a Cage: 10875
- Fibonacci in Complex Camouflage: 10858
- 11078
- Le concept de métafonte
- Budoucnost TeXu a METAFONTu
- L’avenir de TeX et de METAFONT
- TeX 3.0 ou le TeX nouveau va arriver
- Big Omicron and Big Omega and Big Theta (1976)

Private research university located in Pasadena, California

view profilePrivate research university located in Stanford, California, United States

view profile#256 World Rank

Computer Science

#1612 World Rank

Mathematics

#2786 World Rank

Engineering

#5462 World Rank

Literature

Stay informed! Get the latest Academic Influence news, information, and rankings with our upcoming newsletter.