default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDonald E. Knuth
Donald Ervin Knuth
Person information
- affiliation: Stanford University, Computer Science Department, CA, USA
- award (1974): Turing Award
- award (2010): BBVA Foundation Frontiers of Knowledge Award
- award (1995): IEEE John von Neumann Medal
- award (1986): ACM Software System Award
- award (1980): W. Wallace McDowell Award
- award (1979): National Medal of Science
- award (1971): Grace Murray Hopper Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[c16]Donald E. Knuth:
All Questions Answered (Invited Talk). CP 2022: 1:1-1:1- 2021
- [j138]Donald E. Knuth, Len Shustek:
Let's not dumb down the history of computer science. Commun. ACM 64(2): 33-35 (2021)
2010 – 2019
- 2012
- [b29]Donald E. Knuth:
Companion to the papers of Donald Knuth. CSLI lecture notes series 202, Cambridge University Press 2012, ISBN 978-1-57586-634-5, pp. I-XIII, 1-441 - [c15]Christos H. Papadimitriou, Leonard M. Adleman, Richard M. Karp, Donald E. Knuth, Robert E. Tarjan, Leslie G. Valiant:
An Algorithmic View of the Universe. ACM-TURING 2012: 13:1 - [c14]Donald E. Knuth:
Satisfiability and The Art of Computer Programming. SAT 2012: 15 - 2011
- [b28]Donald E. Knuth:
Selected Papers on Fun and Games. CSLI lecture notes series 192, Cambridge University Press 2011, ISBN 978-1-57586-584-3, pp. I-XVII, 1-741 - 2010
- [b27]Donald E. Knuth:
Selected Papers on Design of Algorithms. CSLI lecture notes series 191, Cambridge University Press 2010, ISBN 978-1-57586-582-9, pp. I-XIII, 1-441
2000 – 2009
- 2009
- [j137]Donald E. Knuth, Richard Stong:
Reversal by Swaps: 11264 [2007, 77]. Am. Math. Mon. 116(3): 277-278 (2009) - [j136]Donald E. Knuth, Julian L. Hook:
Sums and Powers, Set Counting, and Coefficient Tracking: 11274 [2007, 165]. Am. Math. Mon. 116(6): 548-549 (2009) - [j135]Donald E. Knuth:
Problem 11452. Am. Math. Mon. 116(7): 648 (2009) - [j134]Donald E. Knuth, O. P. Lossers:
Solving a Recurrence by Binary Expansion: 11320 [2007, 835]. Am. Math. Mon. 116(7): 649 (2009) - [j133]Donald E. Knuth, et al.:
Near-deBruijn Cycles: 11336 [2008, 71]. Am. Math. Mon. 116(9): 848-849 (2009) - 2008
- [j132]Donald E. Knuth:
Problem 11336. Am. Math. Mon. 115(1): 71 (2008) - [j131]Donald E. Knuth:
Problem 11369. Am. Math. Mon. 115(6): 567 (2008) - [j130]Donald E. Knuth, Robin Chapman, Reiner Martin:
Perfect Parity Patterns: 11243. Am. Math. Mon. 115(7): 668-670 (2008) - 2007
- [j129]Donald E. Knuth:
Problem 11264. Am. Math. Mon. 114(1): 77 (2007) - [j128]Donald E. Knuth:
Problem 11274. Am. Math. Mon. 114(2): 165 (2007) - [j127]Donald E. Knuth, O. P. Lossers:
Partitions of a Circular Set: 11151. Am. Math. Mon. 114(3): 265-266 (2007) - [j126]Donald E. Knuth, Roberto Tauraso:
A Combinatorial Maximum: 11142. Am. Math. Mon. 114(4): 361-362 (2007) - [j125]Donald E. Knuth:
Problem 11320. Am. Math. Mon. 114(9): 835 (2007) - 2006
- [j124]Donald E. Knuth, Robin Chapman:
Cube-Free Sums: 11078. Am. Math. Mon. 113(4): 368-369 (2006) - [j123]Donald E. Knuth:
Problem 11243. Am. Math. Mon. 113(8): 759 (2006) - 2005
- [j122]Donald E. Knuth:
Problem 11142. Am. Math. Mon. 112(3): 273-274 (2005) - [j121]Donald E. Knuth, Silvia Fernández, Gerry Myerson:
A Modular Triple: 11021. Am. Math. Mon. 112(3): 279-280 (2005) - [j120]Donald E. Knuth:
Problem 11151. Am. Math. Mon. 112(4): 367 (2005) - 2004
- [j119]Donald E. Knuth, Robin Chapman:
Fibonacci in Complex Camouflage: 10858. Am. Math. Mon. 111(2): 166-167 (2004) - [j118]Donald E. Knuth:
Problem 11078. Am. Math. Mon. 111(4): 361 (2004) - [j117]Donald E. Knuth, et al.:
Some Bernstein Polynomials: 10985. Am. Math. Mon. 111(5): 447 (2004) - [c13]Donald E. Knuth, Frank Ruskey
:
Efficient Coroutine Generation of Constrained Gray Sequences. Essays in Memory of Ole-Johan Dahl 2004: 183-208 - 2003
- [b26]Donald E. Knuth:
Selected papers on computer languages. CSLI lecture notes series 139, CSLI Publications 2003, ISBN 978-1-57586-382-5, pp. I-XVI, 1-594 - [j116]Donald E. Knuth:
Robert W Floyd, In Memoriam. SIGACT News 34(4): 3-13 (2003) - [j115]Donald E. Knuth:
Problem 10985. Am. Math. Mon. 110(1): 58 (2003) - [j114]Donald E. Knuth, Allan Pedersen:
Highly Variable Lists: 10691. Am. Math. Mon. 110(1): 59-60 (2003) - [j113]Donald E. Knuth, O. P. Lossers:
Exploring All Binary Mazes: 10720. Am. Math. Mon. 110(1): 60-61 (2003) - [j112]Donald E. Knuth, Gabriel D. Carroll:
Balanced Neighborhood Squares: 10871. Am. Math. Mon. 110(2): 161-162 (2003) - [j111]Donald E. Knuth, Richard Stong:
Animals in a Cage: 10875. Am. Math. Mon. 110(3): 243-245 (2003) - [j110]Donald E. Knuth, C. P. Rupert, Alex Smith, Richard Stong:
Recounting the Rationals, Continued: 10906. Am. Math. Mon. 110(7): 642-643 (2003) - [j109]Donald E. Knuth, Reiner Martin:
Products of Transpositions: 10913. Am. Math. Mon. 110(9): 844-845 (2003) - [c12]Donald E. Knuth:
Bottom-up education. ITiCSE 2003: 2 - 2002
- [j108]Sung Soo Kim, Richard Johnsonbaugh, Ronald E. Prather, Donald E. Knuth:
Min-Plus Matrix Multiplication: 10834. Am. Math. Mon. 109(7): 667-668 (2002) - [j107]Carl Miller, Donald E. Knuth:
A Fibonacci-Lucas Extremum: 10825. Am. Math. Mon. 109(8): 762-763 (2002) - [j106]Sung Soo Kim, Richard Johnsonbaugh, Ronald E. Prather, Donald E. Knuth:
Min-Plus Matrix Multiplication: 10834. Am. Math. Mon. 109(8): 763-764 (2002) - 2001
- [b25]Donald E. Knuth:
Arithmetik. Springer 2001, ISBN 978-3-540-66745-2, pp. I-XIII, 1-538 - [j105]Donald E. Knuth:
Problem 10858. Am. Math. Mon. 108(3): 271 (2001) - [j104]Donald E. Knuth:
Problem 10871. Am. Math. Mon. 108(4): 372 (2001) - [j103]Donald E. Knuth:
Problem 10875. Am. Math. Mon. 108(5): 469 (2001) - [j102]Donald E. Knuth:
Problem 10906. Am. Math. Mon. 108(9): 872 (2001) - [j101]Mark E. Kidwell, Donald E. Knuth, O. P. Lossers:
Leaves of Ordered Trees: 10757. Am. Math. Mon. 108(9): 874-875 (2001) - [j100]Donald E. Knuth, Cecil C. Rousseau:
A Stirling Series: 10832. Am. Math. Mon. 108(9): 877-878 (2001) - [j99]Donald E. Knuth:
Problem 10913. Am. Math. Mon. 108(10): 977 (2001) - [c11]Donald E. Knuth:
The Joys of the Asymptotics. HERCMA 2001: 1 - 2000
- [b24]Donald E. Knuth:
Selected papers on analysis of algorithms. CSLI lecture notes series 102, CSLI Publications 2000, ISBN 978-1-57586-212-5, pp. I-XVI, 1-621 - [j98]Donald E. Knuth, Darin Stephenson:
The Probability of Being in a State: 10726. Am. Math. Mon. 107(5): 469-470 (2000) - [j97]Donald E. Knuth, Vaughan R. Pratt, O. P. Lossers:
The Real Numbers, Algebraically: 10689. Am. Math. Mon. 107(8): 755 (2000) - [j96]Donald E. Knuth:
Problem 10832. Am. Math. Mon. 107(9): 863 (2000)
1990 – 1999
- 1999
- [b23]Donald E. Knuth:
Digital typography. CSLI lecture notes series 78, Cambridge University Press 1999, ISBN 978-1-57586-011-4, pp. I-XV, 1-685 - [b22]Donald E. Knuth:
MMIXware, A RISC Computer for the Third Millennium. Lecture Notes in Computer Science 1750, Springer 1999, ISBN 3-540-66938-8 - 1998
- [b21]Donald Ervin Knuth:
The art of computer programming, Volume II: Seminumerical Algorithms, 3rd Edition. Addison-Wesley 1998, ISBN 0201896842, pp. I-XIII, 1-762 - [b20]Donald Ervin Knuth:
The art of computer programming, , Volume III, 2nd Edition. Addison-Wesley 1998, ISBN 0201896850, pp. I-XIII, 1-780 - [j95]Donald E. Knuth:
Linear Probing and Graphs. Algorithmica 22(4): 561-568 (1998) - 1997
- [b19]Donald Ervin Knuth:
The art of computer programming, Volume I: Fundamental Algorithms, 3rd Edition. Addison-Wesley 1997, ISBN 0201896834, pp. I-XIX, 1-650 - [j94]Svante Janson, Donald E. Knuth:
Shellsort with three increments. Random Struct. Algorithms 10(1-2): 125-142 (1997) - [c10]Robert M. Corless, David J. Jeffrey, Donald E. Knuth:
A Sequence of Series for the Lambert W Function. ISSAC 1997: 197-204 - 1996
- [b18]Donald E. Knuth:
Selected papers on computer science. CSLI lecture notes series 59, CSLI 1996, ISBN 978-1-881526-92-6, pp. I-XII, 1-274 - [j93]Robert M. Corless, Gaston H. Gonnet, D. E. G. Hare, David J. Jeffrey, Donald E. Knuth:
On the LambertW function. Adv. Comput. Math. 5(1): 329-359 (1996) - [j92]Donald E. Knuth:
Overlapping Pfaffians. Electron. J. Comb. 3(2) (1996) - [j91]Donald E. Knuth:
An Exact Analysis of Stable Allocation. J. Algorithms 20(2): 431-442 (1996) - [j90]Donald E. Knuth:
The Knowlton-Graham Partition Problem. J. Comb. Theory A 73(1): 185-189 (1996) - [j89]Donald E. Knuth:
Irredundant Intervals. ACM J. Exp. Algorithmics 1: 1 (1996) - 1995
- [j88]Donald E. Knuth:
Two-Way Rounding. SIAM J. Discret. Math. 8(2): 281-290 (1995) - 1994
- [b17]Ronald L. Graham, Donald E. Knuth, Oren Patashnik:
Concrete Mathematics: A Foundation for Computer Science, 2nd Ed. Addison-Wesley 1994, ISBN 0-201-55802-5 - [b16]Donald E. Knuth, Silvio Levy:
The CWEB system of structured documentation - version 3.0. Addison-Wesley 1994, ISBN 978-0-201-57569-9, pp. 1-226 - [b15]Ronald L. Graham, Donald E. Knuth, Oren Patashnik:
Concrete mathematics - a foundation for computer science (2. ed.). Addison-Wesley 1994, ISBN 978-0-201-55802-9, pp. I-XIII, 1-657 - [j87]Donald E. Knuth:
The Sandwich Theorem. Electron. J. Comb. 1 (1994) - [j86]Donald E. Knuth:
Mini-Indexes for Literate Programs. Softw. Concepts Tools 15(1): 2-11 (1994) - 1993
- [b14]Donald E. Knuth:
The Stanford GraphBase - a platform for combinatorial computing. ACM 1993, ISBN 978-0-201-54275-2, pp. I-VII, 1-576 - [j85]Svante Janson, Donald E. Knuth, Tomasz Luczak, Boris G. Pittel:
The Birth of the Giant Component. Random Struct. Algorithms 4(3): 233-359 (1993) - [c9]Donald E. Knuth:
The Stanford GraphBase: A Platform for Combinatorial Algorithms. SODA 1993: 41-43 - 1992
- [b13]Donald E. Knuth:
Literate programming. CSLI lecture notes series 27, Center for the Study of Language and Information 1992, ISBN 978-0-937073-81-0, pp. I-XV, 1-368 - [b12]Donald E. Knuth:
Axioms and Hulls. Lecture Notes in Computer Science 606, Springer 1992, ISBN 3-540-55611-7 - [j84]Leonidas J. Guibas, Donald E. Knuth, Micha Sharir:
Randomized Incremental Construction of Delaunay and Voronoi Diagrams. Algorithmica 7(4): 381-413 (1992) - [j83]Donald E. Knuth, Arvind Raghunathan:
The Problem of Compatible Representatives. SIAM J. Discret. Math. 5(3): 422-427 (1992) - [c8]Donald E. Knuth:
Context-Free Multilanguages. Theoretical Studies in Computer Science 1992: 1-13 - 1991
- [j82]Donald E. Knuth:
Efficient representation of perm groups. Comb. 11(1): 33-43 (1991) - [j81]Donald E. Knuth:
Theory and Practice. Theor. Comput. Sci. 90(1): 1-15 (1991) - [c7]Donald E. Knuth:
Textbook Examples of Recursion. Artificial and Mathematical Theory of Computation 1991: 207-229 - 1990
- [j80]Donald E. Knuth:
Nested Satisfiability. Acta Informatica 28(1): 1-6 (1990) - [j79]Donald E. Knuth:
A Note on Digitized Angles. Electron. Publ. 3(2): 99-104 (1990) - [j78]Richard Garfield, Donald E. Knuth, Herbert S. Wilf:
A bijection for ordered factorizations. J. Comb. Theory A 54(2): 317-318 (1990) - [j77]Donald E. Knuth, Rajeev Motwani, Boris G. Pittel:
Stable Husbands. Random Struct. Algorithms 1(1): 1-14 (1990) - [j76]Robert W. Floyd, Donald E. Knuth:
Addition Machines. SIAM J. Comput. 19(2): 329-340 (1990) - [c6]Leonidas J. Guibas, Donald E. Knuth, Micha Sharir:
Randomized Incremental Construction of Delaunay and Voronoi Diagrams. ICALP 1990: 414-431 - [c5]Donald E. Knuth, Rajeev Motwani, Boris G. Pittel:
Stable Husbands. SODA 1990: 397-404 - [c4]Donald E. Knuth:
The Genesis of Attribute Grammars. WAGA 1990: 1-12
1980 – 1989
- 1989
- [b11]Donald E. Knuth, Tracy Larrabee, Paul M. Roberts:
Mathematical Writing. MAA notes 14, Mathematical Association of America 1989, ISBN 978-0-88385-063-3, pp. 1-115 - [b10]Ronald L. Graham, Donald E. Knuth, Oren Patashnik:
Concrete mathematics - a foundation for computer science. Addison-Wesley 1989, ISBN 978-0-201-14236-5, pp. I-XIII, 1-623 - [j75]Philippe Flajolet, Donald E. Knuth, Boris G. Pittel:
The first cycles in an evolving graph. Discret. Math. 75(1-3): 167-215 (1989) - [j74]Donald E. Knuth:
The Errors of TEX. Softw. Pract. Exp. 19(7): 607-685 (1989) - 1987
- [j73]Donald E. Knuth:
Digital Halftones by Dot Diffusion. ACM Trans. Graph. 6(4): 245-273 (1987) - 1986
- [b9]Donald E. Knuth:
The TeXbook. Addison-Wesley 1986, ISBN 0-201-13447-0 - [b8]Donald E. Knuth:
TeX: The Program. Addison-Wesley 1986, ISBN 0-201-13437-3 - [b7]Donald Ervin Knuth:
The METAFONTbook. Addison-Wesley 1986, ISBN 0201134446, pp. I-XI, 1-361 - [b6]Donald Ervin Knuth:
Computer modern typefaces. Addison-Wesley 1986, ISBN 0201134462, pp. I-XV, 1-588 - [j72]Donald E. Knuth:
The IBM 650: An Appreciation from the Field. IEEE Ann. Hist. Comput. 8(1): 50-55 (1986) - [j71]Donald E. Knuth:
Efficient balanced codes. IEEE Trans. Inf. Theory 32(1): 51-53 (1986) - 1985
- [j70]Donald E. Knuth:
Dynamic Huffman Coding. J. Algorithms 6(2): 163-180 (1985) - [j69]Donald E. Knuth:
An Analysis of Optimum Caching. J. Algorithms 6(2): 181-199 (1985) - [j68]Donald E. Knuth:
Deciphering a linear congruential encryption. IEEE Trans. Inf. Theory 31(1): 49-52 (1985) - [j67]David R. Fuchs, Donald E. Knuth:
Optimal Prepaging and Font Caching. ACM Trans. Program. Lang. Syst. 7(1): 62-79 (1985) - 1984
- [j66]Donald E. Knuth:
The Complexity of Songs (April 1984 Special Section). Commun. ACM 27(4): 344-348 (1984) - [j65]Donald E. Knuth:
Literate Programming. Comput. J. 27(2): 97-111 (1984) - [j64]Donald E. Knuth:
An algorithm for Brownian zeroes. Computing 33(1): 89-94 (1984) - 1982
- [j63]Donald E. Knuth:
Huffman's Algorithm via Algebra. J. Comb. Theory A 32(2): 216-224 (1982) - 1981
- [b5]Donald E. Knuth:
The Art of Computer Programming, Volume II: Seminumerical Algorithms, 2nd Edition. Addison-Wesley 1981, ISBN 0-201-03822-6 - [j62]Donald E. Knuth:
Verification of Link-Level Protocols. BIT 21(1): 31-36 (1981) - [j61]Donald E. Knuth, Michael F. Plass:
Breaking Paragraphs into Lines. Softw. Pract. Exp. 11(11): 1119-1184 (1981) - [e1]Andrei P. Ershov, Donald E. Knuth:
Algorithms in Modern Mathematics and Computer Science, Proceedings, Urgench, Uzbek SSR, USSR, September 16-22, 1979. Lecture Notes in Computer Science 122, Springer 1981, ISBN 3-540-11157-3 [contents]
1970 – 1979
- 1979
- [j60]Donald E. Knuth:
Lexicographic permutations with restrictions. Discret. Appl. Math. 1(1-2): 117-125 (1979) - [j59]A. V. Anisimov, Donald E. Knuth:
Inhomogeneous sorting. Int. J. Parallel Program. 8(4): 255-260 (1979) - [c3]Donald E. Knuth:
Algorithms in modern mathematics and computer science. Algorithms in Modern Mathematics and Computer Science 1979: 82-99 - 1978
- [j58]Arne T. Jonassen, Donald E. Knuth:
A Trivial Algorithm Whose Analysis Isn't. J. Comput. Syst. Sci. 16(3): 301-322 (1978) - [j57]Donald E. Knuth, Arnold Schönhage:
The Expected Linearity of a Simple Equivalence Algorithm. Theor. Comput. Sci. 6: 281-315 (1978) - 1977
- [j56]Donald E. Knuth:
A Generalization of Dijkstra's Algorithm. Inf. Process. Lett. 6(1): 1-5 (1977) - [j55]Donald E. Knuth, James H. Morris Jr., Vaughan R. Pratt:
Fast Pattern Matching in Strings. SIAM J. Comput. 6(2): 323-350 (1977) - [j54]Donald E. Knuth:
The complexity of songs. SIGACT News 9(2): 17-24 (1977) - [j53]Donald E. Knuth:
Deletions That Preserve Randomness. IEEE Trans. Software Eng. 3(5): 351-359 (1977) - 1976
- [j52]Andrew Chi-Chih Yao, Donald E. Knuth:
Analysis of the subtractive algorithm for greatest common divisors. SIGSAM Bull. 10(2): 9-13 (1976) - [j51]Donald E. Knuth:
Big Omicron and big Omega and big Theta. SIGACT News 8(2): 18-24 (1976) - [j50]Donald E. Knuth, Luis Trabb Pardo:
Analysis of a Simple Factorization Algorithm. Theor. Comput. Sci. 3(3): 321-348 (1976) - 1975
- [j49]Donald E. Knuth, Ronald W. Moore:
An Analysis of Alpha-Beta Pruning. Artif. Intell. 6(4): 293-326 (1975) - [j48]Donald E. Knuth:
Son of seminumerical algorithms. SIGSAM Bull. 9(4): 10-11 (1975) - [j47]Donald E. Knuth:
Random matroids. Discret. Math. 12(4): 341-358 (1975) - [j46]John F. Reiser, Donald E. Knuth:
Evading the Drift in Floating-Point Addition. Inf. Process. Lett. 3(3): 84-87 (1975) - [j45]John F. Reiser, Donald E. Knuth:
Erratum: Evading the Drift in Floating-Point Addition. Inf. Process. Lett. 3(5): 164 (1975) - [j44]Donald E. Knuth, Gururaj S. Rao:
Activity in an Interleaved Memory. IEEE Trans. Computers 24(9): 943-944 (1975) - 1974
- [j43]Donald E. Knuth:
Computer Programming as an Art. Commun. ACM 17(12): 667-673 (1974) - [j42]Ole Amble, Donald E. Knuth:
Ordered Hash Tables. Comput. J. 17(2): 135-142 (1974) - [j41]Donald E. Knuth:
Structured Programming with go to Statements. ACM Comput. Surv. 6(4): 261-301 (1974) - [j40]Donald E. Knuth, Jayme Luiz Szwarcfiter:
A Structured Program to Generate all Topological Sorting Arrangements. Inf. Process. Lett. 2(6): 153-157 (1974) - [j39]Donald E. Knuth, Jayme Luiz Szwarcfiter:
Erratum: A Structured Program to Generate all Topological Sorting Arrangements. Inf. Process. Lett. 3(2): 64 (1974) - [j38]Donald E. Knuth:
The Asymptotic Number of Geometries. J. Comb. Theory A 16(3): 398-400 (1974) - [j37]Donald E. Knuth:
A terminological proposal. SIGACT News 6(1): 12-18 (1974) - [j36]Donald E. Knuth:
Postscript about NP-hard problems. SIGACT News 6(2): 15-16 (1974) - 1973
- [b4]Donald E. Knuth:
The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X - [b3]Donald E. Knuth:
The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition. Addison-Wesley 1973, ISBN 0201038218, pp. I-XXI, 1-634 - [j35]Donald E. Knuth:
Permutations with nonnegative partial sums. Discret. Math. 5(4): 367-371 (1973) - 1972
- [j34]Donald E. Knuth:
Ancient Babylonian Algorithms. Commun. ACM 15(7): 671-677 (1972) - [j33]Donald E. Knuth:
George Forsythe and the Development of Computer Science. Commun. ACM 15(8): 721-726 (1972) - [j32]Ronald L. Graham, Donald E. Knuth, Theodore S. Motzkin:
Complements and transitive closures. Discret. Math. 2(1): 17-29 (1972) - [j31]Donald E. Knuth, E. B. Kaehler:
An Experiment in Optimal Sorting. Inf. Process. Lett. 1(4): 173-176 (1972) - [j30]Donald E. Knuth, Robert W. Floyd:
Errata: Notes on Avoiding "go to" Statements. Inf. Process. Lett. 1(4): 177 (1972) - [j29]Edward A. Bender, Donald E. Knuth:
Enumeration of Plane Partitions. J. Comb. Theory A 13(1): 40-54 (1972) - 1971
- [j28]Donald E. Knuth:
Optimum Binary Search Trees. Acta Informatica 1: 14-25 (1971) - [j27]Donald E. Knuth:
Top-Down Syntax Analysis. Acta Informatica 1: 79-110 (1971) - [j26]Donald E. Knuth, Robert W. Floyd:
Notes on Avoiding "go to" Statements. Inf. Process. Lett. 1(1): 23-31 (1971) - [j25]Donald E. Knuth:
Correction: Semantics of Context-Free Languages. Math. Syst. Theory 5(1): 95-96 (1971) - [j24]Donald E. Knuth:
An Empirical Study of FORTRAN Programs. Softw. Pract. Exp. 1(2): 105-133 (1971) - [j23]Donald E. Knuth:
Review of 'Introduction to Combinatorial Mathematics' (Liu, C. L.; 1968). IEEE Trans. Inf. Theory 17(1): 119-120 (1971) - [c2]Donald E. Knuth:
Mathematical Analysis of Algorithms. IFIP Congress (1) 1971: 19-27 - [p1]Donald E. Knuth:
Examples of formal semantics. Symposium on Semantics of Algorithmic Languages 1971: 212-235 - 1970
- [j22]Donald E. Knuth:
Von Neumann's First Computer Program. ACM Comput. Surv. 2(4): 247-260 (1970)
1960 – 1969
- 1969
- [b2]Donald E. Knuth:
The Art of Computer Programming, Volume II: Seminumerical Algorithms. Addison-Wesley 1969, ISBN 0201038021, pp. I-XI, 1-624 - 1968
- [b1]Donald E. Knuth:
The Art of Computer Programming, Volume I: Fundamental Algorithms. Addison-Wesley 1968 - [j21]Donald E. Knuth:
Semantics of Context-Free Languages. Math. Syst. Theory 2(2): 127-145 (1968) - 1967
- [j20]Donald E. Knuth:
The remaining trouble spots in ALGOL 60. Commun. ACM 10(10): 611-618 (1967) - [j19]Donald E. Knuth:
A Characterization of Parenthesis Languages. Inf. Control. 11(3): 269-289 (1967) - [j18]Donald E. Knuth, Richard H. Bigelow:
Programming Language for Automata. J. ACM 14(4): 615-635 (1967) - 1966
- [j17]Donald E. Knuth:
Additional comments on a problem in concurrent programming control. Commun. ACM 9(5): 321-322 (1966) - 1965
- [j16]Donald E. Knuth:
On the Translation of Languages from Left to Right. Inf. Control. 8(6): 607-639 (1965) - 1964
- [j15]Donald E. Knuth:
A proposal for input-output conventions in ALGOL 60. Commun. ACM 7(5): 273-283 (1964) - [j14]Donald E. Knuth:
backus normal form vs. Backus Naur form. Commun. ACM 7(12): 735-736 (1964) - [j13]Donald E. Knuth, J. L. McNeley:
SOLߞA Symbolic Language for General-Purpose Systems Simulation. IEEE Trans. Electron. Comput. 13(4): 401-408 (1964) - [j12]Donald E. Knuth, J. L. McNeley:
A Formal Definition of SOL. IEEE Trans. Electron. Comput. 13(4): 409-414 (1964) - 1963
- [j11]Donald E. Knuth:
Computer-drawn flowcharts. Commun. ACM 6(9): 555-563 (1963) - [j10]Donald E. Knuth, Martin A. Goetz:
Letters to the editor: three letters on merging. Commun. ACM 6(10): 585 (1963) - [j9]Donald E. Knuth:
Length of strings for a merge sort. Commun. ACM 6(11): 685-688 (1963) - 1962
- [j8]Donald E. Knuth, Saul Gorn:
Backus' language. Commun. ACM 5(4): 185 (1962) - [j7]Donald E. Knuth:
The calculation of Easter. Commun. ACM 5(4): 209-210 (1962) - [j6]Donald E. Knuth:
Evaluation of polynomials by computer. Commun. ACM 5(12): 595-599 (1962) - [c1]Donald E. Knuth:
Invited papers: History of writing compilers. ACM National Conference 1962: 43 - 1961
- [j5]Donald E. Knuth, Jack N. Merner:
ALGOL 60 confidential. Commun. ACM 4(6): 268-272 (1961) - [j4]Gilbert A. Bachelor, Donald E. Knuth, J. R. H. Dempster, Joseph Speroni:
SMALGOL-61. Commun. ACM 4(11): 499-502 (1961) - [j3]Donald E. Knuth:
Minimizing Drum Latency Time. J. ACM 8(2): 119-150 (1961) - 1960
- [j2]Donald E. Knuth:
An Imaginary Number System. Commun. ACM 3(4): 245-247 (1960)
1950 – 1959
- 1959
- [j1]Donald E. Knuth:
RUNCIBLE-Algebraic Translation on a Limited Computer. Commun. ACM 2(11): 18-21 (1959)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
