Gödel Prize: Difference between revisions
No edit summary |
make format consistent - award reasons separate from awardees |
||
| Line 11: | Line 11: | ||
|[[1993]] ||[[László Babai]], [[Shafi Goldwasser]], [[Silvio Micali]], [[Shlomo Moran]], and [[Charles Rackoff]] ||for the development of [[interactive proof system]]s |
|[[1993]] ||[[László Babai]], [[Shafi Goldwasser]], [[Silvio Micali]], [[Shlomo Moran]], and [[Charles Rackoff]] ||for the development of [[interactive proof system]]s |
||
|- |
|- |
||
|[[1994]] ||[[Johan Håstad]] |
|[[1994]] ||[[Johan Håstad]] || for an [[exponential lower bound]] on the size of constant-depth [[Boolean circuits]] (for the [[parity function)]] |
||
|- |
|- |
||
|[[1995]] ||[[Neil Immerman]] and [[Róbert Szelepcsényi]] ||for the [[Immerman-Szelepcsényi theorem]] |
|[[1995]] ||[[Neil Immerman]] and [[Róbert Szelepcsényi]] ||for the [[Immerman-Szelepcsényi theorem]] regarding nondeterministic space complexity |
||
|- |
|- |
||
|[[1996]] ||[[Mark Jerrum]] and [[Alistair Sinclair]] || for work on [[Markov chains]] and the approximation of the [[permanent of a matrix|permanent]] |
|[[1996]] ||[[Mark Jerrum]] and [[Alistair Sinclair]] || for work on [[Markov chains]] and the approximation of the [[permanent of a matrix|permanent]] |
||
| Line 21: | Line 21: | ||
|[[1998]] ||[[Seinosuke Toda]] || |
|[[1998]] ||[[Seinosuke Toda]] || |
||
|- |
|- |
||
|[[1999]] ||[[Peter Shor]] |
|[[1999]] ||[[Peter Shor]] || for [[Shor's algorithm]] for [[factoring]] numbers in [[polynomial time]] on a [[quantum computer]] |
||
|- |
|- |
||
|[[2000]] ||[[Moshe Y. Vardi]] and [[Pierre Wolper]] || |
|[[2000]] ||[[Moshe Y. Vardi]] and [[Pierre Wolper]] || |
||
Revision as of 02:19, 28 April 2008
The Gödel Prize is a prize for outstanding papers in theoretical computer science, named after Kurt Gödel and awarded jointly by the European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory (ACM SIGACT).
The Gödel Prize is awarded annually, since 1993. It includes an award of $5000. The prize is awarded either at STOC (ACM Symposium on Theory of Computing, one of the main North American conferences in theoretical computer science) or ICALP (International Colloquium on Automata, Languages, and Programming, one of the main European conferences in the field). To be eligible for the prize, a paper must be published in a refereed journal within the last 14 (formerly 7) years.