Donald E. Knuth

According to our database1, Donald E. Knuth
  • authored at least 170 papers between 1959 and 2012.
  • has a "Dijkstra number"2 of three.

Awards

Turing Prize recipient

Turing Prize 1974, "For his major contributions to the analysis of algorithms and the design of programming languages, and in particular for his contributions to "The Art of Computer Programming" through his well-known books in a continuous series by this title".

ACM Fellow

ACM Fellow 1994, "For the design and implementation of TEX, an innovative tool for the computer composition of documents of high typographical quality.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2012
Satisfiability and The Art of Computer Programming.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

An Algorithmic View of the Universe.
Proceedings of the ACM Turing Centenary Celebration, 2012

Companion to the papers of Donald Knuth.
CSLI lecture notes series 202, Cambridge University Press, ISBN: 978-1-57586-634-5, 2012

2011
Selected Papers on Fun and Games.
CSLI lecture notes series 192, Cambridge University Press, ISBN: 978-1-57586-584-3, 2011

2010
Selected Papers on Design of Algorithms.
CSLI lecture notes series 191, Cambridge University Press, ISBN: 978-1-57586-582-9, 2010

2009
Near-deBruijn Cycles: 11336 [2008, 71].
,
et al.
The American Mathematical Monthly, 2009

Reversal by Swaps: 11264 [2007, 77].
The American Mathematical Monthly, 2009

Solving a Recurrence by Binary Expansion: 11320 [2007, 835].
The American Mathematical Monthly, 2009

Sums and Powers, Set Counting, and Coefficient Tracking: 11274 [2007, 165].
The American Mathematical Monthly, 2009

Problem 11452.
The American Mathematical Monthly, 2009

2008
Perfect Parity Patterns: 11243.
The American Mathematical Monthly, 2008

Problem 11369.
The American Mathematical Monthly, 2008

Problem 11336.
The American Mathematical Monthly, 2008

2007
A Combinatorial Maximum: 11142.
The American Mathematical Monthly, 2007

Partitions of a Circular Set: 11151.
The American Mathematical Monthly, 2007

Problem 11320.
The American Mathematical Monthly, 2007

Problem 11274.
The American Mathematical Monthly, 2007

Problem 11264.
The American Mathematical Monthly, 2007

2006
Cube-Free Sums: 11078.
The American Mathematical Monthly, 2006

Problem 11243.
The American Mathematical Monthly, 2006

2005
A Modular Triple: 11021.
The American Mathematical Monthly, 2005

Problem 11151.
The American Mathematical Monthly, 2005

Problem 11142.
The American Mathematical Monthly, 2005

2004
Some Bernstein Polynomials: 10985.
,
et al.
The American Mathematical Monthly, 2004

Fibonacci in Complex Camouflage: 10858.
The American Mathematical Monthly, 2004

Problem 11078.
The American Mathematical Monthly, 2004

Efficient Coroutine Generation of Constrained Gray Sequences.
Proceedings of the From Object-Orientation to Formal Methods, 2004

2003
Animals in a Cage: 10875.
The American Mathematical Monthly, 2003

Recounting the Rationals, Continued: 10906.
The American Mathematical Monthly, 2003

Highly Variable Lists: 10691.
The American Mathematical Monthly, 2003

Products of Transpositions: 10913.
The American Mathematical Monthly, 2003

Exploring All Binary Mazes: 10720.
The American Mathematical Monthly, 2003

Balanced Neighborhood Squares: 10871.
The American Mathematical Monthly, 2003

Problem 10985.
The American Mathematical Monthly, 2003

Robert W Floyd, In Memoriam.
SIGACT News, 2003

Bottom-up education.
Proceedings of the 8th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2003

2002
A Fibonacci-Lucas Extremum: 10825.
The American Mathematical Monthly, 2002

Min-Plus Matrix Multiplication: 10834.
The American Mathematical Monthly, 2002

Min-Plus Matrix Multiplication: 10834.
The American Mathematical Monthly, 2002

2001
A Stirling Series: 10832.
The American Mathematical Monthly, 2001

Problem 10913.
The American Mathematical Monthly, 2001

Problem 10906.
The American Mathematical Monthly, 2001

Problem 10875.
The American Mathematical Monthly, 2001

Problem 10871.
The American Mathematical Monthly, 2001

Problem 10858.
The American Mathematical Monthly, 2001

Leaves of Ordered Trees: 10757.
The American Mathematical Monthly, 2001

The Joys of the Asymptotics.
Proceedings of the 5th Hellenic-European Conference on Computer Mathematics and its Applications (HERCMA-01), 2001

Arithmetik.
Springer, ISBN: 978-3-540-66745-2, 2001

2000
The Probability of Being in a State: 10726.
The American Mathematical Monthly, 2000

The Real Numbers, Algebraically: 10689.
The American Mathematical Monthly, 2000

Problem 10832.
The American Mathematical Monthly, 2000

1999
MMIXware, A RISC Computer for the Third Millennium
Lecture Notes in Computer Science 1750, Springer, ISBN: 3-540-66938-8, 1999

1998
Linear Probing and Graphs.
Algorithmica, 1998

The art of computer programming, , Volume III, 2nd Edition.
Addison-Wesley, ISBN: 0201896850, 1998

The art of computer programming, Volume II: Seminumerical Algorithms, 3rd Edition.
Addison-Wesley, ISBN: 0201896842, 1998

1997
Shellsort with three increments.
Random Struct. Algorithms, 1997

A Sequence of Series for the Lambert W Function.
Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

The art of computer programming, Volume I: Fundamental Algorithms, 3rd Edition.
Addison-Wesley, ISBN: 0201896834, 1997

1996
Irredundant Intervals.
ACM Journal of Experimental Algorithmics, 1996

The Knowlton-Graham Partition Problem.
J. Comb. Theory, Ser. A, 1996

An Exact Analysis of Stable Allocation.
J. Algorithms, 1996

Overlapping Pfaffians.
Electr. J. Comb., 1996

On the LambertW function.
Adv. Comput. Math., 1996

1995
Two-Way Rounding.
SIAM J. Discrete Math., 1995

1994
Mini-Indexes for Literate Programs.
Software - Concepts and Tools, 1994

The Sandwich Theorem.
Electr. J. Comb., 1994

Concrete mathematics - a foundation for computer science (2. ed.).
Addison-Wesley, ISBN: 978-0-201-55802-9, 1994

The CWEB system of structured documentation - version 3.0.
Addison-Wesley, ISBN: 978-0-201-57569-9, 1994

1993
The Birth of the Giant Component.
Random Struct. Algorithms, 1993

The Stanford GraphBase: A Platform for Combinatorial Algorithms.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

The Stanford GraphBase - a platform for combinatorial computing.
ACM, ISBN: 978-0-201-54275-2, 1993

1992
The Problem of Compatible Representatives.
SIAM J. Discrete Math., 1992

Randomized Incremental Construction of Delaunay and Voronoi Diagrams.
Algorithmica, 1992

Context-Free Multilanguages.
Proceedings of the Theoretical Studies in Computer Science, 1992

Axioms and Hulls
Lecture Notes in Computer Science 606, Springer, ISBN: 3-540-55611-7, 1992

1991
Theory and Practice.
Theor. Comput. Sci., 1991

Efficient representation of perm groups.
Combinatorica, 1991

1990
Addition Machines.
SIAM J. Comput., 1990

Stable Husbands.
Random Struct. Algorithms, 1990

A bijection for ordered factorizations.
J. Comb. Theory, Ser. A, 1990

A Note on Digitized Angles.
Electronic Publishing, 1990

Nested Satisfiability.
Acta Inf., 1990

The Genesis of Attribute Grammars.
Proceedings of the Attribute Grammars and their Applications, 1990

Stable Husbands.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

Randomized Incremental Construction of Delaunay and Voronoi Diagrams.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1989
The Errors of TEX.
Softw., Pract. Exper., 1989

The first cycles in an evolving graph.
Discrete Mathematics, 1989

Concrete mathematics - a foundation for computer science.
Addison-Wesley, ISBN: 978-0-201-14236-5, 1989

Mathematical Writing.
MAA notes 14, Mathematical Association of America, ISBN: 978-0-88385-063-3, 1989

1987
Digital Halftones by Dot Diffusion.
ACM Trans. Graph., 1987

1986
Efficient balanced codes.
IEEE Trans. Information Theory, 1986

The IBM 650: An Appreciation from the Field.
IEEE Annals of the History of Computing, 1986

Computer modern typefaces.
Addison-Wesley, ISBN: 0201134462, 1986

The METAFONTbook.
Addison-Wesley, ISBN: 0201134446, 1986

TeX: The Program
Addison-Wesley, ISBN: 0-201-13437-3, 1986

The TeXbook
Addison-Wesley, ISBN: 0-201-13447-0, 1986

1985
Optimal Prepaging and Font Caching.
ACM Trans. Program. Lang. Syst., 1985

Deciphering a linear congruential encryption.
IEEE Trans. Information Theory, 1985

An Analysis of Optimum Caching.
J. Algorithms, 1985

Dynamic Huffman Coding.
J. Algorithms, 1985

1984
An algorithm for Brownian zeroes.
Computing, 1984

Literate Programming.
Comput. J., 1984

The Complexity of Songs (April 1984 Special Section).
Commun. ACM, 1984

1982
Huffman's Algorithm via Algebra.
J. Comb. Theory, Ser. A, 1982

1981
Breaking Paragraphs into Lines.
Softw., Pract. Exper., 1981

Verification of Link-Level Protocols.
BIT, 1981

The Art of Computer Programming, Volume II: Seminumerical Algorithms, 2nd Edition
Addison-Wesley, ISBN: 0-201-03822-6, 1981

1979
Inhomogeneous sorting.
International Journal of Parallel Programming, 1979

Lexicographic permutations with restrictions.
Discrete Applied Mathematics, 1979

Algorithms in modern mathematics and computer science.
Proceedings of the Algorithms in Modern Mathematics and Computer Science, 1979

1978
The Expected Linearity of a Simple Equivalence Algorithm.
Theor. Comput. Sci., 1978

A Trivial Algorithm Whose Analysis Isn't.
J. Comput. Syst. Sci., 1978

1977
Deletions That Preserve Randomness.
IEEE Trans. Software Eng., 1977

Fast Pattern Matching in Strings.
SIAM J. Comput., 1977

A Generalization of Dijkstra's Algorithm.
Inf. Process. Lett., 1977

1976
Analysis of a Simple Factorization Algorithm.
Theor. Comput. Sci., 1976

Analysis of the subtractive algorithm for greatest common divisors.
ACM SIGSAM Bulletin, 1976

1975
Activity in an Interleaved Memory.
IEEE Trans. Computers, 1975

Erratum: Evading the Drift in Floating-Point Addition.
Inf. Process. Lett., 1975

Evading the Drift in Floating-Point Addition.
Inf. Process. Lett., 1975

Random matroids.
Discrete Mathematics, 1975

Son of seminumerical algorithms.
ACM SIGSAM Bulletin, 1975

An Analysis of Alpha-Beta Pruning.
Artif. Intell., 1975

1974
The Asymptotic Number of Geometries.
J. Comb. Theory, Ser. A, 1974

Erratum: A Structured Program to Generate all Topological Sorting Arrangements.
Inf. Process. Lett., 1974

A Structured Program to Generate all Topological Sorting Arrangements.
Inf. Process. Lett., 1974

Structured Programming with go to Statements.
ACM Comput. Surv., 1974

Ordered Hash Tables.
Comput. J., 1974

Computer Programming as an Art.
Commun. ACM, 1974

1973
Permutations with nonnegative partial sums.
Discrete Mathematics, 1973

The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition.
Addison-Wesley, ISBN: 0201038218, 1973

The Art of Computer Programming, Volume III: Sorting and Searching
Addison-Wesley, ISBN: 0-201-03803-X, 1973

1972
Enumeration of Plane Partitions.
J. Comb. Theory, Ser. A, 1972

An Experiment in Optimal Sorting.
Inf. Process. Lett., 1972

Errata: Notes on Avoiding "go to" Statements.
Inf. Process. Lett., 1972

Complements and transitive closures.
Discrete Mathematics, 1972

George Forsythe and the Development of Computer Science.
Commun. ACM, 1972

Ancient Babylonian Algorithms.
Commun. ACM, 1972

1971
Examples of formal semantics.
Proceedings of the Symposium on Semantics of Algorithmic Languages, 1971

Review of 'Introduction to Combinatorial Mathematics' (Liu, C. L.; 1968).
IEEE Trans. Information Theory, 1971

An Empirical Study of FORTRAN Programs.
Softw., Pract. Exper., 1971

Correction: Semantics of Context-Free Languages.
Mathematical Systems Theory, 1971

Notes on Avoiding "go to" Statements.
Inf. Process. Lett., 1971

Top-Down Syntax Analysis.
Acta Inf., 1971

Optimum Binary Search Trees.
Acta Inf., 1971

Mathematical Analysis of Algorithms.
IFIP Congress (1), 1971

1970
Von Neumann's First Computer Program.
ACM Comput. Surv., 1970

1969
The Art of Computer Programming, Volume II: Seminumerical Algorithms
Addison-Wesley, ISBN: 0201038021, 1969

1968
Semantics of Context-Free Languages.
Mathematical Systems Theory, 1968

The Art of Computer Programming, Volume I: Fundamental Algorithms
Addison-Wesley, 1968

1967
A Characterization of Parenthesis Languages
Information and Control, September, 1967

Programming Language for Automata.
J. ACM, 1967

The remaining trouble spots in ALGOL 60.
Commun. ACM, 1967

1966
Additional comments on a problem in concurrent programming control.
Commun. ACM, 1966

1965
On the Translation of Languages from Left to Rigth
Information and Control, December, 1965

1964
A Formal Definition of SOL.
IEEE Trans. Electronic Computers, 1964

SOLߞA Symbolic Language for General-Purpose Systems Simulation.
IEEE Trans. Electronic Computers, 1964

backus normal form vs. Backus Naur form.
Commun. ACM, 1964

A proposal for input-output conventions in ALGOL 60.
Commun. ACM, 1964

1963
Letters to the editor: three letters on merging.
Commun. ACM, 1963

Length of strings for a merge sort.
Commun. ACM, 1963

Computer-drawn flowcharts.
Commun. ACM, 1963

1962
Backus' language.
Commun. ACM, 1962

Evaluation of polynomials by computer.
Commun. ACM, 1962

The calculation of Easter.
Commun. ACM, 1962

1961
Minimizing Drum Latency Time.
J. ACM, 1961

ALGOL 60 confidential.
Commun. ACM, 1961

SMALGOL-61.
Commun. ACM, 1961

1960
An Imaginary Number System.
Commun. ACM, 1960

1959
RUNCIBLE-Algebraic Translation on a Limited Computer.
Commun. ACM, 1959


  Loading...