| Publication | Date of Publication | Type |
|---|
| Proof of the satisfiability conjecture for large \(k\) (short summary) | 2026-03-20 | Paper |
Capacity lower bound for the Ising perceptron
Probability Theory and Related Fields | 2025-12-15 | Paper |
| Breaking of 1RSB in random regular MAX-NAE-SAT | 2025-08-12 | Paper |
| The number of solutions for random regular NAE-SAT | 2025-08-06 | Paper |
A Bayesian proof of the spread lemma
Random Structures & Algorithms | 2025-07-21 | Paper |
Sharp thresholds in inference of planted subgraphs
The Annals of Applied Probability | 2025-06-10 | Paper |
| The computational hardness of counting in two-spin models on d-regular graphs | 2025-05-05 | Paper |
Statistical physics of random CSPs (tutorial)
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| Sharp thresholds in inference of planted subgraphs | 2023-02-28 | Paper |
| Locality of critical percolation on expanding graph sequences | 2022-12-12 | Paper |
| A second moment proof of the spread lemma | 2022-09-22 | Paper |
Proof of the satisfiability conjecture for large \(k\)
Annals of Mathematics. Second Series | 2022-09-09 | Paper |
| On the Second Kahn--Kalai Conjecture | 2022-09-07 | Paper |
| Sharp threshold sequence and universality for Ising perceptron models | 2022-04-07 | Paper |
The number of solutions for random regular NAE-SAT
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2022-01-27 | Paper |
| Gardner formula for Ising perceptron models at small densities | 2021-11-04 | Paper |
Capacity lower bound for the Ising perceptron
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
| Breaking of 1RSB in random MAX-NAE-SAT | 2019-04-18 | Paper |
Spectral algorithms for tensor completion
Communications on Pure and Applied Mathematics | 2018-11-02 | Paper |
Maximum independent sets on random regular graphs
Acta Mathematica | 2017-10-06 | Paper |
On the asymptotics of dimers on tori
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2016-11-29 | Paper |
Satisfiability threshold for random regular \textsc{nae-sat}
Communications in Mathematical Physics | 2016-02-23 | Paper |
| Shotgun assembly of random regular graphs | 2015-12-28 | Paper |
Proof of the satisfiability conjecture for large k
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Satisfiability threshold for random regular NAE-SAT
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
| Supercritical minimum mean-weight cycles | 2015-04-03 | Paper |
Counting in two-spin models on \(d\)-regular graphs
The Annals of Probability | 2014-11-14 | Paper |
The Hausdorff dimension of the CLE gasket
The Annals of Probability | 2014-08-22 | Paper |
The replica symmetric solution for Potts models on d-regular graphs
Communications in Mathematical Physics | 2014-04-28 | Paper |
Factor models on locally tree-like graphs
The Annals of Probability | 2014-01-31 | Paper |
Central limit theorem for biased random walk on multi-type Galton-Watson trees
Electronic Journal of Probability | 2012-10-23 | Paper |
Conformally invariant scaling limits in planar critical percolation
Probability Surveys | 2012-06-28 | Paper |
Conformally invariant scaling limits in planar critical percolation
Probability Surveys | 2012-06-28 | Paper |
Strong path convergence from Loewner driving function convergence
The Annals of Probability | 2012-05-11 | Paper |
Strong path convergence from Loewner driving function convergence
The Annals of Probability | 2012-05-11 | Paper |
