Will Perkins - Google Scholar Citations

Cited by

	All	Since 2015
Citations	582	515
h-index	13	12
i10-index	22	20

160

120

20112012201320142015201620172018201920205 12 13 25 26 52 92 123 144 76

Co-authors

Amin Coja-OghlanGoethe University FrankfurtVerified email at mathematik.uni-frankfurt.de
Ewan DaviesUniversity of Colorado BoulderVerified email at colorado.edu
Santosh S. VempalaGeorgia TechVerified email at gatech.edu
Vitaly FeldmanApple AI ResearchVerified email at apple.com
Rachel WardUT AustinVerified email at math.utexas.edu
Lenka ZdeborovaIPhT, CEA Saclay, FranceVerified email at cea.fr
Tyler HelmuthUniversity of BristolVerified email at bristol.ac.uk
Florent KrzakalaEcole Normale Supérieure Paris, Sorbonne Université, LightOnVerified email at ens.fr
Laura FlorescuNew York UniversityVerified email at cims.nyu.edu
Guus RegtsAssistant Professor at University of AmsterdamVerified email at uva.nl
Mihyun KangProfessor, Graz University of TechnologyVerified email at math.tugraz.at
Leslie Ann GoldbergProfessor of Computer Science, University of OxfordVerified email at cs.ox.ac.uk
Kathrin SkubchBosch Center for Artificial IntelligenceVerified email at de.bosch.com
Oren LouidorTechnion Israel Institute of TechnologyVerified email at ie.technion.ac.il
Lev ReyzinAssociate Professor, MSCS, UICVerified email at math.uic.edu
Péter CsikváriEötvös Loránd UniversityVerified email at cs.elte.hu
Andreas GalanisUniversity of OxfordVerified email at cs.ox.ac.uk
Benjamin AubinPhD Student, Institut de Physique Théorique, CEA SaclayVerified email at ipht.fr
Sarah CannonGeorgia Institute of TechnologyVerified email at gatech.edu
Samantha PettiGeorgia TechVerified email at gatech.edu

Will Perkins

University of Illinois at Chicago

Verified email at willperkins.org - Homepage

Mathematics and Computer Science


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
On the complexity of random satisfiability problems with planted solutions V Feldman, W Perkins, S Vempala SIAM Journal on Computing 47 (4), 1294-1338, 2018	85	2018
Information-theoretic thresholds from the cavity method A Coja-Oghlan, F Krzakala, W Perkins, L Zdeborova Advances in Mathematics 333, 694-795, 2018	61	2018
Independent sets, matchings, and occupancy fractions E Davies, M Jenssen, W Perkins, B Roberts Journal of the London Mathematical Society 96 (1), 47-66, 2017	40	2017
Computing the confidence levels for a root-mean-square test of goodness-of-fit W Perkins, M Tygert, R Ward Applied Mathematics and Computation, 2011	30	2011
Spectral thresholds in the bipartite stochastic block model L Florescu, W Perkins 29th Annual Conference on Learning Theory, 943-959, 2016	29	2016
On the average size of independent sets in triangle-free graphs E Davies, M Jenssen, W Perkins, B Roberts Proceedings of the American Mathematical Society 146 (1), 111-124, 2018	28	2018
Algorithmic Pirogov–Sinai theory T Helmuth, W Perkins, G Regts Probability Theory and Related Fields, 1-45, 2019	27	2019
Algorithms for# BIS-hard problems on expander graphs M Jenssen, P Keevash, W Perkins Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019	23	2019
On the Widom–Rowlinson occupancy fraction in regular graphs E Cohen, W Perkins, P Tetali Combinatorics, Probability and Computing 26 (2), 183-194, 2017	20	2017
The Bohman‐Frieze process near criticality M Kang, W Perkins, J Spencer Random Structures & Algorithms 43 (2), 221-250, 2013	20	2013
On kissing numbers and spherical codes in high dimensions M Jenssen, F Joos, W Perkins Advances in Mathematics 335, 307-321, 2018	16	2018
Extremes of the internal energy of the Potts model on cubic graphs E Davies, M Jenssen, W Perkins, B Roberts Random Structures & Algorithms 53 (1), 59-75, 2018	14	2018
Belief Propagation on replica symmetric random factor graph models A Coja-Oghlan, W Perkins arXiv preprint arXiv:1603.08191, 2016	14	2016
Limits of discrete distributions and Gibbs measures on random graphs A Coja-Oghlan, W Perkins, K Skubch European Journal of Combinatorics, 2017	13	2017
Counting independent sets in cubic graphs of given girth G Perarnau, W Perkins Journal of Combinatorial Theory, Series B 133, 211-242, 2018	12	2018
Large Deviations for the Empirical Distribution in the Branching Random Walk O Louidor, W Perkins	12	2012
On the hard sphere model and sphere packings in high dimensions M Jenssen, F Joos, W Perkins Forum of Mathematics, Sigma 7, 2019	11	2019
Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted CSP's V Feldman, W Perkins, S Vempala Advances in Neural Information Processing Systems, 2836-2844, 2015	11	2015
χ2 and classical exact tests often wildly misreport significance; the remedy lies in computers W Perkins, M Tygert, R Ward Uploaded to ArXiv, 2011	11	2011
The Widom–Rowlinson model, the hard-core model and the extremality of the complete graph E Cohen, P Csikvári, W Perkins, P Tetali European Journal of Combinatorics 62, 70-76, 2017	10	2017

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors