@article{Knuth75,
  added-at = {2012-02-06T10:47:14.000+0100},
  author = {Knuth, D. E.},
  biburl = {http://www.bibsonomy.org/bibtex/2f6b86e734f1c6f24ccd0052cdce1b786/roni.stern},
  interhash = {64e07d797c99758ad9cb4c381ee045b9},
  intrahash = {f6b86e734f1c6f24ccd0052cdce1b786},
  journal = {Math. Comp.},
  keywords = {imported},
  title = {Estimating the Efficiency of Backtrack Programs},
  volume = 29,
  year = 1975
}

@inproceedings{knuth2010,
  added-at = {2012-01-03T13:02:41.000+0100},
  author = {Knuth, Donald},
  biburl = {http://www.bibsonomy.org/bibtex/2e7281e1fa586fd3501b3436ed4699567/schmidt2},
  booktitle = {TUGboat - Communications of the TeX Users Group},
  description = {https://www.tug.org/TUGboat/Contents/contents31-2.html},
  editor = {Beeton, Barbara and Berry, Karl},
  interhash = {80f5f06c344124a4dce735f7ed51101e},
  intrahash = {e7281e1fa586fd3501b3436ed4699567},
  keywords = {donald_knuth fun itex latex tex tug tugboat unicode xml},
  month = {June},
  number = 2,
  organization = {TeX Users Group},
  title = {An Earthshaking Announcement},
  url = {https://www.tug.org/TUGboat/tb31-2/tb98kuester.pdf},
  volume = 31,
  year = 2010
}

@techreport{Knuth1992,
  abstract = {The author advocates two specific mathematical notations from his popular
course and joint textbook, "Concrete Mathematics". The first of these,
extending an idea of Iverson, is the notation "[P]" 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 "n choose k", Stirling numbers of the first kind should be
written on two lines in brackets and read "n cycle k", while Stirling numbers
of the second kind should be written in braces and read "n subset k". (I might
say "n partition k".) 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.
},
  added-at = {2012-01-02T14:48:17.000+0100},
  author = {Knuth, Donald E.},
  biburl = {http://www.bibsonomy.org/bibtex/25b30dc5a067013300125d01cb68e3a49/cerniagigante},
  description = {Two notes on notation},
  interhash = {055bed37a3baa3b38ecf1366c0b83644},
  intrahash = {5b30dc5a067013300125d01cb68e3a49},
  keywords = {combinatorics computer general mathematics science teaching},
  note = {cite arxiv:math/9205211 Comment: Abstract added by Greg Kuperberg},
  title = {Two notes on notation},
  url = {http://arxiv.org/abs/math/9205211},
  year = 1992
}

@inproceedings{conf/soda/Knuth93,
  added-at = {2011-12-23T00:00:00.000+0100},
  author = {Knuth, Donald E.},
  biburl = {http://www.bibsonomy.org/bibtex/2de20476b50d647b4f8bc645a929995f2/dblp},
  booktitle = {SODA},
  crossref = {conf/soda/1993},
  editor = {Ramachandran, Vijaya},
  ee = {http://doi.acm.org/10.1145/313559.313609},
  interhash = {488c68234fdd43bb65883750ddf88e09},
  intrahash = {de20476b50d647b4f8bc645a929995f2},
  isbn = {0-89791-562-3},
  keywords = {dblp},
  pages = {41-43},
  publisher = {ACM/SIAM},
  title = {The Stanford GraphBase: A Platform for Combinatorial Algorithms.},
  url = {http://dblp.uni-trier.de/db/conf/soda/soda93.html#Knuth93},
  year = 1993
}

@inproceedings{conf/soda/KnuthMP90,
  added-at = {2011-12-23T00:00:00.000+0100},
  author = {Knuth, Donald E. and Motwani, Rajeev and Pittel, Boris},
  biburl = {http://www.bibsonomy.org/bibtex/2d2201d750cb2a67137ae2c2a890734b5/dblp},
  booktitle = {SODA},
  crossref = {conf/soda/1990},
  editor = {Johnson, David S.},
  ee = {http://doi.acm.org/10.1145/320176.320225},
  interhash = {a0304e1c80aff782a6156679a3f19a6b},
  intrahash = {d2201d750cb2a67137ae2c2a890734b5},
  isbn = {0-89871-251-3},
  keywords = {dblp},
  pages = {397-404},
  publisher = {SIAM},
  title = {Stable Husbands.},
  url = {http://dblp.uni-trier.de/db/conf/soda/soda90.html#KnuthMP90},
  year = 1990
}

@article{journals/itse/WaitelonisLKS11,
  added-at = {2011-12-08T00:00:00.000+0100},
  author = {Waitelonis, Jörg and Ludwig, Nadine and Knuth, Magnus and Sack, Harald},
  biburl = {http://www.bibsonomy.org/bibtex/2be5decbddaebaf1b7ed14b54997e29af/dblp},
  ee = {http://dx.doi.org/10.1108/17415651111189478},
  interhash = {a29315e275e4bf7ad5e972b6bb8f4390},
  intrahash = {be5decbddaebaf1b7ed14b54997e29af},
  journal = {Interact. Techn. Smart Edu.},
  keywords = {dblp},
  number = 4,
  pages = {236-248},
  title = {WhoKnows? Evaluating linked data heuristics with a quiz that cleans up DBpedia.},
  url = {http://dblp.uni-trier.de/db/journals/itse/itse8.html#WaitelonisLKS11},
  volume = 8,
  year = 2011
}

@article{Knuth01011984,
  abstract = {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.},
  added-at = {2011-12-07T14:33:14.000+0100},
  author = {Knuth, D. E.},
  biburl = {http://www.bibsonomy.org/bibtex/25fbab9701b43ed4f796e48ae35e8f57d/ji},
  doi = {10.1093/comjnl/27.2.97},
  eprint = {http://comjnl.oxfordjournals.org/content/27/2/97.full.pdf+html},
  interhash = {4b8391d8addef8dfb4074b82c3d5f2af},
  intrahash = {5fbab9701b43ed4f796e48ae35e8f57d},
  journal = {The Computer Journal},
  keywords = {Pascal TeX literate programming},
  number = 2,
  pages = {97-111},
  title = {Literate Programming},
  url = {http://comjnl.oxfordjournals.org/content/27/2/97.abstract},
  volume = 27,
  year = 1984
}

@article{journals/corr/abs-1009-5161,
  added-at = {2011-12-05T00:00:00.000+0100},
  author = {Knuth, Kevin H.},
  biburl = {http://www.bibsonomy.org/bibtex/266aca2733a5a248f0bf8070bbf2294b5/dblp},
  ee = {http://arxiv.org/abs/1009.5161},
  interhash = {c3c84204d4bf45b30563068db2775a8d},
  intrahash = {66aca2733a5a248f0bf8070bbf2294b5},
  journal = {CoRR},
  keywords = {dblp},
  title = {Information Physics: The New Frontier},
  url = {http://dblp.uni-trier.de/db/journals/corr/corr1009.html#abs-1009-5161},
  volume = {abs/1009.5161},
  year = 2010
}

@article{journals/corr/abs-1008-4831,
  added-at = {2011-12-05T00:00:00.000+0100},
  author = {Knuth, Kevin H. and Skilling, John},
  biburl = {http://www.bibsonomy.org/bibtex/25f03d30c645e6ded110ef193b32e92ca/dblp},
  ee = {http://arxiv.org/abs/1008.4831},
  interhash = {59b62202d1c6ca89a70ebbb39e4410dc},
  intrahash = {5f03d30c645e6ded110ef193b32e92ca},
  journal = {CoRR},
  keywords = {dblp},
  title = {Foundations of Inference},
  url = {http://dblp.uni-trier.de/db/journals/corr/corr1008.html#abs-1008-4831},
  volume = {abs/1008.4831},
  year = 2010
}

@article{journals/corr/abs-1107-1257,
  added-at = {2011-12-05T00:00:00.000+0100},
  author = {Mubeen, M. Asim and Knuth, Kevin H.},
  biburl = {http://www.bibsonomy.org/bibtex/28e216ae5bc7d24b5f715d1a88ad96d43/dblp},
  ee = {http://arxiv.org/abs/1107.1257},
  interhash = {945857a090f5403768a26022d20eb568},
  intrahash = {8e216ae5bc7d24b5f715d1a88ad96d43},
  journal = {CoRR},
  keywords = {dblp},
  title = {Evidence-Based Filters for Signal Detection: Application to Evoked Brain Responses},
  url = {http://dblp.uni-trier.de/db/journals/corr/corr1107.html#abs-1107-1257},
  volume = {abs/1107.1257},
  year = 2011
}

@article{journals/corr/abs-1008-4973,
  added-at = {2011-12-05T00:00:00.000+0100},
  author = {Malakar, N. K. and Knuth, K. H.},
  biburl = {http://www.bibsonomy.org/bibtex/2c9da60b74aeb1291a25d2d0f138a007a/dblp},
  ee = {http://arxiv.org/abs/1008.4973},
  interhash = {ee1e175965382b5d5202dc85232893c7},
  intrahash = {c9da60b74aeb1291a25d2d0f138a007a},
  journal = {CoRR},
  keywords = {dblp},
  title = {Entropy-Based Search Algorithm for Experimental Design},
  url = {http://dblp.uni-trier.de/db/journals/corr/corr1008.html#abs-1008-4973},
  volume = {abs/1008.4973},
  year = 2010
}

@article{journals/csur/Knuth74,
  added-at = {2011-12-05T00:00:00.000+0100},
  author = {Knuth, Donald E.},
  biburl = {http://www.bibsonomy.org/bibtex/210c6b20a5f3f9e9d99d576a3e1b04f25/dblp},
  ee = {http://doi.acm.org/10.1145/356635.356640},
  interhash = {d4582d62d34cdc44253417bbb9d3297c},
  intrahash = {10c6b20a5f3f9e9d99d576a3e1b04f25},
  journal = {ACM Comput. Surv.},
  keywords = {dblp},
  number = 4,
  pages = {261-301},
  title = {Structured Programming with go to Statements.},
  url = {http://dblp.uni-trier.de/db/journals/csur/csur6.html#Knuth74},
  volume = 6,
  year = 1974
}

@article{journals/csur/Knuth70,
  added-at = {2011-12-05T00:00:00.000+0100},
  author = {Knuth, Donald E.},
  biburl = {http://www.bibsonomy.org/bibtex/28f4374e7b95b567640527ee44de0dab8/dblp},
  ee = {http://doi.acm.org/10.1145/356580.356581},
  interhash = {fa0c2abe03cdd16d15a124e8f000a0ad},
  intrahash = {8f4374e7b95b567640527ee44de0dab8},
  journal = {ACM Comput. Surv.},
  keywords = {dblp},
  number = 4,
  pages = {247-260},
  title = {Von Neumann's First Computer Program.},
  url = {http://dblp.uni-trier.de/db/journals/csur/csur2.html#Knuth70},
  volume = 2,
  year = 1970
}

@article{journals/jea/Knuth96,
  added-at = {2011-12-05T00:00:00.000+0100},
  author = {Knuth, Donald E.},
  biburl = {http://www.bibsonomy.org/bibtex/23e96f3d67cbf0efc9fc2f92ca86bded0/dblp},
  ee = {http://doi.acm.org/10.1145/235141.235146},
  interhash = {cad4c22698a0c471ef0d7cf66c1442aa},
  intrahash = {3e96f3d67cbf0efc9fc2f92ca86bded0},
  journal = {ACM Journal of Experimental Algorithmics},
  keywords = {dblp},
  pages = 1,
  title = {Irredundant Intervals.},
  url = {http://dblp.uni-trier.de/db/journals/jea/jea1.html#Knuth96},
  volume = 1,
  year = 1996
}

@inproceedings{conf/i-semantics/WolfKOS11,
  added-at = {2011-11-20T00:00:00.000+0100},
  author = {Wolf, Lina and Knuth, Magnus and Osterhoff, Johannes and Sack, Harald},
  biburl = {http://www.bibsonomy.org/bibtex/24771135a6764490e92c760cd583b6e89/dblp},
  booktitle = {I-SEMANTICS},
  crossref = {conf/i-semantics/2011},
  editor = {Ghidini, Chiara and Ngomo, Axel-Cyrille Ngonga and Lindstaedt, Stefanie N. and Pellegrini, Tassilo},
  ee = {http://doi.acm.org/10.1145/2063518.2063528},
  interhash = {631cc2710b17b23640f3da608be9e34a},
  intrahash = {4771135a6764490e92c760cd583b6e89},
  isbn = {978-1-4503-0621-8},
  keywords = {dblp},
  pages = {71-78},
  publisher = {ACM},
  series = {ACM International Conference Proceeding Series},
  title = {RISQ! Renowned Individuals Semantic Quiz: a Jeopardy like quiz game for ranking facts.},
  url = {http://dblp.uni-trier.de/db/conf/i-semantics/i-semantics2011.html#WolfKOS11},
  year = 2011
}

@article{journals/tse/Knuth77,
  added-at = {2011-11-07T00:00:00.000+0100},
  author = {Knuth, Donald E.},
  biburl = {http://www.bibsonomy.org/bibtex/245be06da83bc5d5906d4e5a62e110514/dblp},
  ee = {http://doi.ieeecomputersociety.org/10.1109/TSE.1977.231160},
  interhash = {e1ae5274c6c831126f0d94a6b90bb7e6},
  intrahash = {45be06da83bc5d5906d4e5a62e110514},
  journal = {IEEE Trans. Software Eng.},
  keywords = {dblp},
  number = 5,
  pages = {351-359},
  title = {Deletions That Preserve Randomness.},
  url = {http://dblp.uni-trier.de/db/journals/tse/tse3.html#Knuth77},
  volume = 3,
  year = 1977
}

@article{journals/tkde/GrimsrudAN93,
  added-at = {2011-11-02T00:00:00.000+0100},
  author = {Grimsrud, Knuth Stener and Archibald, James K. and Nelson, Brent E.},
  biburl = {http://www.bibsonomy.org/bibtex/2a9da22e34611255b4e0243c746d2234d/dblp},
  cdrom = {TKDE5/P0088.pdf},
  cite = {journals/tocs/Smith85},
  ee = {http://doi.ieeecomputersociety.org/10.1109/69.204094},
  interhash = {7dfc06bba456bbddecd73f9c5eebe399},
  intrahash = {a9da22e34611255b4e0243c746d2234d},
  journal = {IEEE Trans. Knowl. Data Eng.},
  keywords = {dblp},
  number = 1,
  pages = {88-103},
  title = {Multiple Prefetch Adaptive Disk Caching.},
  url = {http://dblp.uni-trier.de/db/journals/tkde/tkde5.html#GrimsrudAN93},
  volume = 5,
  year = 1993
}

@article{journals/tit/Knuth85,
  added-at = {2011-10-31T00:00:00.000+0100},
  author = {Knuth, Donald E.},
  biburl = {http://www.bibsonomy.org/bibtex/251b045f0d530fd04988d1bf78c6755d5/dblp},
  ee = {http://dx.doi.org/10.1109/TIT.1985.1056997},
  interhash = {c9e49dd5fe9decaa67ce49d0594b9566},
  intrahash = {51b045f0d530fd04988d1bf78c6755d5},
  journal = {IEEE Transactions on Information Theory},
  keywords = {dblp},
  number = 1,
  pages = {49-52},
  title = {Deciphering a linear congruential encryption.},
  url = {http://dblp.uni-trier.de/db/journals/tit/tit31.html#Knuth85},
  volume = 31,
  year = 1985
}

@article{journals/tit/Knuth86,
  added-at = {2011-10-31T00:00:00.000+0100},
  author = {Knuth, Donald E.},
  biburl = {http://www.bibsonomy.org/bibtex/2583c61ae31226b7eca12d867571304f0/dblp},
  ee = {http://dx.doi.org/10.1109/TIT.1986.1057136},
  interhash = {7ce634a62d382a1c93d879b23a2df3a8},
  intrahash = {583c61ae31226b7eca12d867571304f0},
  journal = {IEEE Transactions on Information Theory},
  keywords = {dblp},
  number = 1,
  pages = {51-53},
  title = {Efficient balanced codes.},
  url = {http://dblp.uni-trier.de/db/journals/tit/tit32.html#Knuth86},
  volume = 32,
  year = 1986
}

@article{journals/tc/KnuthR75,
  added-at = {2011-10-27T00:00:00.000+0200},
  author = {Knuth, Donald E. and Rao, Gururaj S.},
  biburl = {http://www.bibsonomy.org/bibtex/27bc59ce0b790c891272c3301029ddc36/dblp},
  ee = {http://doi.ieeecomputersociety.org/10.1109/T-C.1975.224344},
  interhash = {a7a3a76db6e224433f39ed240b72cbd9},
  intrahash = {7bc59ce0b790c891272c3301029ddc36},
  journal = {IEEE Trans. Computers},
  keywords = {dblp},
  number = 9,
  pages = {943-944},
  title = {Activity in an Interleaved Memory.},
  url = {http://dblp.uni-trier.de/db/journals/tc/tc24.html#KnuthR75},
  volume = 24,
  year = 1975
}