Skip to content

STOC Test of Time Award winners by year

ACM SIGACT · paper · usually Jun · next expected Jun 2027 · 1 edition loaded

Official page

STOC Test of Time Award 2026

Announced Jun 2026

9 of 9 papers

WinnerSource
Generating hard instances of lattice problems30 Years
A fast quantum mechanical algorithm for database search30 Years
Efficient noise-tolerant learning from statistical queries30 Years
Explicit capacity-achieving list-decodable codes20 Years
The complexity of computing a Nash equilibrium20 Years
Undirected ST-connectivity in log-space20 Years
Graph isomorphism in quasipolynomial time10 Years
A cost function for similarity-based hierarchical clustering10 Years
Constant-round interactive proofs for delegating computation10 Years

Source: sigact.org/prizes/stoc_tot.html

About this award

EditionAnnouncedWinners
2026Jun 20269

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

ItemWhat changed
STOC Test of Time AwardSep 25, 2026New winnerAdded

Sources: each organizer's own list, linked on every winner, read monthly in each award's announcement window. A list is the organizer's judgment, not ours. Logos via logo.dev; trademarks belong to their owners.

Award winners by email

At most once a month, only when a tracked award or list has published new winners.

Double opt-in. Unsubscribe any time.