default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWill Perkins 0001
Person information
- affiliation: Georgia Institute of Technology, Atlanta, GA, USA
- affiliation (2018 - 2022): University of Illinois at Chicago, Department of Mathematics, Statistics and Computer Science, USA
- affiliation (2015 - 2018): University of Birmingham, UK
- affiliation (2011 - 2014): Georgia Institute of Technology, Atlanta, GA, USA
- affiliation (PhD 2011): New York University, NY, USA
Other persons with the same name
- William Perkins — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]David J. Galvin, Gwen McKinley, Will Perkins
, Michail Sarantis, Prasad Tetali:
On the zeroes of hypergraph independence polynomials. Comb. Probab. Comput. 33(1): 65-84 (2024)- [j24]Will Perkins, Changji Xu:
Frozen 1-RSB structure of the symmetric Ising perceptron. Random Struct. Algorithms 64(4): 856-877 (2024) - [j23]Antonio Blanca, Sarah Cannon, Will Perkins:
Fast and Perfect Sampling of Subgraphs and Polymer Systems. ACM Trans. Algorithms 20(1): 5:1-5:30 (2024) - [c24]Aiya Kuchukova, Marcus Pappik, Will Perkins, Corrine Yap:
Fast and Slow Mixing of the Kawasaki Dynamics on Bounded-Degree Graphs. APPROX/RANDOM 2024: 56:1-56:24 - [c23]Will Perkins, Yuzhou Wang:
On the hardness of finding balanced independent sets in random bipartite graphs. SODA 2024: 2376-2397 - [i28]Aiya Kuchukova, Marcus Pappik, Will Perkins, Corrine Yap:
Fast and Slow Mixing of the Kawasaki Dynamics on Bounded-Degree Graphs. CoRR abs/2405.06209 (2024) - 2023
- [j22]Christian Borgs, Jennifer T. Chayes, Tyler Helmuth, Will Perkins, Prasad Tetali:
Efficient sampling and counting algorithms for the Potts model on ℤd at all temperatures. Random Struct. Algorithms 63(1): 130-170 (2023) - [j21]Matthew Jenssen, Will Perkins, Aditya Potukuchi:
Approximately counting independent sets in bipartite graphs via graph containers. Random Struct. Algorithms 63(1): 215-241 (2023) - [j20]Ewan Davies, Will Perkins:
Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs. SIAM J. Comput. 52(2): 618-640 (2023) - [j19]Tyler Helmuth, Holden Lee, Will Perkins, Mohan Ravichandran, Qiang Wu:
Approximation Algorithms for the Random Field Ising Model. SIAM J. Discret. Math. 37(3): 1610-1629 (2023) - [c22]Konrad Anand, Andreas Göbel, Marcus Pappik, Will Perkins:
Perfect Sampling for Hard Spheres from Strong Spatial Mixing. APPROX/RANDOM 2023: 38:1-38:18 - [c21]David Gamarnik, Eren C. Kizildag, Will Perkins, Changji Xu:
Geometric Barriers for Stable and Online Algorithms for Discrepancy Minimization. COLT 2023: 3231-3263 - [i27]David Gamarnik, Eren C. Kizildag, Will Perkins, Changji Xu:
Geometric Barriers for Stable and Online Algorithms for Discrepancy Minimization. CoRR abs/2302.06485 (2023) - [i26]Konrad Anand, Andreas Göbel, Marcus Pappik, Will Perkins:
Perfect Sampling for Hard Spheres from Strong Spatial Mixing. CoRR abs/2305.02450 (2023) - [i25]Will Perkins, Yuzhou Wang:
On the hardness of finding balanced independent sets in random bipartite graphs. CoRR abs/2307.13921 (2023) - 2022
- [j18]Matthew Jenssen, Will Perkins, Aditya Potukuchi:
Independent sets of a given size and structure in the hypercube. Comb. Probab. Comput. 31(4): 702-720 (2022) - [j17]Emma Cohen, Will Perkins, Michail Sarantis, Prasad Tetali:
On the number of independent sets in uniform, regular, linear hypergraphs. Eur. J. Comb. 99: 103401 (2022) - [c20]Antonio Blanca, Sarah Cannon, Will Perkins:
Fast and Perfect Sampling of Subgraphs and Polymer Systems. APPROX/RANDOM 2022: 4:1-4:18 - [c19]David Gamarnik, Eren C. Kizildag, Will Perkins, Changji Xu:
Algorithms and Barriers in the Symmetric Binary Perceptron Model. FOCS 2022: 576-587 - [c18]Matthew Jenssen, Aditya Potukuchi, Will Perkins:
Approximately counting independent sets in bipartite graphs via graph containers. SODA 2022: 499-516 - [c17]Charlie Carlson, Ewan Davies, Alexandra Kolla, Will Perkins:
Computational thresholds for the fixed-magnetization Ising model. STOC 2022: 1459-1472 - [c16]Vishesh Jain, Will Perkins, Ashwin Sah, Mehtaab Sawhney:
Approximate counting and sampling via local central limit theorems. STOC 2022: 1473-1486 - [i24]Antonio Blanca, Sarah Cannon, Will Perkins:
Fast and perfect sampling of subgraphs and polymer systems. CoRR abs/2202.05907 (2022) - [i23]Marcus Michelen, Will Perkins:
Strong spatial mixing for repulsive point processes. CoRR abs/2202.08753 (2022) - [i22]David Gamarnik, Eren C. Kizildag, Will Perkins, Changji Xu:
Algorithms and Barriers in the Symmetric Binary Perceptron Model. CoRR abs/2203.15667 (2022) - [i21]David J. Galvin, Gwen McKinley, Will Perkins, Michail Sarantis, Prasad Tetali:
On the zeroes of hypergraph independence polynomials. CoRR abs/2211.00464 (2022) - 2021
- [j16]Ewan Davies, Matthew Jenssen, Will Perkins:
A proof of the upper matching conjecture for large graphs. J. Comb. Theory B 151: 393-416 (2021) - [j15]Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, Eric Vigoda:
Fast algorithms at low temperatures via Markov chains. Random Struct. Algorithms 58(2): 294-321 (2021) - [c15]Ewan Davies, Will Perkins:
Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs. ICALP 2021: 62:1-62:18 - [c14]Will Perkins, Changji Xu:
Frozen 1-RSB structure of the symmetric Ising perceptron. STOC 2021: 1579-1588 - [i20]Ewan Davies, Will Perkins:
Approximately counting independent sets of a given size in bounded-degree graphs. CoRR abs/2102.04984 (2021) - [i19]Vishesh Jain, Will Perkins, Ashwin Sah, Mehtaab Sawhney:
Approximate counting and sampling via local central limit theorems. CoRR abs/2108.01161 (2021) - [i18]Tyler Helmuth, Holden Lee, Will Perkins, Mohan Ravichandran, Qiang Wu:
Approximation algorithms for the random-field Ising model. CoRR abs/2108.11889 (2021) - [i17]Matthew Jenssen, Will Perkins, Aditya Potukuchi:
Approximately counting independent sets in bipartite graphs via graph containers. CoRR abs/2109.03744 (2021) - [i16]Charlie Carlson, Ewan Davies, Alexandra Kolla, Will Perkins:
Computational thresholds for the fixed-magnetization Ising model. CoRR abs/2111.03033 (2021) - 2020
- [j14]Matthew Jenssen, Peter Keevash, Will Perkins:
Algorithms for #BIS-Hard Problems on Expander Graphs. SIAM J. Comput. 49(4): 681-710 (2020) - [c13]Sarah Cannon, Will Perkins:
Counting independent sets in unbalanced bipartite graphs. SODA 2020: 1456-1466 - [c12]Christian Borgs, Jennifer T. Chayes, Tyler Helmuth, Will Perkins, Prasad Tetali:
Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures. STOC 2020: 738-751 - [i15]Tyler Helmuth, Will Perkins, Samantha Petti:
Correlation decay for hard spheres via Markov chains. CoRR abs/2001.05323 (2020) - [i14]Tyler Helmuth, Matthew Jenssen, Will Perkins:
Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs. CoRR abs/2006.11580 (2020)
2010 – 2019
- 2019
- [c11]Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, Eric Vigoda:
Fast Algorithms at Low Temperatures via Markov Chains. APPROX-RANDOM 2019: 41:1-41:14 - [c10]Matthew Jenssen, Peter Keevash, Will Perkins:
Algorithms for #BIS-hard problems on expander graphs. SODA 2019: 2235-2247 - [c9]Tyler Helmuth, Will Perkins, Guus Regts:
Algorithmic Pirogov-Sinai theory. STOC 2019: 1009-1020 - [i13]Sarah Cannon, Will Perkins:
Counting independent sets in unbalanced bipartite graphs. CoRR abs/1906.01666 (2019) - [i12]Christian Borgs, Jennifer T. Chayes, Tyler Helmuth, Will Perkins, Prasad Tetali:
Efficient sampling and counting algorithms for the Potts model on Zd at all temperatures. CoRR abs/1909.09298 (2019) - 2018
- [j13]Guillem Perarnau, Will Perkins:
Counting independent sets in cubic graphs of given girth. J. Comb. Theory B 133: 211-242 (2018) - [j12]Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts:
Tight bounds on the coefficients of partition functions via stability. J. Comb. Theory A 160: 1-30 (2018) - [j11]Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts:
Extremes of the internal energy of the Potts model on cubic graphs. Random Struct. Algorithms 53(1): 59-75 (2018) - [j10]Vitaly Feldman, Will Perkins, Santosh S. Vempala:
On the Complexity of Random Satisfiability Problems with Planted Solutions. SIAM J. Comput. 47(4): 1294-1338 (2018) - [c8]Shelby Heinecke, Will Perkins, Lev Reyzin:
On the Resilience of Bipartite Networks. Allerton 2018: 72-77 - [i11]Tyler Helmuth, Will Perkins, Guus Regts:
Algorithmic Pirogov-Sinai theory. CoRR abs/1806.11548 (2018) - [i10]Matthew Jenssen, Peter Keevash, Will Perkins:
Algorithms for #BIS-hard problems on expander graphs. CoRR abs/1807.04804 (2018) - 2017
- [j9]Emma Cohen, Will Perkins, Prasad Tetali:
On the Widom-Rowlinson Occupancy Fraction in Regular Graphs. Comb. Probab. Comput. 26(2): 183-194 (2017) - [j8]Emma Cohen, Péter Csikvári, Will Perkins, Prasad Tetali:
The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph. Eur. J. Comb. 62: 70-76 (2017) - [j7]Amin Coja-Oghlan, Will Perkins, Kathrin Skubch:
Limits of discrete distributions and Gibbs measures on random graphs. Eur. J. Comb. 66: 37-59 (2017) - [j6]Ewan Davies, Matthew Jenssen, Barnaby Roberts, Will Perkins:
Tight bounds on the coefficients of partition functions via stability. Electron. Notes Discret. Math. 61: 317-321 (2017) - [j5]Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts:
Independent sets, matchings, and occupancy fractions. J. Lond. Math. Soc. 96(1): 47-66 (2017) - [c7]Amin Coja-Oghlan, Florent Krzakala, Will Perkins, Lenka Zdeborová:
Information-theoretic thresholds from the cavity method. STOC 2017: 146-157 - 2016
- [c6]Amin Coja-Oghlan, Will Perkins:
Belief Propagation on Replica Symmetric Random Factor Graph Models. APPROX-RANDOM 2016: 27:1-27:15 - [c5]Laura Florescu, Will Perkins:
Spectral thresholds in the bipartite stochastic block model. COLT 2016: 943-959 - [i9]Amin Coja-Oghlan, Will Perkins:
Belief Propagation on replica symmetric random factor graph models. CoRR abs/1603.08191 (2016) - [i8]Amin Coja-Oghlan, Florent Krzakala, Will Perkins, Lenka Zdeborová:
Information-theoretic thresholds from the cavity method. CoRR abs/1611.00814 (2016) - 2015
- [j4]Will Perkins:
Random k-SAT and the power of two choices. Random Struct. Algorithms 47(1): 163-173 (2015) - [c4]Vitaly Feldman, Will Perkins, Santosh S. Vempala:
Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted CSP's. NIPS 2015: 2836-2844 - [c3]Vitaly Feldman, Will Perkins, Santosh S. Vempala:
On the Complexity of Random Satisfiability Problems with Planted Solutions. STOC 2015: 77-86 - [i7]Laura Florescu, Will Perkins:
Spectral Thresholds in the Bipartite Stochastic Block Model. CoRR abs/1506.06737 (2015) - 2014
- [c2]Milan Bradonjic, Will Perkins:
On Sharp Thresholds in Random Geometric Graphs. APPROX-RANDOM 2014: 500-514 - [i6]Vitaly Feldman, Will Perkins, Santosh S. Vempala:
Subsampled Power Iteration: a New Algorithm for Block Models and Planted CSP's. CoRR abs/1407.2774 (2014) - [i5]Vitaly Feldman, Will Perkins, Santosh S. Vempala:
On the Complexity of Random Satisfiability Problems with Planted Solutions. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j3]Will Perkins:
The forgetfulness of balls and bins. Random Struct. Algorithms 42(2): 250-267 (2013) - [j2]Mihyun Kang, Will Perkins, Joel Spencer:
The Bohman-Frieze process near criticality. Random Struct. Algorithms 43(2): 221-250 (2013) - [i4]Will Perkins, Lev Reyzin:
On the Resilience of Bipartite Networks. CoRR abs/1306.5720 (2013) - [i3]Milan Bradonjic, Will Perkins:
Thresholds for Random Geometric k-SAT. CoRR abs/1308.1084 (2013) - [i2]Vitaly Feldman, Will Perkins, Santosh S. Vempala:
On the Complexity of Random Satisfiability Problems with Planted Solutions. CoRR abs/1311.4821 (2013) - 2012
- [i1]Will Perkins:
Random k-SAT and the Power of Two Choices. CoRR abs/1209.5313 (2012) - 2011
- [j1]William Perkins, Mark Tygert, Rachel A. Ward:
Computing the confidence levels for a root-mean-square test of goodness-of-fit. Appl. Math. Comput. 217(22): 9072-9084 (2011) - 2010
- [c1]Irit Dinur, Subhash Khot, Will Perkins, Muli Safra:
Hardness of Finding Independent Sets in Almost 3-Colorable Graphs. FOCS 2010: 212-221
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
