theory award

Gödel Prize

Honors outstanding papers in theoretical computer science with deep long-term influence.

1993founded

2sample events

3sample recipients

annualcadence

Search this award in the timeline Back to awards directory Method and sources Official award page

Scope

theoretical computer science

Awarding body: ACM SIGACT and EATCS. Region: global. Current page shows representative timeline coverage already loaded into the public atlas.

Sample recipients and influential works

Eshan Chattopadhyay, David Zuckerman

Explicit two-source extractors and resilient functions

2025

Recognized a breakthrough on explicit two-source extractors, resolving a long-open problem in randomness and complexity theory.

Event source: 2025 Gödel Prize citation (year/event-specific)

2020scomplexityrandomness extractiontheory

Related work / context

Explicit Two-Source Extractors and Resilient Functions (paper, 2016, canonical)

Ryan Williams

ACC circuit lower bounds breakthrough

2024

Recognized a landmark lower-bounds result showing that exponential-time nondeterministic computation cannot be captured by polynomial-size non-uniform ACC circuits.

Event source: 2024 Gödel Prize citation (year/event-specific)

2020scomplexitycircuit lower boundstheory

Related work / context

Non-Uniform ACC Circuit Lower Bounds (paper, 2011, canonical)