Gödel Prize
From Wikipedia, the free encyclopedia
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.
| Year | Recipient(s) | Notes |
|---|---|---|
| 1993 | László Babai, Shafi Goldwasser, Silvio Micali, Shlomo Moran, and Charles Rackoff | for the development of interactive proof systems |
| 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 regarding nondeterministic space complexity |
| 1996 | Mark Jerrum and Alistair Sinclair | for work on Markov chains and the approximation of the permanent |
| 1997 | Joseph Halpern and Yoram Moses | for defining a formal notion of "knowledge" in distributed environments |
| 1998 | Seinosuke Toda | for Toda's theorem which showed a connection between counting solutions (PP) and alternation of quantifiers (PH) |
| 1999 | Peter Shor | for Shor's algorithm for factoring numbers in polynomial time on a quantum computer |
| 2000 | Moshe Y. Vardi and Pierre Wolper | for work on model checking with finite automata |
| 2001 | Sanjeev Arora, Uriel Feige, Shafi Goldwasser, Carsten Lund, László Lovász, Rajeev Motwani, Shmuel Safra, Madhu Sudan, and Mario Szegedy | for the PCP theorem and its applications to hardness of approximation |
| 2002 | Géraud Sénizergues | for proving that equivalence of deterministic pushdown automata is decidable |
| 2003 | Yoav Freund and Robert Schapire | for the AdaBoost algorithm |
| 2004 | Maurice Herlihy, Mike Saks, Nir Shavit and Fotios Zaharoglou | for applications of topology to the theory of distributed computing |
| 2005 | Noga Alon, Yossi Matias and Mario Szegedy | for their foundational contribution to streaming algorithms |
| 2006 | Manindra Agrawal, Neeraj Kayal, Nitin Saxena | for the AKS primality test |
| 2007 | Alexander Razborov, Steven Rudich | for Natural Proofs |
