Yahoo Italia Ricerca nel Web

Risultati di ricerca

  1. it.wikipedia.org › wiki › Donald_KnuthDonald Knuth - Wikipedia

    Donald Knuth alla Open Content Alliance, nell'ottobre 2005. Donald Ervin Knuth (Milwaukee, 10 gennaio 1938) è un informatico statunitense. Rinomato studioso di matematica (soprattutto di conoscenze che ora sono confluite nell'informatica), è professore emerito presso la Stanford University

  2. Donald E. Knuth (), Professor Emeritus of The Art of Computer Programming at Stanford University, welcomes you to his home page.

  3. en.wikipedia.org › wiki › Donald_KnuthDonald Knuth - Wikipedia

    Donald Ervin Knuth ( / kəˈnuːθ / [3] kə-NOOTH; born January 10, 1938) is an American computer scientist and mathematician. He is a professor emeritus at Stanford University. He is the 1974 recipient of the ACM Turing Award, informally considered the Nobel Prize of computer science. [4]

  4. by Donald E. Knuth. Click here to sign up for The Art of Computer Programming Newsletter , which features updates on new editions and promotions. At the end of 1999, these books were named among the best twelve physical-science monographs of the century by American Scientist, along with: Dirac on quantum mechanics, Einstein on relativity ...

  5. The Art of Computer Programming ( TAOCP) is a comprehensive monograph written by the computer scientist Donald Knuth presenting programming algorithms and their analysis. Volumes 1–5 are intended to represent the central core of computer programming for sequential machines.

  6. 2 mag 2024 · Donald Knuth (born January 10, 1938, Milwaukee, Wisconsin, U.S.) is an American mathematician and computer scientist known for his authoritative multivolume series of books The Art of Computer Programming (1968– ) and the text-formatting language TeX.

  7. 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.