| 2004 |
|---|
| 100 | EE | Donald E. Knuth,
Frank Ruskey:
Efficient Coroutine Generation of Constrained Gray Sequences.
Essays in Memory of Ole-Johan Dahl 2004: 183-208 |
| 2003 |
|---|
| 99 | EE | Donald E. Knuth:
Bottom-up education.
ITiCSE 2003: 2 |
| 2001 |
|---|
| 98 | | Donald E. Knuth:
The Joys of the Asymptotics.
HERCMA 2001: 1 |
| 1999 |
|---|
| 97 | | Donald E. Knuth:
MMIXware, A RISC Computer for the Third Millennium
Springer 1999 |
| 1998 |
|---|
| 96 | EE | Donald E. Knuth:
Linear Probing and Graphs.
Algorithmica 22(4): 561-568 (1998) |
| 1997 |
|---|
| 95 | | Robert M. Corless,
David J. Jeffrey,
Donald E. Knuth:
A Sequence of Series for the Lambert W Function.
ISSAC 1997: 197-204 |
| 94 | | Svante Janson,
Donald E. Knuth:
Shellsort with three increments.
Random Struct. Algorithms 10(1-2): 125-142 (1997) |
| 1996 |
|---|
| 93 | EE | Donald E. Knuth:
Irredundant Intervals.
ACM Journal of Experimental Algorithmics 1: 1 (1996) |
| 92 | EE | 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) |
| 91 | EE | Donald E. Knuth:
Overlapping Pfaffians.
Electr. J. Comb. 3(2): (1996) |
| 90 | | Donald E. Knuth:
An Exact Analysis of Stable Allocation.
J. Algorithms 20(2): 431-442 (1996) |
| 89 | EE | Donald E. Knuth:
The Knowlton-Graham Partition Problem.
J. Comb. Theory, Ser. A 73(1): 185-189 (1996) |
| 1995 |
|---|
| 88 | EE | Donald E. Knuth:
Two-Way Rounding.
SIAM J. Discrete Math. 8(2): 281-290 (1995) |
| 1994 |
|---|
| 87 | EE | Donald E. Knuth:
The Sandwich Theorem.
Electr. J. Comb. 1: (1994) |
| 86 | | Donald E. Knuth:
Mini-Indexes for Literate Programs.
Software - Concepts and Tools 15(1): 2-11 (1994) |
| 1993 |
|---|
| 85 | | Donald E. Knuth:
The Stanford GraphBase: A Platform for Combinatorial Algorithms.
SODA 1993: 41-43 |
| 84 | | Svante Janson,
Donald E. Knuth,
Tomasz Luczak,
Boris Pittel:
The Birth of the Giant Component.
Random Struct. Algorithms 4(3): 233-359 (1993) |
| 1992 |
|---|
| 83 | | Donald E. Knuth:
Axioms and Hulls
Springer 1992 |
| 82 | | Donald E. Knuth:
Context-Free Multilanguages.
Theoretical Studies in Computer Science 1992: 1-13 |
| 81 | | Leonidas J. Guibas,
Donald E. Knuth,
Micha Sharir:
Randomized Incremental Construction of Delaunay and Voronoi Diagrams.
Algorithmica 7(4): 381-413 (1992) |
| 80 | | Donald E. Knuth,
Arvind Raghunathan:
The Problem of Compatible Representatives.
SIAM J. Discrete Math. 5(3): 422-427 (1992) |
| 1991 |
|---|
| 79 | | Donald E. Knuth:
Efficient representation of perm groups.
Combinatorica 11(1): 33-43 (1991) |
| 78 | | Donald E. Knuth:
Theory and Practice.
Theor. Comput. Sci. 90(1): 1-15 (1991) |
| 1990 |
|---|
| 77 | | Leonidas J. Guibas,
Donald E. Knuth,
Micha Sharir:
Randomized Incremental Construction of Delaunay and Voronoi Diagrams.
ICALP 1990: 414-431 |
| 76 | | Donald E. Knuth,
Rajeev Motwani,
Boris Pittel:
Stable Husbands.
SODA 1990: 397-404 |
| 75 | | Donald E. Knuth:
The Genesis of Attribute Grammars.
WAGA 1990: 1-12 |
| 74 | | Donald E. Knuth:
Nested Satisfiability.
Acta Inf. 28(1): 1-6 (1990) |
| 73 | | Donald E. Knuth:
A Note on Digitized Angles.
Electronic Publishing 3(2): 99-104 (1990) |
| 72 | EE | Richard Garfield,
Donald E. Knuth,
Herbert S. Wilf:
A bijection for ordered factorizations.
J. Comb. Theory, Ser. A 54(2): 317-318 (1990) |
| 71 | | Donald E. Knuth,
Rajeev Motwani,
Boris Pittel:
Stable Husbands.
Random Struct. Algorithms 1(1): 1-14 (1990) |
| 70 | | Robert W. Floyd,
Donald E. Knuth:
Addition Machines.
SIAM J. Comput. 19(2): 329-340 (1990) |
| 1989 |
|---|
| 69 | EE | Philippe Flajolet,
Donald E. Knuth,
Boris Pittel:
The first cycles in an evolving graph.
Discrete Mathematics 75(1-3): 167-215 (1989) |
| 68 | | Donald E. Knuth:
The Errors of TEX.
Softw., Pract. Exper. 19(7): 607-685 (1989) |
| 1987 |
|---|
| 67 | EE | Donald E. Knuth:
Digital Halftones by Dot Diffusion.
ACM Trans. Graph. 6(4): 245-273 (1987) |
| 1986 |
|---|
| 66 | | Donald E. Knuth:
TeX: The Program
Addison-Wesley 1986 |
| 65 | | Donald E. Knuth:
The TeXbook
Addison-Wesley 1986 |
| 64 | | Donald E. Knuth:
Efficient balanced codes.
IEEE Transactions on Information Theory 32(1): 51-53 (1986) |
| 1985 |
|---|
| 63 | EE | David R. Fuchs,
Donald E. Knuth:
Optimal Prepaging and Font Caching.
ACM Trans. Program. Lang. Syst. 7(1): 62-79 (1985) |
| 62 | | Donald E. Knuth:
Deciphering a linear congruential encryption.
IEEE Transactions on Information Theory 31(1): 49-52 (1985) |
| 61 | | Donald E. Knuth:
Dynamic Huffman Coding.
J. Algorithms 6(2): 163-180 (1985) |
| 60 | | Donald E. Knuth:
An Analysis of Optimum Caching.
J. Algorithms 6(2): 181-199 (1985) |
| 1984 |
|---|
| 59 | | Donald E. Knuth:
The Complexity of Songs (April 1984 Special Section).
Commun. ACM 27(4): 344-348 (1984) |
| 58 | | Donald E. Knuth:
Literate Programming.
Comput. J. 27(2): 97-111 (1984) |
| 1982 |
|---|
| 57 | | Donald E. Knuth:
Huffman's Algorithm via Algebra.
J. Comb. Theory, Ser. A 32(2): 216-224 (1982) |
| 1981 |
|---|
| 56 | | Donald E. Knuth:
The Art of Computer Programming, Volume II: Seminumerical Algorithms, 2nd Edition
Addison-Wesley 1981 |
| 55 | | Andrei P. Ershov,
Donald E. Knuth:
Algorithms in Modern Mathematics and Computer Science, Proceedings, Urgench, Uzbek SSR, September 16-22, 1979
Springer 1981 |
| 54 | | Donald E. Knuth:
Verification of Link-Level Protocols.
BIT 21(1): 31-36 (1981) |
| 53 | | Donald E. Knuth,
Michael F. Plass:
Breaking Paragraphs into Lines.
Softw., Pract. Exper. 11(11): 1119-1184 (1981) |
| 1979 |
|---|
| 52 | | Donald E. Knuth:
Algorithms in modern mathematics and computer science.
Algorithms in Modern Mathematics and Computer Science 1979: 82-99 |
| 1978 |
|---|
| 51 | | Arne T. Jonassen,
Donald E. Knuth:
A Trivial Algorithm Whose Analysis Isn't.
J. Comput. Syst. Sci. 16(3): 301-322 (1978) |
| 50 | | Donald E. Knuth,
Arnold Schönhage:
The Expected Linearity of a Simple Equivalence Algorithm.
Theor. Comput. Sci. 6: 281-315 (1978) |
| 1977 |
|---|
| 49 | | Donald E. Knuth:
Deletions That Preserve Randomness.
IEEE Trans. Software Eng. 3(5): 351-359 (1977) |
| 48 | | Donald E. Knuth:
A Generalization of Dijkstra's Algorithm.
Inf. Process. Lett. 6(1): 1-5 (1977) |
| 47 | | Donald E. Knuth,
James H. Morris Jr.,
Vaughan R. Pratt:
Fast Pattern Matching in Strings.
SIAM J. Comput. 6(2): 323-350 (1977) |
| 1976 |
|---|
| 46 | | Donald E. Knuth,
Luis Trabb Pardo:
Analysis of a Simple Factorization Algorithm.
Theor. Comput. Sci. 3(3): 321-348 (1976) |
| 1975 |
|---|
| 45 | | Donald E. Knuth,
Ronald W. Moore:
An Analysis of Alpha-Beta Pruning.
Artif. Intell. 6(4): 293-326 (1975) |
| 44 | | Donald E. Knuth,
Gururaj S. Rao:
Activity in an Interleaved Memory.
IEEE Trans. Computers 24(9): 943-944 (1975) |
| 43 | | John F. Reiser,
Donald E. Knuth:
Evading the Drift in Floating-Point Addition.
Inf. Process. Lett. 3(3): 84-87 (1975) |
| 42 | | John F. Reiser,
Donald E. Knuth:
Erratum: Evading the Drift in Floating-Point Addition.
Inf. Process. Lett. 3(5): 164 (1975) |
| 1974 |
|---|
| 41 | | Donald E. Knuth:
Structured Programming with go to Statements.
ACM Comput. Surv. 6(4): 261-301 (1974) |
| 40 | | Donald E. Knuth:
Computer Programming as an Art.
Commun. ACM 17(12): 667-673 (1974) |
| 39 | | O. Amble,
Donald E. Knuth:
Ordered Hash Tables.
Comput. J. 17(2): 135-142 (1974) |
| 38 | | Donald E. Knuth,
Jayme Luiz Szwarcfiter:
A Structured Program to Generate all Topological Sorting Arrangements.
Inf. Process. Lett. 2(6): 153-157 (1974) |
| 37 | | Donald E. Knuth,
Jayme Luiz Szwarcfiter:
Erratum: A Structured Program to Generate all Topological Sorting Arrangements.
Inf. Process. Lett. 3(2): 64 (1974) |
| 36 | | Donald E. Knuth:
The Asymptotic Number of Geometries.
J. Comb. Theory, Ser. A 16(3): 398-400 (1974) |
| 1973 |
|---|
| 35 | | Donald E. Knuth:
The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition.
Addison-Wesley 1973 |
| 34 | | Donald E. Knuth:
The Art of Computer Programming, Volume III: Sorting and Searching
Addison-Wesley 1973 |
| 1972 |
|---|
| 33 | | Donald E. Knuth:
Ancient Babylonian Algorithms.
Commun. ACM 15(7): 671-677 (1972) |
| 32 | | Donald E. Knuth:
George Forsythe and the Development of Computer Science.
Commun. ACM 15(8): 721-726 (1972) |
| 31 | | Donald E. Knuth,
E. B. Kaehler:
An Experiment in Optimal Sorting.
Inf. Process. Lett. 1(4): 173-176 (1972) |
| 30 | | Donald E. Knuth,
Robert W. Floyd:
Errata: Notes on Avoiding "go to" Statements.
Inf. Process. Lett. 1(4): 177 (1972) |
| 29 | | Edward A. Bender,
Donald E. Knuth:
Enumeration of Plane Partitions.
J. Comb. Theory, Ser. A 13(1): 40-54 (1972) |
| 1971 |
|---|
| 28 | | Donald E. Knuth:
Mathematical Analysis of Algorithms.
IFIP Congress (1) 1971: 19-27 |
| 27 | | Donald E. Knuth:
Optimum Binary Search Trees
Acta Inf. 1: 14-25 (1971) |
| 26 | | Donald E. Knuth:
Top-Down Syntax Analysis
Acta Inf. 1: 79-110 (1971) |
| 25 | | Donald E. Knuth,
Robert W. Floyd:
Notes on Avoiding "go to" Statements.
Inf. Process. Lett. 1(1): 23-31 (1971) |
| 24 | | Donald E. Knuth:
Correction: Semantics of Context-Free Languages.
Mathematical Systems Theory 5(1): 95-96 (1971) |
| 23 | | Donald E. Knuth:
An Empirical Study of FORTRAN Programs.
Softw., Pract. Exper. 1(2): 105-133 (1971) |
| 1970 |
|---|
| 22 | | Donald E. Knuth:
Von Neumann's First Computer Program.
ACM Comput. Surv. 2(4): 247-260 (1970) |
| 1969 |
|---|
| 21 | | Donald E. Knuth:
The Art of Computer Programming, Volume II: Seminumerical Algorithms
Addison-Wesley 1969 |
| 1968 |
|---|
| 20 | | Donald E. Knuth:
The Art of Computer Programming, Volume I: Fundamental Algorithms
Addison-Wesley 1968 |
| 19 | | Donald E. Knuth:
Semantics of Context-Free Languages.
Mathematical Systems Theory 2(2): 127-145 (1968) |
| 1967 |
|---|
| 18 | EE | Donald E. Knuth:
The remaining trouble spots in ALGOL 60.
Commun. ACM 10(10): 611-618 (1967) |
| 17 | | Donald E. Knuth:
A Characterization of Parenthesis Languages
Information and Control 11(3): 269-289 (1967) |
| 16 | EE | Donald E. Knuth,
Richard H. Bigelow:
Programming Language for Automata.
J. ACM 14(4): 615-635 (1967) |
| 1966 |
|---|
| 15 | EE | Donald E. Knuth:
Additional comments on a problem in concurrent programming control.
Commun. ACM 9(5): 321-322 (1966) |
| 1965 |
|---|
| 14 | | Donald E. Knuth:
On the Translation of Languages from Left to Rigth
Information and Control 8(6): 607-639 (1965) |
| 1964 |
|---|
| 13 | EE | Donald E. Knuth:
backus normal form vs. Backus Naur form.
Commun. ACM 7(12): 735-736 (1964) |
| 12 | EE | Donald E. Knuth:
A proposal for input-output conventions in ALGOL 60.
Commun. ACM 7(5): 273-283 (1964) |
| 1963 |
|---|
| 11 | EE | Donald E. Knuth,
Martin A. Goetz:
Letters to the editor: three letters on merging.
Commun. ACM 6(10): 585 (1963) |
| 10 | EE | Donald E. Knuth:
Length of strings for a merge sort.
Commun. ACM 6(11): 685-688 (1963) |
| 9 | EE | Donald E. Knuth:
Computer-drawn flowcharts.
Commun. ACM 6(9): 555-563 (1963) |
| 1962 |
|---|
| 8 | EE | Donald E. Knuth:
Evaluation of polynomials by computer.
Commun. ACM 5(12): 595-599 (1962) |
| 7 | EE | Donald E. Knuth,
Saul Gorn:
Backus' language.
Commun. ACM 5(4): 185 (1962) |
| 6 | EE | Donald E. Knuth:
The calculation of Easter.
Commun. ACM 5(4): 209-210 (1962) |
| 1961 |
|---|
| 5 | EE | G. A. Bachelor,
J. R. H. Dempster,
Donald E. Knuth,
Joseph Speroni:
SMALGOL-61.
Commun. ACM 4(11): 499-502 (1961) |
| 4 | EE | Donald E. Knuth,
Jack N. Merner:
ALGOL 60 confidential.
Commun. ACM 4(6): 268-272 (1961) |
| 3 | EE | Donald E. Knuth:
Minimizing Drum Latency Time.
J. ACM 8(2): 119-150 (1961) |
| 1960 |
|---|
| 2 | EE | Donald E. Knuth:
An Imaginary Number System.
Commun. ACM 3(4): 245-247 (1960) |
| 1959 |
|---|
| 1 | EE | Donald E. Knuth:
RUNCIBLE-Algebraic Translation on a Limited Computer.
Commun. ACM 2(11): 18-21 (1959) |
