Gödel Prize

The Gödel Prize is an annual prize for outstanding papers in the area of theoretical computer science, given jointly by European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Interest Group on Algorithms and Computational Theory (ACM SIGACT). The award is named in honor of Kurt Gödel. Gödel's connection to theoretical computer science is that he was the first to mention the "P versus NP" question, in a 1956 letter to John von Neumann in which Gödel asked whether a certain NP-complete problem could be solved in quadratic or linear time.

The Gödel Prize has been awarded since 1993. 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. The prize includes a reward of US$5000.[1]

The winner of the Prize is selected by a committee of six members. The EATCS President and the SIGACT Chair each appoint three members to the committee, to serve staggered three-year terms. The committee is chaired alternately by representatives of EATCS and SIGACT.

Recipients

Year Name(s) Notes Publication year
1993 László Babai, Shafi Goldwasser, Silvio Micali, Shlomo Moran, and Charles Rackoff for the development of interactive proof systems 1988,[paper 1] 1989[paper 2]
1994 Johan Håstad for an exponential lower bound on the size of constant-depth Boolean circuits (for the parity function). 1989[paper 3]
1995 Neil Immerman and Róbert Szelepcsényi for the Immerman–Szelepcsényi theorem regarding nondeterministic space complexity 1988,[paper 4] 1988[paper 5]
1996 Mark Jerrum and Alistair Sinclair for work on Markov chains and the approximation of the permanent of a matrix 1989,[paper 6] 1989[paper 7]
1997 Joseph Halpern and Yoram Moses for defining a formal notion of "knowledge" in distributed environments 1990[paper 8]
1998 Seinosuke Toda for Toda's theorem which showed a connection between counting solutions (PP) and alternation of quantifiers (PH) 1991[paper 9]
1999 Peter Shor for Shor's algorithm for factoring numbers in polynomial time on a quantum computer 1997[paper 10]
2000 Moshe Y. Vardi and Pierre Wolper for work on temporal logic with finite automata 1994[paper 11]
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 1996,[paper 12] 1998,[paper 13] 1998[paper 14]
2002 Géraud Sénizergues for proving that equivalence of deterministic pushdown automata is decidable 2001[paper 15]
2003 Yoav Freund and Robert Schapire for the AdaBoost algorithm in machine learning 1997[paper 16]
2004 Maurice Herlihy, Michael Saks, Nir Shavit and Fotios Zaharoglou for applications of topology to the theory of distributed computing 1999,[paper 17] 2000[paper 18]
2005 Noga Alon, Yossi Matias and Mario Szegedy for their foundational contribution to streaming algorithms 1999[paper 19]
2006 Manindra Agrawal, Neeraj Kayal, Nitin Saxena for the AKS primality test 2004[paper 20]
2007 Alexander Razborov, Steven Rudich for natural proofs 1997[paper 21]
2008 Daniel Spielman, Shanghua Tengfor smoothed analysis of algorithms 2004[paper 22]
2009 Omer Reingold, Salil Vadhan, Avi Wigderson for zig-zag product of graphs and undirected connectivity in log space 2002,[paper 23] 2008[paper 24]
2010 Sanjeev Arora, Joseph S. B. Mitchell for their concurrent discovery of a polynomial-time approximation scheme (PTAS) for the Euclidean Travelling Salesman Problem (ETSP) 1998,[paper 25]

1999[paper 26]

2011 Johan Håstad for proving optimal inapproximability result for various combinatorial problems 2001[paper 27]
2012 Elias Koutsoupias, Christos Papadimitriou, Noam Nisan, Amir Ronen, Tim Roughgarden and Éva Tardos for laying the foundations of algorithmic game theory[2] 2009,[paper 28] 2002,[paper 29] 2001[paper 30]
2013 Dan Boneh, Matthew K. Franklin, and Antoine Joux for multi-party Diffie–Hellman key exchange and the Boneh–Franklin scheme in cryptography[3] 2003,[paper 31]

2004[paper 32]

2014 Ronald Fagin, Amnon Lotem, and Moni Naor for Optimal Aggregation Algorithms for Middleware[4] 2003,[paper 33]
2015 Daniel Spielman, Shanghua Teng for their series of papers on nearly-linear-time Laplacian solvers[5]

2011[paper 34] 2013[paper 35] 2014[paper 36]

2016 Stephen Brookes and Peter W. O'Hearn for their invention of Concurrent Separation Logic 2007, 2007
2017[1] Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith for the invention of differential privacy 2006[paper 37]

Winning papers

  1. ↑ Babai, László; Moran, Shlomo (1988), "Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class" (PDF), Journal of Computer and System Sciences, Boston, MA: Academic Press, 36 (2): 254–276, ISSN 0022-0000, doi:10.1016/0022-0000(88)90028-1
  2. ↑ Goldwasser, S.; Micali, S.; Rackoff, C. (1989), "The knowledge complexity of interactive proof systems" (PDF), SIAM Journal on Computing, Philadelphia: Society for Industrial and Applied Mathematics, 18 (1): 186–208, ISSN 1095-7111, doi:10.1137/0218012
  3. ↑ Håstad, Johan (1989), "Almost Optimal Lower Bounds for Small Depth Circuits", in Micali, Silvio, Randomness and Computation (PDF), Advances in Computing Research, 5, JAI Press, pp. 6–20, ISBN 0-89232-896-7
  4. ↑ Immerman, Neil (1988), "Nondeterministic space is closed under complementation" (PDF), SIAM Journal on Computing, Philadelphia: Society for Industrial and Applied Mathematics, 17 (5): 935–938, ISSN 1095-7111, doi:10.1137/0217058
  5. ↑ Szelepcsényi, R. (1988), "The method of forced enumeration for nondeterministic automata", Acta Informatica, Springer-Verlag New York, Inc., 26 (3): 279–284, doi:10.1007/BF00299636
  6. ↑ Sinclair, A.; Jerrum, M. (1989), "Approximate counting, uniform generation and rapidly mixing Markov chains", Information and Computation, Elsevier, 82 (1): 93–133, ISSN 0890-5401, doi:10.1016/0890-5401(89)90067-9
  7. ↑ Jerrum, M.; Sinclair, Alistair (1989), "Approximating the permanent", SIAM Journal on Computing, Philadelphia: Society for Industrial and Applied Mathematics, 18 (6): 1149–1178, ISSN 1095-7111, doi:10.1137/0218077
  8. ↑ Halpern, Joseph; Moses, Yoram (1990), "Knowledge and common knowledge in a distributed environment" (PDF), Journal of the ACM, 37 (3): 549–587, doi:10.1145/79147.79161
  9. ↑ Toda, Seinosuke (1991), "PP is as hard as the polynomial-time hierarchy" (PDF), SIAM Journal on Computing, Philadelphia: Society for Industrial and Applied Mathematics, 20 (5): 865–877, ISSN 1095-7111, doi:10.1137/0220053
  10. ↑ Shor, Peter W. (1997), "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer" (PDF), SIAM Journal on Computing, Philadelphia: Society for Industrial and Applied Mathematics, 26 (5): 1484–1509, ISSN 1095-7111, doi:10.1137/S0097539795293172
  11. ↑ Vardi, Moshe Y.; Wolper, Pierre (1994), "Reasoning about infinite computations" (PDF), Information and Computation, Boston, MA: Academic Press, 115 (1): 1–37, ISSN 0890-5401, doi:10.1006/inco.1994.1092
  12. ↑ Feige, Uriel; Goldwasser, Shafi; Lovász, Laszlo; Safra, Shmuel; Szegedy, Mario (1996), "Interactive proofs and the hardness of approximating cliques" (PDF), Journal of the ACM, ACM, 43 (2): 268–292, ISSN 0004-5411, doi:10.1145/226643.226652
  13. ↑ Arora, Sanjeev; Safra, Shmuel (1998), "Probabilistic checking of proofs: a new characterization of NP" (PDF), Journal of the ACM, ACM, 45 (1): 70–122, ISSN 0004-5411, doi:10.1145/273865.273901
  14. ↑ Arora, Sanjeev; Lund, Carsten; Motwani, Rajeev; Sudan, Madhu; Szegedy, Mario (1998), "Proof verification and the hardness of approximation problems" (PDF), Journal of the ACM, ACM, 45 (3): 501–555, ISSN 0004-5411, doi:10.1145/278298.278306
  15. ↑ Sénizergues, Géraud (2001), "L(A) = L(B)? decidability results from complete formal systems", Theor. Comput. Sci., Essex, UK: Elsevier Science Publishers Ltd., 251 (1): 1–166, ISSN 0304-3975, doi:10.1016/S0304-3975(00)00285-1
  16. ↑ Freund, Y.; Schapire, R.E. (1997), "A decision-theoretic generalization of on-line learning and an application to boosting" (PDF), Journal of Computer and System Sciences, Elsevier, 55 (1): 119–139, ISSN 1090-2724, doi:10.1006/jcss.1997.1504
  17. ↑ Herlihy, Maurice; Shavit, Nir (1999), "The topological structure of asynchronous computability" (PDF), Journal of the ACM, 46 (6): 858–923, doi:10.1145/331524.331529. Gödel prize lecture
  18. ↑ Saks, Michael; Zaharoglou, Fotios (2000), "Wait-free k-set agreement is impossible: The topology of public knowledge", SIAM Journal on Computing, 29 (5): 1449–1483, doi:10.1137/S0097539796307698
  19. ↑ Alon, Noga; Matias, Yossi; Szegedy, Mario (1999), "The space complexity of approximating the frequency moments" (PDF), Journal of Computer and System Sciences, 58 (1): 137–147, doi:10.1006/jcss.1997.1545. First presented at the Symposium on Theory of Computing (STOC) in 1996.
  20. ↑ Agrawal, M.; Kayal, N.; Saxena, N. (2004), "PRIMES is in P" (PDF), Annals of Mathematics, 160 (2): 781–793, ISSN 0003-486X, doi:10.4007/annals.2004.160.781
  21. ↑ Razborov, Alexander A.; Rudich, Steven (1997), "Natural proofs", Journal of Computer and System Sciences, Boston, MA: Academic Press, 55 (1): 24–35, ISSN 0022-0000, doi:10.1006/jcss.1997.1494, ECCC TR94-010
  22. ↑ Spielman, Daniel A.; Teng, Shang-Hua (2004), "Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time" (PDF), J. ACM, ACM, 51 (3): 385–463, ISSN 0004-5411, doi:10.1145/990308.990310
  23. ↑ Reingold, Omer; Vadhan, Salil; Wigderson, Avi (2002), "Entropy waves, the zig-zag graph product, and new constant-degree expanders" (PDF), Annals of Mathematics, Annals of Mathematics, 155 (1): 157–187, ISSN 0003-486X, JSTOR 3062153, MR 1888797, doi:10.2307/3062153
  24. ↑ Reingold, Omer (2008), "Undirected connectivity in log-space", J. ACM, ACM, 55 (4): 1–24, ISSN 0004-5411, doi:10.1145/1391289.1391291
  25. ↑ Arora, Sanjeev (1998), "Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems", Journal of the ACM, ACM, 45 (5): 753–782, ISSN 0004-5411, doi:10.1145/290179.290180
  26. ↑ Mitchell, Joseph S. B. (1999), "Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems", SIAM Journal on Computing, Philadelphia: Society for Industrial and Applied Mathematics, 28 (4): 1298–1309, ISSN 1095-7111, doi:10.1137/S0097539796309764
  27. ↑ Håstad, Johan (2001), "Some optimal inapproximability results" (PDF), Journal of the ACM, ACM, 48: 798–859, ISSN 0004-5411, doi:10.1145/502090.502098
  28. ↑ Koutsoupias, Elias; Papadimitriou, Christos (2009). "Worst-case equilibria". Computer Science Review. 3 (2): 65–69. doi:10.1016/j.cosrev.2009.04.003.
  29. ↑ Roughgarden, Tim; Tardos, Éva (2002). "How bad is selfish routing?". Journal of the ACM. 49 (2): 236–259. doi:10.1145/506147.506153.
  30. ↑ Nisan, Noam; Ronen, Amir (2001). "Algorithmic Mechanism Design". Games and Economic Behavior. 35 (1-2): 166–196. doi:10.1006/game.1999.0790.
  31. ↑ Boneh, Dan; Franklin, Matthew (2003). "Identity-based encryption from the Weil pairing". SIAM Journal on Computing. 32 (3): 586–615. MR 2001745. doi:10.1137/S0097539701398521.
  32. ↑ Joux, Antoine (2004). "A one round protocol for tripartite Diffie-Hellman". Journal of Cryptology. 17 (4): 263–276. MR 2090557. doi:10.1007/s00145-004-0312-y.
  33. ↑ Fagin, Ronald; Lotem, Amnon; Naor, Moni (2003). "Optimal aggregation algorithms for middleware". Journal of Computer and System Sciences. 66 (4): 614–656. doi:10.1016/S0022-0000(03)00026-6.
  34. ↑ Spielman, Daniel A.; Teng, Shang-Hua (2011). "Spectral Sparsification of Graphs". SIAM Journal on Computing. 40 (4): 981–1025. ISSN 0097-5397. doi:10.1137/08074489X.
  35. ↑ Spielman, Daniel A.; Teng, Shang-Hua (2013). "A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning". SIAM Journal on Computing. 42 (1): 1–26. ISSN 0097-5397. doi:10.1137/080744888.
  36. ↑ Spielman, Daniel A.; Teng, Shang-Hua (2014). "Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems". SIAM Journal on Matrix Analysis and Applications. 35 (3): 835–885. ISSN 0895-4798. doi:10.1137/090771430.
  37. ↑ Dwork, Cynthia; McSherry, Frank; Nissim, Kobbi; Smith, Adam (2006). Halevi, Shai; Rabin, Tal, eds. Calibrating Noise to Sensitivity in Private Data Analysis. Theory of Cryptography (TCC). Lecture Notes in Computer Science. 3876. Springer-Verlag. pp. 265–284. ISBN 978-3-540-32731-8. doi:10.1007/11681878_14.

References

  1. 1 2 "2017 Gödel Prize". European Association for Theoretical Computer Science. EATCS. Retrieved 29 March 2017.
  2. ↑ "Three Papers Cited for Laying Foundation of Growth in Algorithmic Game Theory". 16 May 2012. Retrieved 16 May 2012.
  3. ↑ ACM Group Presents Gödel Prize for Advances in Cryptography: Three Computer Scientists Cited for Innovations that Improve Security, Association for Computing Machinery, May 29, 2013.
  4. ↑ Recipients Achieved Groundbreaking Results for Aggregating Data from Multiple Sources, Association for Computing Machinery, April 30, 2014.
  5. ↑ [http://www.sigact.org/Prizes/Godel/citation2015.pdf 2015 Gödel Prize Association for Computing Machinery announcement.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.