Search results
Jump to navigation
Jump to search
Page title matches
- |author=Donald Knuth | author=Donald Knuth7 KB (1,029 words) - 07:21, 30 September 2007
- 171 bytes (17 words) - 17:20, 7 December 2008
- 12 bytes (1 word) - 09:37, 26 September 2007
- * [http://www-cs-faculty.stanford.edu/~knuth/vita.pdf Curriculum Vitae] - Donald Knuth's complete resume, available from his web page at Stanford University * "Donald Knuth in French Academy of Sciences". http://www.stanford.edu/ (Stanford Universi1 KB (189 words) - 10:24, 12 October 2007
- * [http://www-cs-faculty.stanford.edu/~knuth/vita.pdf Curriculum Vitae] - Donald Knuth's complete resume, available from his web page at Stanford University, wher * [http://www-cs-faculty.stanford.edu/~knuth/ Home Page] - Donald Knuth's web page at Stanford University732 bytes (103 words) - 10:24, 12 October 2007
- 495 bytes (65 words) - 03:16, 9 June 2008
Page text matches
- * [http://www-cs-faculty.stanford.edu/~knuth/vita.pdf Curriculum Vitae] - Donald Knuth's complete resume, available from his web page at Stanford University, wher * [http://www-cs-faculty.stanford.edu/~knuth/ Home Page] - Donald Knuth's web page at Stanford University732 bytes (103 words) - 10:24, 12 October 2007
- * [http://www-cs-faculty.stanford.edu/~knuth/vita.pdf Curriculum Vitae] - Donald Knuth's complete resume, available from his web page at Stanford University * "Donald Knuth in French Academy of Sciences". http://www.stanford.edu/ (Stanford Universi1 KB (189 words) - 10:24, 12 October 2007
- {{r|Donald Knuth}}363 bytes (53 words) - 15:32, 8 March 2023
- ...exists only as a concept, not as an implementation (such as [[Donald Knuth|Donald Knuth's]] MMIX)<ref name=MMIX> {{cite web | url=http://www-cs-faculty.stanford.ed | title=Knuth: MMIX | author=Donald Knuth | accessdate=2007-11-10 }}</ref> can be considered "Turing complete," in a3 KB (492 words) - 09:10, 22 May 2011
- |author=Donald Knuth | author=Donald Knuth7 KB (1,029 words) - 07:21, 30 September 2007
- {{rpl|Donald Knuth}}533 bytes (69 words) - 13:39, 27 March 2023
- * {{ cite book | last=Knuth | first=Donald E. | authorlink=Donald Knuth | title=Introduction to combinatorial algorithms and Boolean functions | se2 KB (316 words) - 13:38, 16 July 2011
- ...texts on computer programming algorithms include three volumes written by Donald Knuth collectively titled "The Art of Computer Programming" (ISBN 0201485419).1 KB (212 words) - 17:42, 20 February 2012
- * [[Donald Knuth|Knuth, Donald]] - created an encyclopedia of algorithms; pioneer in [[analy4 KB (515 words) - 09:39, 10 November 2008
- {{r|Donald Knuth}}3 KB (353 words) - 03:48, 24 September 2013
- ...sertion, by exchanging, by selection, by merging, and by distribution.<ref>Donald Knuth, ''The Art of Computer Programming'' Addison-Wesley, 1973, ISBN 0-201-038033 KB (470 words) - 15:50, 19 December 2007
- ...ginally written by [[Leslie Lamport]] as a package of macros extending [[Donald Knuth]]'s [[TeX]] system. TeX and LaTeX are [[Free Software Foundation | Free Sof3 KB (409 words) - 16:01, 29 September 2009
- ...popularize it is given in a 1996 paper by R. M. Corless ''et al.'' (with [[Donald Knuth]] a notable co-author).<ref name="corless1"/>14 KB (2,354 words) - 21:43, 25 September 2011
- Donald Knuth, an authority on PRNGs, quoted [[John von Neumann]] in a tongue-in-cheek bu23 KB (3,650 words) - 05:49, 8 April 2024
- Jupyter Notebooks implement what Donald Knuth termed “literate programming” in that code cells intermix with “markd12 KB (1,808 words) - 22:24, 14 February 2021
- ...ven use centred dots in sums and only one (on quantum physics) lower dots. Donald Knuth write in the TeXbook (p. 172) that "in general, it is best to use \cdots be44 KB (7,312 words) - 03:09, 8 March 2024