| Information-theoretic thresholds from the cavity method A Coja-Oghlan, F Krzakala, W Perkins, L Zdeborová Advances in Mathematics 333, 694-795, 2018 | 169 | 2018 |
| 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 | 169 | 2018 |
| Algorithmic Pirogov–Sinai theory T Helmuth, W Perkins, G Regts Probability Theory and Related Fields 176 (3), 851-895, 2020 | 119 | 2020 |
| Algorithms for# BIS-hard problems on expander graphs M Jenssen, P Keevash, W Perkins SIAM Journal on Computing 49 (4), 681-710, 2020 | 88 | 2020 |
| Storage capacity in symmetric binary perceptrons B Aubin, W Perkins, L Zdeborová Journal of Physics A: Mathematical and Theoretical 52 (29), 294003, 2019 | 86 | 2019 |
| 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 | 81 | 2017 |
| Spectral thresholds in the bipartite stochastic block model L Florescu, W Perkins 29th Annual Conference on Learning Theory, 943-959, 2016 | 79 | 2016 |
| Frozen 1-RSB structure of the symmetric Ising perceptron W Perkins, C Xu Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 72 | 2021 |
| 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 | 67 | 2018 |
| Algorithms and barriers in the symmetric binary perceptron model D Gamarnik, EC Kızıldağ, W Perkins, C Xu 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 61 | 2022 |
| Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs T Helmuth, M Jenssen, W Perkins Annales de l'Institut Henri Poincare (B) Probabilites et statistiques 59 (2 …, 2023 | 51 | 2023 |
| On kissing numbers and spherical codes in high dimensions M Jenssen, F Joos, W Perkins Advances in Mathematics 335, 307-321, 2018 | 49 | 2018 |
| Independent sets in the hypercube revisited M Jenssen, W Perkins Journal of the London Mathematical Society 102 (2), 645-669, 2020 | 48 | 2020 |
| Fast algorithms at low temperatures via Markov chains Z Chen, A Galanis, LA Goldberg, W Perkins, J Stewart, E Vigoda Random Structures & Algorithms 58 (2), 294-321, 2021 | 44 | 2021 |
| Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures C Borgs, J Chayes, T Helmuth, W Perkins, P Tetali Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 44 | 2020 |
| Counting independent sets in unbalanced bipartite graphs S Cannon, W Perkins Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 38 | 2020 |
| Counting independent sets in cubic graphs of given girth G Perarnau, W Perkins Journal of Combinatorial Theory, Series B 133, 211-242, 2018 | 33 | 2018 |
| Belief propagation on replica symmetric random factor graph models A Coja-Oghlan, W Perkins Annales de l’Institut Henri Poincaré D 5 (2), 211-249, 2018 | 32 | 2018 |
| 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 | 32 | 2011 |
| Approximately counting independent sets in bipartite graphs via graph containers M Jenssen, W Perkins, A Potukuchi Random Structures & Algorithms 63 (1), 215-241, 2023 | 31 | 2023 |
Matthew JenssenUniversity of BirminghamVerified email at bham.ac.uk
