Bio Donald Ervin Knuth 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 and 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,4 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 the patent offices of the United States and Europe. (via Wikipedia). View details for.
Random number generation is a problem of simulating some prescribed target distribution by using a given source. This problem has been inves-tigated in computer science, and has a close relation to information theory [1,2,3]. Somepractical algorithms forrandomnumbergeneration have been proposed so far, i.e. [1, 3, 4, 5].
Digital Typography Knuth, D. CSLI Publications. 1999. Sorting and searching The art of computer programming Knuth, D. 1998; 3. Fundamental Algorithms The art of computer programming Knuth, D.
1997; 1. Seminumerical algorithms The art of computer programming Knuth, D. 1997; 2.
Concrete Mathematics: A foundation for computer science Graham, R. L., Knuth, D. E., Patashnik, O. 1994. The Stanford GraphBase: A platform for combinatorial computing Knuth, D. 1994. THE BIRTH OF THE GIANT COMPONENT RANDOM STRUCTURES & ALGORITHMS Janson, S., Knuth, D.
E., Luczak, T., Pittel, B. 1993; 4 (3): 233-358. Abstract By presenting these examples, I have tried to illustrate four main points. 1) Finite numbers can be really enormous, and the known universe is very small. Therefore the distinction between finite and infinite is not as relevant as the distinction between realistic and unrealistic. 2) In many cases there are subtle ways to solve very large problems quickly, in spite of the fact that they appear at first to require examination of too many possibilities. 3) There are also cases where we can prove that a fairly natural problem is intrinsically hard, far beyond our conceivable capabilities.
4) It takes a good deal of skill to decide whether a given problem is in the easy or hard class; but even if a problem does turn out to be hard there are useful and interesting ways to change it into one that can be done satisfactorily. View details for View details for.
COMPUTER PROGRAMMING AS AN ART COMMUNICATIONS OF THE ACM Knuth, D. 1974; 17 (12): 667-673. View details for. Selected papers on discrete mathematics Knuth, D. CSLI Publications.
2003. Selected papers on computer languages Knuth, D. CSLI Publications. 2003. Things a computer scientist rarely talks about Knuth, D.
CSLI Publications. 2001. Selected papers on the analysis of algorithms Knuth, D. CSLI Publications.
2000. Dancing links Millennial Perspectives in Computer Science Knuth, D. 2000: 187–214. Linear probing and graphs ALGORITHMICA Knuth, D. 1998; 22 (4): 561-568. View details for.
Enumeration of plane partitions Journal of Combinatorial Theory Series A Bender, E. A., Knuth, D. 1972; 13 (1): 40-54. An empirical study of FORTRAN programs SOFTWARE-Practice and Experience Knuth, D. 1971; 1: 105-133.
Simple word problems in universal algebras Compututational Problems in Abstract Algebra Knuth, D. E., Bendix, P.
1970: 263–297. Permutations, matrices, and generalized Young tableaux Pacific Journal of Mathematics Knuth, D.
1970; 34: 709-727. Finite semifields and projective planes Journal of Algebra Knuth, D.
1965; 2 (2): 182-217. On the translation of languages from left to right Information and Control Knuth, D. 1965; 8 (5): 607-639. Minimizing drum latency time Journal of the ACM Knuth, D. 1961; 8 (2): 119-150. The potrzebie system of weights and measures MAD Magazine Knuth, D.
1957; 1 (33): 36-37.