| 2026 | MFCS | Some Recent Developments in Space Complexity (Invited Talk). | R. Ryan Williams |
| 2025 | STOC | When Connectivity Is Hard, Random Walks Are Easy with Non-determinism. | Dean Doron, Edward Pyne, Roei Tell, R. Ryan Williams |
| 2025 | STOC | Simulating Time with Square-Root Space. | R. Ryan Williams |
| 2024 | STOC | Beating Brute Force for Compression Problems. | Shuichi Hirahara, Rahul Ilango, R. Ryan Williams |
| 2024 | STOC | Self-Improvement for Circuit-Analysis Problems. | R. Ryan Williams |
| 2023 | STOC | Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic. | Rahul Ilango, Jiatu Li, R. Ryan Williams |
| 2022 | MFCS | On the Number of Quantifiers as a Complexity Measure. | Ronald Fagin, Jonathan Lenchner, Nikhil Vyas, R. Ryan Williams |
| 2022 | SODA | Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions. | Lijie Chen, Ce Jin, R. Ryan Williams, Hongxun Wu |
| 2021 | FOCS | Constructive Separations and Their Consequences. | Lijie Chen, Ce Jin, Rahul Santhanam, R. Ryan Williams |
| 2021 | LICS | Complexity Lower Bounds from Algorithm Design. | R. Ryan Williams |
| 2021 | MFCS | Black-Box Hypotheses and Lower Bounds. | Brynmor Chapman, R. Ryan Williams |
| 2020 | FOCS | Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization. | Lijie Chen, Xin Lyu, R. Ryan Williams |
| 2020 | SODA | Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High Dimensions. | Josh Alman, Timothy M. Chan, R. Ryan Williams |
| 2020 | STOC | Sharp threshold results for computational complexity. | Lijie Chen, Ce Jin, R. Ryan Williams |
| 2020 | STACS | Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms. | Nikhil Vyas, R. Ryan Williams |
| 2019 | FOCS | Hardness Magnification for all Sparse NP Languages. | Lijie Chen, Ce Jin, R. Ryan Williams |
| 2019 | STOC | Weak lower bounds on resource-bounded compression imply strong separations of complexity classes. | Dylan M. McKay, Cody D. Murray, R. Ryan Williams |
| 2019 | SAT | On Super Strong ETH. | Nikhil Vyas, R. Ryan Williams |
| 2018 | SODA | Tight Hardness for Shortest Cycles and Paths in Sparse Graphs. | Andrea Lincoln, Virginia Vassilevska Williams, R. Ryan Williams |
| 2018 | SODA | Counting Solutions to Polynomial Systems via Reductions. | R. Ryan Williams |
| 2018 | STOC | Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP. | Cody Murray, R. Ryan Williams |
| 2017 | FOCS | Distributed PCP Theorems for Hardness of Approximation in P. | Amir Abboud, Aviad Rubinstein, R. Ryan Williams |
| 2017 | SODA | Completeness for First-Order Properties on Sparse Structures with Algorithmic Applications. | Jiawei Gao, Russell Impagliazzo, Antonina Kolokolova, R. Ryan Williams |
| 2017 | SODA | Faster Online Matrix-Vector Multiplication. | Kasper Green Larsen, R. Ryan Williams |
| 2017 | SODA | Beating Brute Force for Systems of Polynomial Equations over Finite Fields. | Daniel Lokshtanov, Ramamohan Paturi, Suguru Tamaki, R. Ryan Williams, Huacheng Yu |
| 2017 | STOC | Probabilistic rank and matrix rigidity. | Josh Alman, R. Ryan Williams |
| 2016 | FOCS | Polynomial Representations of Threshold Functions and Algorithmic Applications. | Josh Alman, Timothy M. Chan, R. Ryan Williams |
| 2016 | ICALP | Deterministic Time-Space Trade-Offs for k-SUM. | Andrea Lincoln, Virginia Vassilevska Williams, Joshua R. Wang, R. Ryan Williams |
| 2015 | CSL | Thinking Algorithmically About Impossibility (Invited Talk). | R. Ryan Williams |