#149

Most Influential Person

American computer scientist, (1938 - ), Wisconsin

**Areas of Specialization: Computer Programming, Analysis of Algorithms**

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

Subscribe To Newsletter?Yes!