Will Perkins

Publication Activity (10 Years)

Years Active: 2022-2024
Publications (10 Years): 23

Top Topics

Bipartite Graph

Online Algorithms

Top Venues

Random Struct. Algorithms

Comb. Probab. Comput.

Publications

David J. Galvin, Gwen McKinley, Will Perkins, Michail Sarantis, Prasad Tetali
On the zeroes of hypergraph independence polynomials. Comb. Probab. Comput. 33 (1) (2024)
Will Perkins, Yuzhou Wang
On the hardness of finding balanced independent sets in random bipartite graphs. SODA (2024)
Aiya Kuchukova, Marcus Pappik, Will Perkins, Corrine Yap
Fast and Slow Mixing of the Kawasaki Dynamics on Bounded-Degree Graphs. CoRR (2024)
Antonio Blanca, Sarah Cannon, Will Perkins
Fast and Perfect Sampling of Subgraphs and Polymer Systems. ACM Trans. Algorithms 20 (1) (2024)
Will Perkins, Changji Xu
Frozen 1-RSB structure of the symmetric Ising perceptron. Random Struct. Algorithms 64 (4) (2024)
Christian Borgs, Jennifer T. Chayes, Tyler Helmuth, Will Perkins, Prasad Tetali
at all temperatures. Random Struct. Algorithms 63 (1) (2023)
Konrad Anand, Andreas Göbel, Marcus Pappik, Will Perkins
Perfect Sampling for Hard Spheres from Strong Spatial Mixing. CoRR (2023)
Ewan Davies, Will Perkins
Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs. SIAM J. Comput. 52 (2) (2023)
Tyler Helmuth, Holden Lee, Will Perkins, Mohan Ravichandran, Qiang Wu
Approximation Algorithms for the Random Field Ising Model. SIAM J. Discret. Math. 37 (3) (2023)
Konrad Anand, Andreas Göbel, Marcus Pappik, Will Perkins
Perfect Sampling for Hard Spheres from Strong Spatial Mixing. APPROX/RANDOM (2023)
Will Perkins, Yuzhou Wang
On the hardness of finding balanced independent sets in random bipartite graphs. CoRR (2023)
David Gamarnik, Eren C. Kizildag, Will Perkins, Changji Xu
Geometric Barriers for Stable and Online Algorithms for Discrepancy Minimization. COLT (2023)
Tyler Helmuth, Will Perkins, Michail Sarantis
Percolation on hypergraphs and the hard-core model. CoRR (2023)
David Gamarnik, Eren C. Kizildag, Will Perkins, Changji Xu
Geometric Barriers for Stable and Online Algorithms for Discrepancy Minimization. CoRR (2023)
Matthew Jenssen, Will Perkins, Aditya Potukuchi
Approximately counting independent sets in bipartite graphs via graph containers. Random Struct. Algorithms 63 (1) (2023)
David Gamarnik, Eren C. Kizildag, Will Perkins, Changji Xu
Algorithms and Barriers in the Symmetric Binary Perceptron Model. CoRR (2022)
David Gamarnik, Eren C. Kizildag, Will Perkins, Changji Xu
Algorithms and Barriers in the Symmetric Binary Perceptron Model. FOCS (2022)
Charlie Carlson, Ewan Davies, Alexandra Kolla, Will Perkins
Computational thresholds for the fixed-magnetization Ising model. STOC (2022)
Vishesh Jain, Will Perkins, Ashwin Sah, Mehtaab Sawhney
Approximate counting and sampling via local central limit theorems. STOC (2022)
Matthew Jenssen, Will Perkins, Aditya Potukuchi
Independent sets of a given size and structure in the hypercube. Comb. Probab. Comput. 31 (4) (2022)
David J. Galvin, Gwen McKinley, Will Perkins, Michail Sarantis, Prasad Tetali
On the zeroes of hypergraph independence polynomials. CoRR (2022)
Matthew Jenssen, Aditya Potukuchi, Will Perkins
Approximately counting independent sets in bipartite graphs via graph containers. SODA (2022)
Antonio Blanca, Sarah Cannon, Will Perkins
Fast and Perfect Sampling of Subgraphs and Polymer Systems. APPROX/RANDOM (2022)