#167

Most Influential Person

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**

According to Wikipedia, 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".

- The Art of Computer Programming (11810)
- On the LambertW function (3648)
- Fast Pattern Matching in Strings (2996)
- The art of computer programming. Vol.2: Seminumerical algorithms (2834)
- The Art of Computer Programming, Volume III: Sorting and Searching (2531)
- Concrete mathematics - a foundation for computer science (2427)
- The art of computer programming, volume 3: (2nd ed.) sorting and searching (2263)
- The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition (2190)
- The art of computer programming: sorting and searching (volume 3) (2163)
- The Art of Computer Programming, Volume II: Seminumerical Algorithms (1810)
- Simple Word Problems in Universal Algebras (1702)
- Sorting and Searching (1540)
- Literate Programming (1518)
- The Art of Computer Programming 2 / Seminumerical Algorithms (1169)
- The Art of Computer Programming, Vol. 3: Sorting and Searching (1145)
- The art of computer programming: V.1.: Fundamental algorithms (1073)
- Semantics of context-free languages (1010)
- An Analysis of Alpha-Beta Pruning (985)
- The Stanford GraphBase - a platform for combinatorial computing (933)
- Concrete Mathematics, a Foundation for Computer Science (920)
- The art of computer programming: fundamental algorithms (867)
- On the Translation of Languages from Left to Right (824)
- An empirical study of FORTRAN programs (721)
- Structured Programming with go to Statements (696)
- The TeXbook (673)
- PERMUTATIONS, MATRICES, AND GENERALIZED YOUNG TABLEAUX (645)
- Big Omicron and big Omega and big Theta (578)
- The Art of Computer Programming, Vol. 2 (569)
- Concrete mathematics - a foundation for computer science (2. ed.) (485)
- The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information (449)
- Dynamic Huffman Coding (431)
- The Birth of the Giant Component (428)
- Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research. (422)
- Mathematics for the Analysis of Algorithms (412)
- Two notes on notation (392)
- The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming) (371)
- Randomized incremental construction of Delaunay and Voronoi diagrams (364)
- fundamental algorithms (325)
- Digital halftones by dot diffusion (320)
- Estimating the efficiency of backtrack programs. (308)
- The complexity of nonuniform random number generation (305)
- The Sandwich Theorem (303)
- COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION (289)
- Efficient balanced codes (262)
- A Generalization of Dijkstra's Algorithm (254)
- Axioms and Hulls (244)
- Finite semifields and projective planes (240)
- Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms (226)
- Dancing links (213)
- THE AVERAGE HEIGHT OF PLANTED PLANE TREES (210)
- backus normal form vs. Backus Naur form (197)
- The Problem of Compatible Representatives (196)
- Breaking paragraphs into lines (189)
- A sequence of series for the Lambert W function (183)
- Enumeration of Plane Partitions (173)
- The Art of Computer Programming, Volumes 1-3 Boxed Set (166)
- The errors of tex (165)
- Optimum binary search trees (161)
- Additional comments on a problem in concurrent programming control (157)
- Computer programming as an art (151)
- Johann Faulhaber and sums of powers (149)
- The WEB system of structured documentation (144)
- Computer Science and its Relation to Mathematics (139)
- Mathematics and Computer Science: Coping with Finiteness (138)
- The METAFONTbook (134)
- Analysis of a Simple Factorization Algorithm (133)
- Mathematical Analysis of Algorithms (127)
- TeX: The Program (123)
- Notes on Avoiding "go to" Statements (122)
- The Art of Computer Programming: Combinatorial Algorithms, Part 1 (119)
- The first cycles in an evolving graph (119)
- The Early Development of Programming Languages. (109)
- The TEX Book (108)
- The T E Xbook (108)
- Selected combinatorial research problems. (106)
- A imaginary number system (104)
- The Computer as Master Mind (103)
- Computer-drawn flowcharts (96)
- Semantics of context-free languages: Correction (95)
- The Expected Linearity of a Simple Equivalence Algorithm (93)
- The Genesis of Attribute Grammars (88)
- The Art of Computer Programming: Volume IV: Fascicle 2: Generating All Tuples and Permutations (86)
- Computer programming as an art (85)
- A Structured Program to Generate all Topological Sorting Arrangements (85)
- The power of a prime that divides a generalized binomial coefficient. (85)
- Algorithmic Thinking and Mathematical Thinking (84)
- The Metafont book (84)
- Ordered Hash Tables (82)
- Ancient Babylonian algorithms (82)
- Overlapping Pfaffians (82)
- A Characterization of Parenthesis Languages (81)
- Randomized Incremental Construction of Delaunay and Voronoi Diagrams (80)
- Computation of Tangent, Euler, and Bernoulli Numbers* (77)
- Optimal measurement points for program frequency counts (74)
- Mathematical Writing (71)
- The CWEB system of structured documentation - version 3.0 (70)
- Generating all trees : history of combinatorial generation (70)
- Advances in Computational Mathematics (68)
- Stable husbands (68)
- Stable Networks and Product Graphs (68)
- A recurrence related to trees (67)
- TEX and METAFONT: New directions in typesetting (66)
- Metafont: The Program (65)
- SOLߞA Symbolic Language for General-Purpose Systems Simulation (62)
- Examples of formal semantics (60)
- The Average Time for Carry Propagation (59)
- The Art of Computer Programming, Volume 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions (Art of Computer Programming) (58)
- The Asymptotic Number of Geometries (57)
- The Stanford GraphBase: a platform for combinatorial algorithms (57)
- A Trivial Algorithm Whose Analysis Isn't (56)
- Subspaces, subsets, and partitions (56)
- Computer modern typefaces (55)
- Deciphering a linear congruential encryption (55)
- The remaining trouble spots in ALGOL 60 (55)
- Deletions That Preserve Randomness (55)
- Art of Computer Programming, Volumes 1-4A Boxed Set (54)
- Selected papers on analysis of algorithms (53)
- Notes on generalized Dedekind sums (53)
- Programming pearls: literate programming (52)
- Linear Probing and Graphs (51)
- Von Neumann's First Computer Program (48)
- Postscript about NP-hard problems (48)
- Convolution polynomials (48)
- Algorithms in modern mathematics and computer science (48)
- A Programming and Problem-Solving Seminar (46)
- A note on strategy elimination in bimatrix games (45)
- Top-down syntax analysis (44)
- The art of computer programming, , Volume III, 2nd Edition (43)
- A class of projective planes (42)
- The Art of Computer Programming, Volume 1, Fascicle 1: MMIX -- A RISC Computer for the New Millennium (Art of Computer Programming) (41)
- Analysis of the subtractive algorithm for greatest common divisors (41)
- Efficient representation of perm groups (41)
- Analysis of the subtractive algorithm for greatest common divisors (40)
- Euler's Constant to 1271 Places (38)
- A terminological proposal (38)
- On Methods of Constructing Sets of Mutually Orthogonal Latin Squares Using a Computer. I (38)
- Combinatorial Analysis and Computers (37)
- Mixing Right-to-left Texts with Left-to-right Texts (37)
- Surreal numbers : how two ex-students turned on to pure mathematics and found total happiness : a mathematical novelette (36)
- Digital typography (36)
- Recurrence relations based on minimization (36)
- A Formal Definition of SOL (35)
- Notes on central groupoids (35)
- A proposal for input-output conventions in ALGOL 60 (33)
- An Analysis of Optimum Caching (33)
- Verification of link-level protocols (32)
- Textbook Examples of Recursion (31)
- Evaluation of polynomials by computer (31)
- Introduction to combinatorial algorithms and boolean functions (30)
- George Forsythe and the development of computer science (30)
- Activity in an Interleaved Memory (29)
- An Exact Analysis of Stable Allocation (29)
- A Permanent Inequality (28)
- Nested satisfiability (28)
- Restrictions of Minimum Spanner Problems (28)
- Virtual Fonts: More Fun for Grand Wizards (28)
- Generating all tuples and permutations (28)
- Generating all combinations and partitions (27)
- Oriented subtrees of an arc digraph (27)
- MMIX : a RISC computer for the new millennium (26)
- MMIXware, A RISC Computer for the Third Millennium (26)
- Huffman's Algorithm via Algebra (25)
- Evaluation of Porter's constant (24)
- Another enumeration of trees (24)
- ALGOL 60 confidential (23)
- Selected papers on computer science (23)
- Evading the Drift in Floating-Point Addition (23)
- Inhomogeneous sorting (23)
- METAFONT: a system for alphabet design (23)
- Tau Epsilon Chi, a system for technical text (22)
- Things a Computer Scientist Rarely Talks About (21)
- The complexity of songs (20)
- Concrete Math (20)
- 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. (19)
- A note on solid partitions (19)
- Selected papers on computer languages (19)
- The Art of Programming (18)
- Complements and transitive closures (18)
- The Toilet Paper Problem (17)
- A simple program whose proof isn't (17)
- Wheels within wheels (17)
- A torture test for TEX (16)
- A review of Structured Programming. (16)
- Aztec Diamonds, Checkerboard Graphs, and Spanning Trees (15)
- A one-way, stackless quicksort algorithm (15)
- Programming Language for Automata (15)
- The distribution of continued fraction approximations (15)
- Matroid partitioning. (15)
- Correction: Semantics of Context-Free Languages (15)
- The IBM 650: An Appreciation from the Field (14)
- Construction of a random sequence (14)
- Optimal prepaging and font caching (14)
- Recounting the Rationals, Continued: 10906 (14)
- A short proof of Darboux's lemma (14)
- A symmetrical Eulerian identity (14)
- InterviewDonald Knuth: A life's work interrupted (13)
- RUNCIBLE—algebraic translation on a limited computer (13)
- Concrete Mathematics: A Foundation for Computer Science. By Ronald Lewis (13)
- The texbook : computers and typesetting (13)
- Two-Way Rounding (13)
- Seminumerical algorithm (arithmetic) (12)
- Son of seminumerical algorithms (12)
- Selected Papers on Discrete Mathematics (12)
- Computer poker (12)
- Minimizing Drum Latency Time (11)
- Theory and Practice (10)
- Length of strings for a merge sort (10)
- Bitwise tricks & techniques, binary decision diagrams (10)
- Polynomials Involving the Floor Function. (9)
- Shellsort with three increments (9)
- Addition Machines (9)
- Efficient Coroutine Generation of Constrained Gray Sequences (9)
- The state of the Art of Computer Programming (9)
- 3:16 Bible Texts Illuminated (8)
- The Dangers of Computer-Science Theory (8)
- Typesetting Concrete Mathematics (8)
- Random matroids (8)
- Leaper graphs (8)
- Identities from Partition Involutions. (8)
- Selected Papers on Fun & Games (8)
- The complexity of songs (8)
- SMALGOL-61 (7)
- Elementary Problems: E3427-E3432 (7)
- The Computers & Typesetting, Vol. A: The Texbook (7)
- A Random Knockout Tournament (7)
- Lexicographic permutations with restrictions (7)
- Elementary Problems: E3301-E3306 (7)
- Bracket notation for the “coefficient of” operator (7)
- A Random Knockout Tournament (D. E. Knuth) (7)
- Mathematical circus : more puzzles, games, paradoxes, and other mathematical entertainments from Scientific American with a preface by Donald Knuth, a postscript, from the author, and a new bibliography by Mr. Gardner, thoughts from readers, and 105 drawings and diagrams (6)
- An Experiment in Optimal Sorting (6)
- Mathematics for the Analysis of Algorithms: Modern Birkhuser Classics (6)
- Selected Papers on Fun and Games (6)
- Context-Free Multilanguages (5)
- The Computer Modern family of typefaces (5)
- and Sums of Powers (5)
- Manipulation of Matrices Symbolically (5)
- Bottom-up education (4)
- A Web Service Architecture for Bidirectional XML Updating (4)
- Problems: 10585-10591 (4)
- Robert W Floyd, In Memoriam (4)
- Designing Software forEaseofExtension andContraction (4)
- Computer musings (videotape): the associative law, or the anatomy of rotations in binary trees (4)
- Algorithms in Modern Mathematics and Computer Science, Proceedings, Urgench, Uzbek SSR, USSR, September 16-22, 1979 (4)
- Invited papers: History of writing compilers (4)
- Errata: Notes on Avoiding "go to" Statements (4)
- InterviewThe 'art' of being Donald Knuth (3)
- Optimal Font Caching (3)
- Learning from our Errors (3)
- The Art of Programming, Vol. I: Fundamental Algorithms (3)
- Shellsort with three increments (3)
- Twenty questions for Donald Knuth (3)
- On the Lambert (3)
- Partitions of a Circular Set: 11151 (3)
- A Note on Digitized Angles (3)
- The Art of Computer Programming--Errata et Addenda (3)
- Serial Isogons of 90 Degrees (3)
- The letter S (3)
- Subtracting Square Roots Repeatedly: 10568 (3)
- A bijection for ordered factorizations (2)
- Elementary Problems: E2611-E2616 (2)
- A Stirling Series: 10832 (2)
- Very Magic Squares (2)
- Two Thousand Years of Combinatorics (2)
- Satisfiability and The Art of Computer Programming (2)
- Partitioned Tensor Products and Their Spectra (2)
- An algorithm for Brownian zeroes (2)
- Mathematical Vanity Plates (2)
- The Essential Knuth (2)
- A Reverse Card Shuffle (David Berman and M. S. Klamkin) (2)
- Selected Papers on Design of Algorithms (2)
- On the inversion of $y^\alpha e^y$ in terms of associated Stirling numbers (2)
- History of binary and other nondecimal numeration: By Anton Glaser. Los Angeles, CA (Tomash Publishers). 1981. 218 + xiii pp (2)
- Elementary Problems: E2635-E2640 (2)
- Comparison of indexing techniques (1)
- Bottom-up education (1)
- The Knowlton-Graham Partition Problem (1)
- Report of the ARPA Study Group on Advanced Memory Concepts (1)
- Permutations with nonnegative partial sums (1)
- A new typeface for mathematics (1)
- Algorithmic Barriers Falling: P=NP? (1)
- Sorting and Searching - errata and addenda. (1)
- Letters to the editor: three letters on merging (1)
- Using the Centinel Data Format to Decouple Data Creation from Data Processing in Scientific Programs (1)
- Negatively Correlated Vectors of Signs: 10593 (1)
- Some Bernstein Polynomials: 10985 (1)
- On a Convolution of Eulerian Numbers: 10609 (1)
- The Last Whole Errata Catalog (1)
- Problems: 10571-10577 (1)
- TEX and Linguistics (1)
- A Fibonacci-Lucas Extremum: 10825 (1)
- A torture test for METAFONT (1)
- Lessons Learned from Metafont (1)
- Just Give Me a Lollipop (It makes my heart go giddy-up) (1)
- Elementary Problems: E2980-E2985 (1)
- Let's not dumb down the history of computer science (1)
- Sums and Powers, Set Counting, and Coefficient Tracking: 11274 [2007, 165] (0)
- Why T E X? the Field of Linguistics (0)
- Representing Numbers Using Only One 4 (0)
- Introduction, definitions, and examples (0)
- Randomness in Music (0)
- Source Code Analysis and Slicing for Program Comprehension (0)
- 7.2 Hypercubic Networks (0)
- A Modular Triple: 11021 (0)
- Companion to the papers of Donald Knuth (0)
- CHAPTER 15 – The Bose-Nelson Sorting Problem† (0)
- The Complexity of Songs (April 1984 Special Section) (0)
- Searching a table by hashing; mean behavior of the fundamental algorithm (0)
- Peer-to-peer Computing 15.2 Architecture Variants (0)
- An Analysis of Alpha-Beta Priming ' (0)
- The Probability of Being in a State: 10726 (0)
- Implementing the fundamental algorithm (0)
- Theoretical developments: application to the shortest path (0)
- Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms (0)
- Deenition of an Indexing Model and Its Implementation (0)
- Elementary Problems: E3463-E3468 (0)
- Elementary Problems: E3409-E3414 (0)
- Book alert (0)
- Leaves of Ordered Trees: 10757 (0)
- N ov 2 00 0 Dancing Links (0)
- Highly Variable Lists: 10691 (0)
- Memorandum from Don Knuth to the [Stanford] Computer Science Department faculty (0)
- Minimal Special Matrices: 10470 (0)
- Oral history interview with Donald E. Knuth (0)
- An Algorithmic View of the Universe (0)
- Problem 11243 (0)
- Development of Moore ’ s Law (0)
- Selected Comb Inator Ial Research Problems (0)
- Products of Transpositions: 10913 (0)
- Min-Plus Matrix Multiplication: 10834 (0)
- The stanford graph base: a platform for combinational computing. (0)
- International Olympiad in Informatics: Roads to Algorithmic Thinking (0)
- Reversal by Swaps: 11264 [2007, 77] (0)
- Problem 10858 (0)
- 2 7 Ju l 1 99 2 Johann Faulhaber and Sums of Powers (0)
- Formal Methods in the World ( Draft ) ∗ Various authors June 23 , 2008 (0)
- Word-smithing is a much greater percentage of what I am supposed to be doing in life than I would ever have thought (0)
- Problems: 10564-10570 (0)
- AND C OMPVTER S CIENCE Proposal for Thesis Research in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy (0)
- Supplement 1 summaries of oral presentations (0)
- Accelerating Production of Cosmic Microwave Background Maps with Deflation Preconditioners (0)
- 5X5X5 Word Cubes By Computer (0)
- Special Section (0)
- N-Ciphered Texts (0)
- Meetings in Retrospect (0)
- remove x from the list; every programmer knows this. But comparatively few programmers have realized that the subsequent operations (0)
- Elementary Problems: E3105-E3110 (0)
- Model Article for the preprint style elsart (0)
- A Card-Matching Game: 10576 (0)
- Some combinatorial lemmas. (0)
- Database Scripting using Non-Java Languages (0)
- Exploring All Binary Mazes: 10720 (0)
- Practical Executable Specifications for Distributed Systems (0)
- Investigation of the interaction between the power electric circuit and power supply systems (0)
- Principle of deferred decisions: coupon collecting (0)
- Three Letters on Merging (0)
- The Real Numbers, Algebraically: 10689 (0)
- A Binomial Summation (Gengzhe Chang and Zun Shan) (0)
- Animals in a Cage: 10875 (0)
- The Optimal Binary Search Tree Recurrence : For 0 ≤ i (0)
- The Chinese Domino Challenge (0)
- Recommendations for Resolving Issues re [ rand ] , Version 2 Document (0)
- 3.3.4., The spectral test ; 3.4., Other tyes of random quantities; 3.5., What is a random sequence; 3.6., Summary (0)
- Advanced Problems: 5240,5261-5269 (0)
- A Hierarchid Associative Architecture for the Parallel Ekluation of Relational Algebraic Databme Primitives David Elliot Shaw Artificial Intelligence Laboratory (0)
- The Chinese Domino Challenge (0)
- C C ] 1 J an 1 99 0 Nested Satisfiability by (0)
- Tables of Tangent Numbers, Euler Numbers, and Bernoulli Numbers (0)
- Boundless Interests, A Common Thread (0)
- The TeX tuneup of 2021 (0)
- General information (0)
- Notes on \open" Addressing My First Analysis of an Algorithm, Originally (0)
- Advanced Problems: 6048-6053 (0)
- Development of current converters for switching and regulating tasks in energy technology (0)
- Problems: 10543-10549 (0)
- Chapter 13 Peer-to-Peer Computing (0)
- @bullet Using Definition 4.2 Sorting on a Star Graph Takes Linear Time. 4.1 Array & Mesh (0)
- A COMBINATORIAL IDENTITY FOR THE p-BINOMIAL COEFFICIENT BASED ON ABELIAN GROUPS (0)
- Etaoin Shrdlu Non-Crashing Sets (0)
- Proceedings on Algorithms in Modern Mathematics and Computer Science (0)
- selected papers from the third annual ACM-SIAM symposium on Discrete algorithms (0)
- Dot size control method for digital halftoning with multicellular threshold matrix (0)
- On the Lambert W Function (0)
- Demo of Aligator Loading the package (0)
- Supplement 5 photoillustrations (0)
- Supplement 3 publications on the symposium (0)
- Problem 11452 (0)
- Anne-Mattijs Kersten: How to Make Runtime Architectural Design Deci- (0)
- Progress in the Analysis of Algorithms at Sanford (0)
- Problems: 10396-10402 (0)
- Problems: 10274-10281 (0)
- Latin Square Word Puzzles (0)
- acmsmall Author Submission Guide: Setting Up Your L A T E X 2" Files (0)
- Near-deBruijn Cycles: 11336 [2008, 71] (0)
- Balanced Neighborhood Squares: 10871 (0)
- A Conversation with Don Knuth: Part I. (0)
- Perfect Parity Patterns: 11243 (0)
- Elementary Problems: E3307-E3312 (0)
- Solving a Recurrence by Binary Expansion: 11320 [2007, 835] (0)
- Backus' language (0)
- A an Alternative Private Protocol (0)
- Existence of a stable matching: the fundamental algorithm (0)
- Typeset by Helmut Prodinger November NOTES ON OPEN ADDRESSING MY FIRST ANALYSIS OF AN ALGORITHM ORIGINALLY DONE DURING SUMMER IN MADISON (0)
- Method and device scaling and conversion of numeration (0)
- The errata of computer programming (0)
- 7. Conclusion 3. Our Data Structure at Time I 2. Basic Data Structures (0)
- General information (0)
- Elementary Problems: E3265-E3268 (0)
- Mini-Indexes for Literate Programs (0)
- Elementary Problems: E3331-E3336 (0)
- Erratum: Evading the Drift in Floating-Point Addition (0)
- Elementary Problems: E3415-E3420 (0)
- Big Omicron and Big Omega and Big Theta (1976) (0)
- MIX/360 user''s guide (0)
- Advanced Problems: 6579-6582 (0)
- A Combinatorial Maximum: 11142 (0)
- Review of 'Introduction to Combinatorial Mathematics' (Liu, C. L.; 1968) (0)
- 21.2 Hypercubic Networks (0)
- Publishing Encycloppdia with Acrobat Using T E X (0)
- Formal Systems II : Applications (0)
- Problems: 10606-10612 (0)
- Some Experimental Results on Data Structure Compression (0)
- Some Experimental Results on Data Structure Compression (0)
- Typesetting and Layout in Multiple Directions — Proposed Solution (0)
- We Annotate Algorithm a with Complexities (0)
- Advantages of P 2 P Computing (0)
- Pelargonium Puzzle Revisited (0)
- A Parity Problem in Combinatorial Enumeration: 10546 (0)

This paper list is powered by the following services:

Donald Knuth is affiliated with the following schools:

Donald Knuth is most known for their academic work in the field of computer science. They are also known for their academic work in the fields of engineering, mathematics, and literature.

Donald Knuth has made the following academic contributions:

This website uses cookies to enhance the user experience. Privacy Policy

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