Donald E. Knuth

Author: Donald E. Knuth

Donald Ervin Knuth is a computer scientist and Professor Emeritus at Stanford University.

He is the author of the seminal multi-volume work The Art of Computer Programming. Knuth has been called the "father" of the analysis of algorithms. He contributed to the development of the rigorous analysis of the computational complexity of algorithms and systematized formal mathematical techniques for it. In the process he also popularized the asymptotic notation.

In addition to fundamental contributions in several branches of theoretical computer science, Knuth is the creator of the TeX computer typesetting system, the related METAFONT font definition language and rendering system, and the Computer Modern family of typefaces.

As a writer and scholar, Knuth created the WEB/CWEB computer programming systems designed to encourage and facilitate literate programming, and designed the MIX/MMIX instruction set architectures.

Publications

Publication period start: 1961
Number of co-authors: 6

Co-authors

Number of publications with favourite co-authors
Saul Gorn
1
Martin A. Goetz
1
Jack N. Merner
1

Productive Colleagues

Most productive colleagues in number of publications
Jack N. Merner
3
Martin A. Goetz
5
Saul Gorn
25

Publications

Knuth, Donald E. (1987): Digital Halftones by Dot Diffusion. In ACM Transactions on Graphics, 6 (4) pp. 245-273.

Knuth, Donald E. (1984): The Complexity of Songs (April 1984 Special Section). In Communications of the ACM, 27 (4) pp. 344-348.

Knuth, Donald E. (1974): Computer Programming as an Art. In Communications of the ACM, 17 (12) pp. 667-673.

Knuth, Donald E. (1972): Ancient Babylonian Algorithms. In Communications of the ACM, 15 (7) pp. 671-677.

Knuth, Donald E. (1972): George Forsythe and the Development of Computer Science. In Communications of the ACM, 15 (8) pp. 721-726.

Knuth, Donald E. (1967): The remaining trouble spots in ALGOL 60. In Communications of the ACM, 10 (10) pp. 611-618. https://dl.acm.org/doi/10.1145/363717.363743

Knuth, Donald E. (1966): Additional comments on a problem in concurrent programming control. In Communications of the ACM, 9 (5) pp. 321-322. https://dl.acm.org/doi/10.1145/355592.365595

Knuth, Donald E. (1964): A proposal for input-output conventions in ALGOL 60. In Communications of the ACM, 7 (5) pp. 273-283. https://dl.acm.org/doi/10.1145/364099.364222

Knuth, Donald E. (1964): backus normal form vs. Backus Naur form. In Communications of the ACM, 7 (12) pp. 735-736. https://dl.acm.org/doi/10.1145/355588.365140

Knuth, Donald E. (1963): Computer-drawn flowcharts. In Communications of the ACM, 6 (9) pp. 555-563. https://dl.acm.org/doi/10.1145/367593.367620

Knuth, Donald E. (1963): Length of strings for a merge sort. In Communications of the ACM, 6 (11) pp. 685-688. https://dl.acm.org/doi/10.1145/368310.368397

Knuth, Donald E., Goetz, Martin A. (1963): Letters to the editor: three letters on merging. In Communications of the ACM, 6 (10) pp. 585. https://dl.acm.org/doi/10.1145/367651.367654

Knuth, Donald E. (1962): The calculation of Easter. In Communications of the ACM, 5 (4) pp. 209-210. https://dl.acm.org/doi/10.1145/366920.366980

Knuth, Donald E. (1962): Evaluation of polynomials by computer. In Communications of the ACM, 5 (12) pp. 595-599. https://dl.acm.org/doi/10.1145/355580.369074

Knuth, Donald E., Gorn, Saul (1962): Backus\' language. In Communications of the ACM, 5 (4) pp. 185. https://dl.acm.org/doi/10.1145/366920.366925

Bachelor, G. A., Dempster, J. R. H., Knuth, Donald E., Speroni, Joseph (1961): SMALGOL-61. In Communications of the ACM, 4 (11) pp. 499-502. https://dl.acm.org/doi/10.1145/366813.366843

Knuth, Donald E., Merner, Jack N. (1961): ALGOL 60 confidential. In Communications of the ACM, 4 (6) pp. 268-272. https://dl.acm.org/doi/10.1145/366573.366599

Knuth, Donald E. (1960): An Imaginary Number System. In Communications of the ACM, 3 (4) pp. 245-247. https://dl.acm.org/doi/10.1145/367177.367233

Knuth, Donald E. (1959): RUNCIBLE-Algebraic Translation on a Limited Computer. In Communications of the ACM, 2 (11) pp. 18-21. https://dl.acm.org/doi/10.1145/368481.368507