STOC Test of Time Award winners by year

ACM SIGACT · Paper award · usually Jun · next expected Jun 2027

Official page

Winners

Generating hard instances of lattice problems30 Years2026Source ↗

A fast quantum mechanical algorithm for database search30 Years2026Source ↗

Efficient noise-tolerant learning from statistical queries30 Years2026Source ↗

Explicit capacity-achieving list-decodable codes20 Years2026Source ↗

The complexity of computing a Nash equilibrium20 Years2026Source ↗

Undirected ST-connectivity in log-space20 Years2026Source ↗

Graph isomorphism in quasipolynomial time10 Years2026Source ↗

A cost function for similarity-based hierarchical clustering10 Years2026Source ↗

Constant-round interactive proofs for delegating computation10 Years2026Source ↗

About this award

Three annual awards for papers from the ACM Symposium on Theory of Computing 10, 20 and 30 years earlier with lasting impact, chosen by a committee appointed by SIGACT.

Edition	Announced	Winners	Source
2026	Jun 20265 months ago	9

The next date is an estimate from the months past editions were announced (Jun); it changes when ACM SIGACT announces one.

New winnersSep 25, 2026Generating hard instances of lattice problems and 8 others named in the 2026 edition.

Award addedSep 25, 2026Now tracked: Three annual awards for papers from the ACM Symposium on Theory of Computing 10, 20 and 30 years earlier with lasting impact.