STOC Test of Time Award
The 2024 STOC Test of Time Award recognizes papers published in the Proceedings of the Annual ACM Symposium on Theory of Computing. This is the fourth year of this annual award. There are three awards, targeting the STOC conferences 10, 20, and 30 years prior to the year in which the award is given. While there is a preference for papers in the target years (and nominations from those years are encouraged), in each of these award categories it is also possible to nominate STOC conference papers published up to four conferences earlier than the targeted conference. Thus, the 2024 STOC Test of Time Awards are for papers presented at the STOC conferences in 20102014, 20002004, and 1990–1994. The awards will be presented at STOC 2024, include a prize of US $
500 per paper as well as complimentary registration for all authors who attend the conference at which the award is given.
Lists of Papers
Here are links to the DBLP pages for the STOC conferences whose papers are eligible for 2024:
Nomination Procedure
Nominations for 2024 are closed. Information regarding nominations for 2025 will be given when it becomes available.
Selection
The winners will be selected by a committee appointed by the SIGACT Executive Committee. For 2024 the selection committee consists of Sandy Irani (UC Irvine) , Michael Goodrich (UC Irvine), Mike Paterson (Warwick), and David Shmoys (chair, Cornell).
In selecting the Test of Time Award winners, the Committee will pay particular attention to longterm impact. This impact can come in many forms, including but not limited to:
 Opening up a new area of research
 Introducing new techniques
 Solving a problem of lasting importance
 Stimulating advances in other areas of computer science or in other disciplines.
The committee expects to select exactly one paper for each award. However, when circumstances justify it, up to three may be selected. The committee will consider papers that were not explicitly nominated and gather additional input from experts, but formal nominations are extremely helpful in the committee’s deliberations and strongly encouraged.
Winners

(30 years) Y. Azar, A.Z. Broder, A.R. Karlin, and E. Upfal, “Balanced Allocations”, 1994.

(30 years) M.X. Goemans and D.P. Williamson, “. 878Approximation Algorithms for MAX CUT and MAX 2SAT”, 1994.

(30 years) R.M. Karp, U.V. Vazirani, V.V. Vazirani, “An Optimal Algorithm for Online Bipartite Matching”, 1990.

(20 years) S. HarPeled and S. Mazumdar, “On Coresets for kMeans and kMedian Clustering”, 2004.

(20 years) J. Kleinberg, “The SmallWorld Phenomenon: An Algorithmic Perspective”, 2000.

(10 years) A. Sahai and B. Waters, “How to Use Indistinguishability Obfuscation: Deniable Encryption, and More”, 2014.

(10 years) A. Dasgupta, R. Kumar, and T. Sarlós, “A Sparse JohnsonLindenstrauss transform”, 2010.

(30 years) Ajit Agrawal, Philip Klein, and R. Ravi, “When trees collide: An approximation algorithm for the generalized Steiner problem on networks”, 1989.

(30 years) Ethan Bernstein and Umesh Vazirani, “Quantum complexity theory”, 1993.

(20 years) Miklos Atjai, Ravi Kumar, and D. Sivakumar, “A sieve algorithm for the shortest lattice vector problem”, 2001.

(20 years) Oded Regev, “New latticebased cryptographic constructions”, 2003.

(10 years) Kenneth L Clarkson and David P Woodruff, “Low rank approximation and regression in input sparsity time”, 2013.

(30 years) Manuel Blum, Michael Luby, and Ronitt Rubinfeld, “Selftesting/correcting with applications to numerical problems”, 1990.

(30 years) Danny Dolev, Cynthia Dwork, and Moni Naor, “Nonmalleable cryptography”, 1991.

(30 years) Noam Nisan, “Pseudorandom generators for spacebounded computation”, 1990.

(20 years) Moses Charikar, “Similarity estimation techniques from rounding algorithms”, 2002.

(20 years) Subhash Khot, “On the power of unique 2prover 1round games”, 2002.

(10 years) Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, and Ronald de Wolf, “Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds”, 2012.

(10 years) Craig Gentry, “Fully homomorphic encryption using ideal lattices”, 2009.

(30 years) Michael BenOr, Shafi Goldwasser, and Avi Wigderson, “Completeness theorems for noncryptographic faulttolerant distributed computation”, 1988.

(30 years) David Chaum, Claude Crépeau, and Ivan Damgård, “Multiparty unconditionally secure protocols”, 1988.

(30 years) Tal Rabin and Michael BenOr, “Verifiable secretsharing and multiparty protocols with honest majority”, 1989.

(20 years) Mark Jerrum, Alistair Sinclair, and Eric Vigoda, “A polynomialtime approximation algorithm for the permanent of a matrix with nonnegative entries”, 2001.

(20 years) Daniel A. Spielman and ShangHua Teng, “Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time”, 2001.

(20 years) Mikkel Thorup and Uri Zwick, “Approximate distance oracles”, 2001.

(10 years) Scott Aaronson and Alex Arkhipov, “The computational complexity of linear optics”, 2011.