Skip to search formSkip to main contentSkip to account menu

Knuth Prize

Known as: Knuth Prize laureates, Donald Knuth Prize, The Donald E. Knuth Prize 
The Donald E. Knuth Prize is a prize for outstanding contributions to the foundations of computer science, named after Donald E. Knuth.
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
ACM SIGACTComputer scienceGödel PrizeSecure multi-party computation

Broader (1)

Theoretical computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Conservar, conjugación del verbo con fondos textiles de museos militares
espanol“El presente solo se forma del pasado, y lo que se encuentra en el efecto estaba ya en la causa” (Henri Bergson… 
2013
2013
Stories of Drug Trafficking in Rural Mexico: Territories, Drugs and Cartels in Michoacán
In the international media, drug-related violence, corruption and militarization have received much attention. While this is… 
Highly Cited
2012
Highly Cited
2012
Fractal optics and beyond
Fractals, shapes comprised of self-similar parts, are not merely prescribed linear structures. A wide class of fractals can also… 
Review
2009
Review
2009
A comprehensive overview on today's ceramic substrate technologies
Ceramic packaging solutions offer superior reliability performance compared to all organic technologies and are only a fraction… 
2007
2007
- 1-On the History of Fermat ’ s Last Theorem : A Down-to-Earth Approach
1 . Introduction .............................................................................................................. 1… 
Highly Cited
2006
Highly Cited
2006
Right nulled GLR parsers
The right nulled generalized LR parsing algorithm is a new generalization of LR parsing which provides an elegant correction to… 
2002
2002
A geometric version of the Robinson-Schensted correspondence for skew oscillating tableaux
1986
1986
Some Further Results on Digital Search Trees
Our purpose in this paper is the study of digital search trees, (binary) tries and Patricia tries ; a wealth of information about… 
1981
1981
Applied Tree Enumerations
In this paper we consider the class T of ordered trees with n edges and give n combinntorial proofs to several enumeration… 
1977
1977
Saving space in fast string-matching
  • Z. GalilJ. Seiferas
  • 18th Annual Symposium on Foundations of Computer…
  • 1977
  • Corpus ID: 13023387
The string-matching problem is to find all instances (as contiguous substrings) of a “pattern” character string x in a longer… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)