| 2026 | ICALP | Sampling Colorings with Fixed Color Class Sizes. | Aiya Kuchukova, Will Perkins, Xavier Povill |
| 2024 | FOCS | Sampling, Counting, and Large Deviations for Triangle-Free Graphs Near the Critical Density. | Matthew Jenssen, Will Perkins, Aditya Potukuchi, Michael Simkin |
| 2024 | SODA | On the hardness of finding balanced independent sets in random bipartite graphs. | Will Perkins, Yuzhou Wang |
| 2023 | COLT | Geometric Barriers for Stable and Online Algorithms for Discrepancy Minimization. | David Gamarnik, Eren C. Kizildag, Will Perkins, Changji Xu |
| 2022 | FOCS | Algorithms and Barriers in the Symmetric Binary Perceptron Model. | David Gamarnik, Eren C. Kizildag, Will Perkins, Changji Xu |
| 2022 | SODA | Approximately counting independent sets in bipartite graphs via graph containers. | Matthew Jenssen, Aditya Potukuchi, Will Perkins |
| 2022 | STOC | Computational thresholds for the fixed-magnetization Ising model. | Charlie Carlson, Ewan Davies, Alexandra Kolla, Will Perkins |
| 2022 | STOC | Approximate counting and sampling via local central limit theorems. | Vishesh Jain, Will Perkins, Ashwin Sah, Mehtaab Sawhney |
| 2021 | ICALP | Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs. | Ewan Davies, Will Perkins |
| 2021 | STOC | Frozen 1-RSB structure of the symmetric Ising perceptron. | Will Perkins, Changji Xu |
| 2020 | SODA | Counting independent sets in unbalanced bipartite graphs. | Sarah Cannon, Will Perkins |
| 2020 | STOC | Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures. | Christian Borgs, Jennifer T. Chayes, Tyler Helmuth, Will Perkins, Prasad Tetali |
| 2019 | SODA | Algorithms for #BIS-hard problems on expander graphs. | Matthew Jenssen, Peter Keevash, Will Perkins |
| 2019 | STOC | Algorithmic Pirogov-Sinai theory. | Tyler Helmuth, Will Perkins, Guus Regts |
| 2017 | STOC | Information-theoretic thresholds from the cavity method. | Amin Coja-Oghlan, Florent Krzakala, Will Perkins, Lenka Zdeborov |
| 2016 | COLT | Spectral thresholds in the bipartite stochastic block model. | Laura Florescu, Will Perkins |
| 2015 | STOC | On the Complexity of Random Satisfiability Problems with Planted Solutions. | Vitaly Feldman, Will Perkins, Santosh S. Vempala |
| 2010 | FOCS | Hardness of Finding Independent Sets in Almost 3-Colorable Graphs. | Irit Dinur, Subhash Khot, Will Perkins, Muli Safra |