# Donald E. Knuth

(Redirected from Donald Knuth)

Jump to navigation
Jump to search
Donald E. Knuth is a person.

**See:**Theoretical Computer Scientist, The Art of Computer Programming, Analysis of Algorithms, Big O Notation, TeX, METAFONT, Literate Programming, Dijkstra's Algorithm.

## References

### 2015

- (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/Donald_Knuth Retrieved:2015-7-9.
**Donald Ervin Knuth**(born January 10, 1938) is an American computer scientist, mathematician, and professor emeritus at Stanford University. He is the author of the 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 and CWEB computer programming systems designed to encourage and facilitate literate programming, and designed the MIX/MMIX instruction set architectures. As a member of the academic and scientific community, Knuth is strongly opposed to the policy of granting software patents. He has expressed his disagreement directly to both the United States Patent and Trademark Office and European Patent Organization.^{[1]}

- ↑ to the patent offices in the USA and Europe.

### 1990

- (Graham et al., 1990) ⇒ Roland Graham, Donald Knuth, and Oren Patashnik. (1990). “Concrete Mathematics." http://www-cs-faculty.stanford.edu/~knuth/gkp.html Chapter 1: Recurrent Problems

### 1985

- (Knuth, 1985) ⇒ Donald Knuth. (1985). “Structure and Interpretation of Computer Programs."
- QUOTE: ... Programs must be written for people to read, and only incidentally for machines to execute. …

### 1981

- (Knuth, 1981) ⇒ Donald E. Knuth. (1981). “Art of Computer Programming, Volume 2: Seminumerical Algorithms, 2nd edition." Addison-Wesley Professional. ISBN:0-201-03822-6.

### 1977

- (Knuth, 1977) ⇒ D.E. Knuth (1977). “A Generalization of Dijkstra's Algorithm". In: Information Processing Letters, 6(1). doi:10.1016/0020-0190(77)90002-3
- (Knuth et al., 1977) ⇒ Donald E. Knuth, James H. Morris, Jr., and Vaughan R. Pratt. (1977). “Fast Pattern Matching in Strings.” In: SIAM Journal on Computing, 6(2).

### 1975

- (Knuth & Moore, 1975) ⇒ Donald E. Knuth, and R.E. Moore. (1975). “An Analysis of Alpha-beta Pruning.” In: Artificial Intelligence, 6(4).

### 1973

- (Knuth, 1973) ⇒ Donald E. Knuth. (1973). “Art of Computer Programming, Volume 3: Sorting and Searching" ISBN:020103803X
- (Knuth, 1973) ⇒ Donald E. Knuth. (1973). “Art of Computer Programming, Volume 1: Fundamental Algorithms, 2nd edition." ISBN:0201038099

### 1969

- (Knuth, 1969) ⇒ Donald E. Knuth. (1969). “Art of Computer Programming, Volume 2: Seminumerical Algorithms" ISBN:0201038021

### 1968

- (Knuth, 1968) ⇒ Donald E. Knuth. (1968). “Art of Computer Programming, Volume 1: Fundamental Algorithms" ISBN:0201038013