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

Case Western Reserve University

University in Ohio, United States

California Institute of Technology

Private research university located in Pasadena, California

Stanford University

Private research university located in Stanford, California, United States

#262 World Rank

Computer Science

#1666 World Rank

Mathematics

#2941 World Rank

Engineering

#5705 World Rank

Literature

Want to be an Academic Influence Insider?

Sign up to get the latest news, information, and rankings in our upcoming newsletter.