Will Perkins - RankMe

85 papers A* 17A 4Journal 59Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Optimal detection of planted stars via a random energy model. CoRR Ijay Narang, Will Perkins, Timothy L. H. Wee
2026	J	`jnl`	Sampling Colorings with Fixed Color Class Sizes. CoRR Aiya Kuchukova, Will Perkins, Xavier Povill
2025	J	`jnl`	Fixed-magnetization Ising on random graphs up to reconstruction. CoRR Reza Gheissari, Will Perkins, Corrine Yap
2025	A	`conf`	Hardness of Sampling for the Anti-Ferromagnetic Ising Model on Random Graphs. ITCS Neng Huang, Will Perkins, Aaron Potechin
2024	J	`jnl`	Fast and Perfect Sampling of Subgraphs and Polymer Systems. ACM Trans. Algorithms Antonio Blanca, Sarah Cannon, Will Perkins
2024	A	`conf`	Fast and Slow Mixing of the Kawasaki Dynamics on Bounded-Degree Graphs. APPROX/RANDOM Aiya Kuchukova, Marcus Pappik, Will Perkins, Corrine Yap
2024	J	`jnl`	Fast and Slow Mixing of the Kawasaki Dynamics on Bounded-Degree Graphs. CoRR Aiya Kuchukova, Marcus Pappik, Will Perkins, Corrine Yap
2024	J	`jnl`	Frozen 1-RSB structure of the symmetric Ising perceptron. Random Struct. Algorithms Will Perkins, Changji Xu
2024	J	`jnl`	Hardness of sampling for the anti-ferromagnetic Ising model on random graphs. CoRR Neng Huang, Will Perkins, Aaron Potechin
2024	A*	`conf`	On the hardness of finding balanced independent sets in random bipartite graphs. SODA Will Perkins, Yuzhou Wang
2024	J	`jnl`	On the zeroes of hypergraph independence polynomials. Comb. Probab. Comput. David J. Galvin, Gwen McKinley, Will Perkins, Michail Sarantis, Prasad Tetali
2024	J	`jnl`	Pirogov-Sinai Theory Beyond Lattices. CoRR Sarah Cannon, Tyler Helmuth, Will Perkins
2024	J	`jnl`	Sampling and counting triangle-free graphs near the critical density. CoRR Matthew Jenssen, Will Perkins, Aditya Potukuchi, Michael Simkin
2024	A*	`conf`	Sampling, Counting, and Large Deviations for Triangle-Free Graphs Near the Critical Density. FOCS Matthew Jenssen, Will Perkins, Aditya Potukuchi, Michael Simkin
2023	J	`jnl`	Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs. SIAM J. Comput. Ewan Davies, Will Perkins
2023	J	`jnl`	Approximately counting independent sets in bipartite graphs via graph containers. Random Struct. Algorithms Matthew Jenssen, Will Perkins, Aditya Potukuchi
2023	J	`jnl`	Approximation Algorithms for the Random Field Ising Model. SIAM J. Discret. Math. Tyler Helmuth, Holden Lee, Will Perkins, Mohan Ravichandran, Qiang Wu
2023	J	`jnl`	Efficient sampling and counting algorithms for the Potts model on Random Struct. Algorithms Christian Borgs, Jennifer T. Chayes, Tyler Helmuth, Will Perkins, Prasad Tetali
2023	A*	`conf`	Geometric Barriers for Stable and Online Algorithms for Discrepancy Minimization. COLT David Gamarnik, Eren C. Kizildag, Will Perkins, Changji Xu
2023	J	`jnl`	Geometric Barriers for Stable and Online Algorithms for Discrepancy Minimization. CoRR David Gamarnik, Eren C. Kizildag, Will Perkins, Changji Xu
2023	J	`jnl`	Maximum entropy and integer partitions. Comb. Theory Gweneth McKinley, Marcus Michelen, Will Perkins
2023	J	`jnl`	On the hardness of finding balanced independent sets in random bipartite graphs. CoRR Will Perkins, Yuzhou Wang
2023	A	`conf`	Perfect Sampling for Hard Spheres from Strong Spatial Mixing. APPROX/RANDOM Konrad Anand, Andreas Göbel, Marcus Pappik, Will Perkins
2023	J	`jnl`	Perfect Sampling for Hard Spheres from Strong Spatial Mixing. CoRR Konrad Anand, Andreas Göbel, Marcus Pappik, Will Perkins
2022	A*	`conf`	Algorithms and Barriers in the Symmetric Binary Perceptron Model. FOCS David Gamarnik, Eren C. Kizildag, Will Perkins, Changji Xu
2022	J	`jnl`	Algorithms and Barriers in the Symmetric Binary Perceptron Model. CoRR David Gamarnik, Eren C. Kizildag, Will Perkins, Changji Xu
2022	A*	`conf`	Approximate counting and sampling via local central limit theorems. STOC Vishesh Jain, Will Perkins, Ashwin Sah, Mehtaab Sawhney
2022	A*	`conf`	Approximately counting independent sets in bipartite graphs via graph containers. SODA Matthew Jenssen, Aditya Potukuchi, Will Perkins
2022	A*	`conf`	Computational thresholds for the fixed-magnetization Ising model. STOC Charlie Carlson, Ewan Davies, Alexandra Kolla, Will Perkins
2022	A	`conf`	Fast and Perfect Sampling of Subgraphs and Polymer Systems. APPROX/RANDOM Antonio Blanca, Sarah Cannon, Will Perkins
2022	J	`jnl`	Fast and perfect sampling of subgraphs and polymer systems. CoRR Antonio Blanca, Sarah Cannon, Will Perkins
2022	J	`jnl`	Independent sets of a given size and structure in the hypercube. Comb. Probab. Comput. Matthew Jenssen, Will Perkins, Aditya Potukuchi
2022	J	`jnl`	On the number of independent sets in uniform, regular, linear hypergraphs. Eur. J. Comb. Emma Cohen, Will Perkins, Michail Sarantis, Prasad Tetali
2022	J	`jnl`	On the zeroes of hypergraph independence polynomials. CoRR David J. Galvin, Gwen McKinley, Will Perkins, Michail Sarantis, Prasad Tetali
2022	J	`jnl`	Strong spatial mixing for repulsive point processes. CoRR Marcus Michelen, Will Perkins
2021	J	`jnl`	A proof of the upper matching conjecture for large graphs. J. Comb. Theory B Ewan Davies, Matthew Jenssen, Will Perkins
2021	J	`jnl`	Approximate counting and sampling via local central limit theorems. CoRR Vishesh Jain, Will Perkins, Ashwin Sah, Mehtaab Sawhney
2021	A*	`conf`	Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs. ICALP Ewan Davies, Will Perkins
2021	J	`jnl`	Approximately counting independent sets in bipartite graphs via graph containers. CoRR Matthew Jenssen, Will Perkins, Aditya Potukuchi
2021	J	`jnl`	Approximately counting independent sets of a given size in bounded-degree graphs. CoRR Ewan Davies, Will Perkins
2021	J	`jnl`	Approximation algorithms for the random-field Ising model. CoRR Tyler Helmuth, Holden Lee, Will Perkins, Mohan Ravichandran, Qiang Wu
2021	J	`jnl`	Computational thresholds for the fixed-magnetization Ising model. CoRR Charlie Carlson, Ewan Davies, Alexandra Kolla, Will Perkins
2021	J	`jnl`	Fast algorithms at low temperatures via Markov chains. Random Struct. Algorithms Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, Eric Vigoda
2021	A*	`conf`	Frozen 1-RSB structure of the symmetric Ising perceptron. STOC Will Perkins, Changji Xu
2020	J	`jnl`	Algorithms for #BIS-Hard Problems on Expander Graphs. SIAM J. Comput. Matthew Jenssen, Peter Keevash, Will Perkins
2020	J	`jnl`	Correlation decay for hard spheres via Markov chains. CoRR Tyler Helmuth, Will Perkins, Samantha Petti
2020	A*	`conf`	Counting independent sets in unbalanced bipartite graphs. SODA Sarah Cannon, Will Perkins
2020	A*	`conf`	Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures. STOC Christian Borgs, Jennifer T. Chayes, Tyler Helmuth, Will Perkins, Prasad Tetali
2020	J	`jnl`	Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs. CoRR Tyler Helmuth, Matthew Jenssen, Will Perkins
2019	A*	`conf`	Algorithmic Pirogov-Sinai theory. STOC Tyler Helmuth, Will Perkins, Guus Regts
2019	A*	`conf`	Algorithms for #BIS-hard problems on expander graphs. SODA Matthew Jenssen, Peter Keevash, Will Perkins
2019	J	`jnl`	Counting independent sets in unbalanced bipartite graphs. CoRR Sarah Cannon, Will Perkins
2019	J	`jnl`	Efficient sampling and counting algorithms for the Potts model on Z CoRR Christian Borgs, Jennifer T. Chayes, Tyler Helmuth, Will Perkins, Prasad Tetali
2019	—	`conf`	Fast Algorithms at Low Temperatures via Markov Chains. APPROX-RANDOM Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, Eric Vigoda
2018	J	`jnl`	Algorithmic Pirogov-Sinai theory. CoRR Tyler Helmuth, Will Perkins, Guus Regts
2018	J	`jnl`	Algorithms for #BIS-hard problems on expander graphs. CoRR Matthew Jenssen, Peter Keevash, Will Perkins
2018	J	`jnl`	Counting independent sets in cubic graphs of given girth. J. Comb. Theory B Guillem Perarnau, Will Perkins
2018	J	`jnl`	Extremes of the internal energy of the Potts model on cubic graphs. Random Struct. Algorithms Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts
2018	J	`jnl`	On the Complexity of Random Satisfiability Problems with Planted Solutions. SIAM J. Comput. Vitaly Feldman, Will Perkins, Santosh S. Vempala
2018	—	`conf`	On the Resilience of Bipartite Networks. Allerton Shelby Heinecke, Will Perkins, Lev Reyzin
2018	J	`jnl`	Tight bounds on the coefficients of partition functions via stability. J. Comb. Theory A Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts
2017	J	`jnl`	Independent sets, matchings, and occupancy fractions. J. Lond. Math. Soc. Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts
2017	A*	`conf`	Information-theoretic thresholds from the cavity method. STOC Amin Coja-Oghlan, Florent Krzakala, Will Perkins, Lenka Zdeborová
2017	J	`jnl`	Limits of discrete distributions and Gibbs measures on random graphs. Eur. J. Comb. Amin Coja-Oghlan, Will Perkins, Kathrin Skubch
2017	J	`jnl`	On the Widom-Rowlinson Occupancy Fraction in Regular Graphs. Comb. Probab. Comput. Emma Cohen, Will Perkins, Prasad Tetali
2017	J	`jnl`	The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph. Eur. J. Comb. Emma Cohen, Péter Csikvári, Will Perkins, Prasad Tetali
2017	J	`jnl`	Tight bounds on the coefficients of partition functions via stability. Electron. Notes Discret. Math. Ewan Davies, Matthew Jenssen, Barnaby Roberts, Will Perkins
2016	—	`conf`	Belief Propagation on Replica Symmetric Random Factor Graph Models. APPROX-RANDOM Amin Coja-Oghlan, Will Perkins
2016	J	`jnl`	Belief Propagation on replica symmetric random factor graph models. CoRR Amin Coja-Oghlan, Will Perkins
2016	J	`jnl`	Information-theoretic thresholds from the cavity method. CoRR Amin Coja-Oghlan, Florent Krzakala, Will Perkins, Lenka Zdeborová
2016	A*	`conf`	Spectral thresholds in the bipartite stochastic block model. COLT Laura Florescu, Will Perkins
2015	A*	`conf`	On the Complexity of Random Satisfiability Problems with Planted Solutions. STOC Vitaly Feldman, Will Perkins, Santosh S. Vempala
2015	J	`jnl`	Random Random Struct. Algorithms Will Perkins
2015	J	`jnl`	Spectral Thresholds in the Bipartite Stochastic Block Model. CoRR Laura Florescu, Will Perkins
2015	—	`conf`	Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted CSP's. NIPS Vitaly Feldman, Will Perkins, Santosh S. Vempala
2014	—	`conf`	On Sharp Thresholds in Random Geometric Graphs. APPROX-RANDOM Milan Bradonjic, Will Perkins
2014	J	`jnl`	On the Complexity of Random Satisfiability Problems with Planted Solutions. Electron. Colloquium Comput. Complex. Vitaly Feldman, Will Perkins, Santosh S. Vempala
2014	J	`jnl`	Subsampled Power Iteration: a New Algorithm for Block Models and Planted CSP's. CoRR Vitaly Feldman, Will Perkins, Santosh S. Vempala
2013	J	`jnl`	On the Complexity of Random Satisfiability Problems with Planted Solutions. CoRR Vitaly Feldman, Will Perkins, Santosh S. Vempala
2013	J	`jnl`	On the Resilience of Bipartite Networks. CoRR Will Perkins, Lev Reyzin
2013	J	`jnl`	The Bohman-Frieze process near criticality. Random Struct. Algorithms Mihyun Kang, Will Perkins, Joel Spencer
2013	J	`jnl`	The forgetfulness of balls and bins. Random Struct. Algorithms Will Perkins
2013	J	`jnl`	Thresholds for Random Geometric k-SAT. CoRR Milan Bradonjic, Will Perkins
2012	J	`jnl`	Random k-SAT and the Power of Two Choices CoRR Will Perkins
2010	A*	`conf`	Hardness of Finding Independent Sets in Almost 3-Colorable Graphs. FOCS Irit Dinur, Subhash Khot, Will Perkins, Muli Safra