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 7 years. The rules have however now changed to include papers published within the last 14 years.
[edit] Winners
- 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
- 1996 - Mark Jerrum and Alistair Sinclair
- 1997 - Joseph Halpern and Yoram Moses
- 1998 - Seinosuke Toda
- 1999 - Peter Shor, for Shor's algorithm for factoring numbers in polynomial time on a quantum computer
- 2000 - Moshe Vardi and Pierre Wolper
- 2001 - Sanjeev Arora, Uriel Feige, Shafi Goldwasser, Carsten Lund, László Lovász, Rajeev Motwani, Shmuel Safra, Madhu Sudan, and Mario Szegedy
- 2002 - Géraud Sénizergues
- 2003 - Yoav Freund and Robert Schapire
- 2004 - Maurice Herlihy, Mike Saks, Nir Shavit and Fotios Zaharoglou
- 2005 - Noga Alon, Yossi Matias and Mario Szegedy
- 2006 - Manindra Agrawal, Neeraj Kayal, Nitin Saxena for the AKS primality test
