BibSonomyburst/author/KnuthBibSonomy RSS feed for /author/Knuth2012-02-15T09:24:53+01:00http://www.bibsonomy.org/bibtex/2f6b86e734f1c6f24ccd0052cdce1b786/roni.sternroni.stern2012-02-06T10:47:14+01:00imported <span class="authorEditorList"><a href="/author/Knuth">D. E. Knuth</a> </span><em>Math. Comp.</em> (<em>1975</em>)Mon Feb 06 10:47:14 CET 2012Math. Comp.Estimating the Efficiency of Backtrack Programs291975imported http://www.bibsonomy.org/bibtex/2e7281e1fa586fd3501b3436ed4699567/schmidt2schmidt22012-01-03T13:02:41+01:00donald_knuth fun itex latex tex tug tugboat unicode xml <span class="authorEditorList"><a href="/author/Knuth">Donald Knuth</a> </span><em>TUGboat - Communications of the TeX Users Group, </em><em> 31, </em><em>TeX Users Group, </em>(<em>June 2010</em>)Tue Jan 03 13:02:41 CET 2012TUGboat - Communications of the TeX Users GroupJune2An Earthshaking Announcement312010donald_knuth fun itex latex tex tug tugboat unicode xml https://www.tug.org/TUGboat/Contents/contents31-2.htmlhttp://www.bibsonomy.org/bibtex/25b30dc5a067013300125d01cb68e3a49/cerniagigantecerniagigante2012-01-02T14:48:17+01:00combinatorics computer general mathematics science teaching <span class="authorEditorList"><a href="/author/Knuth">Donald E. Knuth</a> </span>(<em>1992</em>)Mon Jan 02 14:48:17 CET 2012cite arxiv:math/9205211 Comment: Abstract added by Greg KuperbergTwo notes on notation1992combinatorics computer general mathematics science teaching The author advocates two specific mathematical notations from his popular course and joint textbook, &quot;Concrete Mathematics&quot;. The first of these, extending an idea of Iverson, is the notation &quot;[P]&quot; for the function which is 1 when the Boolean condition P is true and 0 otherwise. This notation can encourage and clarify the use of characteristic functions and Kronecker deltas in sums and integrals. The second notation puts Stirling numbers on the same footing as binomial coefficients. Since binomial coefficients are written on two lines in parentheses and read &quot;n choose k&quot;, Stirling numbers of the first kind should be written on two lines in brackets and read &quot;n cycle k&quot;, while Stirling numbers of the second kind should be written in braces and read &quot;n subset k&quot;. (I might say &quot;n partition k&quot;.) The written form was first suggested by Imanuel Marx. The virtues of this notation are that Stirling partition numbers frequently appear in combinatorics, and that it more clearly presents functional relations similar to those satisfied by binomial coefficients. Two notes on notationhttp://www.bibsonomy.org/bibtex/2de20476b50d647b4f8bc645a929995f2/dblpdblp2011-12-23T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Knuth">Donald E. Knuth</a> </span><em>SODA, </em><em>page 41-43. </em><em>ACM/SIAM, </em>(<em>1993</em>)Fri Dec 23 00:00:00 CET 2011SODAconf/soda/199341-43The Stanford GraphBase: A Platform for Combinatorial Algorithms.1993dblp http://www.bibsonomy.org/bibtex/2d2201d750cb2a67137ae2c2a890734b5/dblpdblp2011-12-23T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Knuth">Donald E. Knuth</a>, <a href="/author/Motwani">Rajeev Motwani</a>, and <a href="/author/Pittel">Boris Pittel</a> </span><em>SODA, </em><em>page 397-404. </em><em>SIAM, </em>(<em>1990</em>)Fri Dec 23 00:00:00 CET 2011SODAconf/soda/1990397-404Stable Husbands.1990dblp http://www.bibsonomy.org/bibtex/2be5decbddaebaf1b7ed14b54997e29af/dblpdblp2011-12-08T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Waitelonis">Jörg Waitelonis</a>, <a href="/author/Ludwig">Nadine Ludwig</a>, <a href="/author/Knuth">Magnus Knuth</a>, and <a href="/author/Sack">Harald Sack</a> </span><em>Interact. Techn. Smart Edu.</em> <em>8(4):236-248</em> (<em>2011</em>)Thu Dec 08 00:00:00 CET 2011Interact. Techn. Smart Edu.4236-248WhoKnows? Evaluating linked data heuristics with a quiz that cleans up DBpedia.82011dblp http://www.bibsonomy.org/bibtex/25fbab9701b43ed4f796e48ae35e8f57d/jiji2011-12-07T14:33:14+01:00Pascal TeX literate programming <span class="authorEditorList"><a href="/author/Knuth">D. E. Knuth</a> </span><em>The Computer Journal</em> <em>27(2):97-111</em> (<em>1984</em>)Wed Dec 07 14:33:14 CET 2011The Computer Journal297-111Literate Programming271984Pascal TeX literate programming The author and his associates have been experimenting for the past several years with a programming language and documentation system called WEB. This paper presents WEB by example, and discusses why the new system appears to be an improvement over previous ones.http://www.bibsonomy.org/bibtex/266aca2733a5a248f0bf8070bbf2294b5/dblpdblp2011-12-05T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Knuth">Kevin H. Knuth</a> </span><em>CoRR</em> (<em>2010</em>)Mon Dec 05 00:00:00 CET 2011CoRRInformation Physics: The New Frontierabs/1009.51612010dblp http://www.bibsonomy.org/bibtex/25f03d30c645e6ded110ef193b32e92ca/dblpdblp2011-12-05T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Knuth">Kevin H. Knuth</a>, and <a href="/author/Skilling">John Skilling</a> </span><em>CoRR</em> (<em>2010</em>)Mon Dec 05 00:00:00 CET 2011CoRRFoundations of Inferenceabs/1008.48312010dblp http://www.bibsonomy.org/bibtex/28e216ae5bc7d24b5f715d1a88ad96d43/dblpdblp2011-12-05T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Mubeen">M. Asim Mubeen</a>, and <a href="/author/Knuth">Kevin H. Knuth</a> </span><em>CoRR</em> (<em>2011</em>)Mon Dec 05 00:00:00 CET 2011CoRREvidence-Based Filters for Signal Detection: Application to Evoked Brain Responsesabs/1107.12572011dblp http://www.bibsonomy.org/bibtex/2c9da60b74aeb1291a25d2d0f138a007a/dblpdblp2011-12-05T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Malakar">N. K. Malakar</a>, and <a href="/author/Knuth">K. H. Knuth</a> </span><em>CoRR</em> (<em>2010</em>)Mon Dec 05 00:00:00 CET 2011CoRREntropy-Based Search Algorithm for Experimental Designabs/1008.49732010dblp http://www.bibsonomy.org/bibtex/210c6b20a5f3f9e9d99d576a3e1b04f25/dblpdblp2011-12-05T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Knuth">Donald E. Knuth</a> </span><em>ACM Comput. Surv.</em> <em>6(4):261-301</em> (<em>1974</em>)Mon Dec 05 00:00:00 CET 2011ACM Comput. Surv.4261-301Structured Programming with go to Statements.61974dblp http://www.bibsonomy.org/bibtex/28f4374e7b95b567640527ee44de0dab8/dblpdblp2011-12-05T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Knuth">Donald E. Knuth</a> </span><em>ACM Comput. Surv.</em> <em>2(4):247-260</em> (<em>1970</em>)Mon Dec 05 00:00:00 CET 2011ACM Comput. Surv.4247-260Von Neumann's First Computer Program.21970dblp http://www.bibsonomy.org/bibtex/23e96f3d67cbf0efc9fc2f92ca86bded0/dblpdblp2011-12-05T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Knuth">Donald E. Knuth</a> </span><em>ACM Journal of Experimental Algorithmics</em> (<em>1996</em>)Mon Dec 05 00:00:00 CET 2011ACM Journal of Experimental Algorithmics1Irredundant Intervals.11996dblp http://www.bibsonomy.org/bibtex/24771135a6764490e92c760cd583b6e89/dblpdblp2011-11-20T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Wolf">Lina Wolf</a>, <a href="/author/Knuth">Magnus Knuth</a>, <a href="/author/Osterhoff">Johannes Osterhoff</a>, and <a href="/author/Sack">Harald Sack</a> </span><em>I-SEMANTICS, </em><em>page 71-78. </em><em>ACM, </em>(<em>2011</em>)Sun Nov 20 00:00:00 CET 2011I-SEMANTICSconf/i-semantics/201171-78ACM International Conference Proceeding SeriesRISQ! Renowned Individuals Semantic Quiz: a Jeopardy like quiz game for ranking facts.2011dblp http://www.bibsonomy.org/bibtex/245be06da83bc5d5906d4e5a62e110514/dblpdblp2011-11-07T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Knuth">Donald E. Knuth</a> </span><em>IEEE Trans. Software Eng.</em> <em>3(5):351-359</em> (<em>1977</em>)Mon Nov 07 00:00:00 CET 2011IEEE Trans. Software Eng.5351-359Deletions That Preserve Randomness.31977dblp http://www.bibsonomy.org/bibtex/2a9da22e34611255b4e0243c746d2234d/dblpdblp2011-11-02T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Grimsrud">Knuth Stener Grimsrud</a>, <a href="/author/Archibald">James K. Archibald</a>, and <a href="/author/Nelson">Brent E. Nelson</a> </span><em>IEEE Trans. Knowl. Data Eng.</em> <em>5(1):88-103</em> (<em>1993</em>)Wed Nov 02 00:00:00 CET 2011IEEE Trans. Knowl. Data Eng.188-103Multiple Prefetch Adaptive Disk Caching.51993dblp http://www.bibsonomy.org/bibtex/251b045f0d530fd04988d1bf78c6755d5/dblpdblp2011-10-31T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Knuth">Donald E. Knuth</a> </span><em>IEEE Transactions on Information Theory</em> <em>31(1):49-52</em> (<em>1985</em>)Mon Oct 31 00:00:00 CET 2011IEEE Transactions on Information Theory149-52Deciphering a linear congruential encryption.311985dblp http://www.bibsonomy.org/bibtex/2583c61ae31226b7eca12d867571304f0/dblpdblp2011-10-31T00:00:00+01:00dblp <span class="authorEditorList"><a href="/author/Knuth">Donald E. Knuth</a> </span><em>IEEE Transactions on Information Theory</em> <em>32(1):51-53</em> (<em>1986</em>)Mon Oct 31 00:00:00 CET 2011IEEE Transactions on Information Theory151-53Efficient balanced codes.321986dblp http://www.bibsonomy.org/bibtex/27bc59ce0b790c891272c3301029ddc36/dblpdblp2011-10-27T00:00:00+02:00dblp <span class="authorEditorList"><a href="/author/Knuth">Donald E. Knuth</a>, and <a href="/author/Rao">Gururaj S. Rao</a> </span><em>IEEE Trans. Computers</em> <em>24(9):943-944</em> (<em>1975</em>)Thu Oct 27 00:00:00 CEST 2011IEEE Trans. Computers9943-944Activity in an Interleaved Memory.241975dblp