| Publication | Date of Publication | Type |
|---|
Finding planted cycles in a random graph
Random Structures & Algorithms | 2026-05-11 | Paper |
Recovering Assignments with One-Sided Noise
(available as arXiv preprint) | 2026-01-01 | Paper |
| A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels | 2025-08-15 | Paper |
| Community detection in general stochastic block models: fundamental limits and efficient algorithms for recovery | 2025-08-05 | Paper |
''All-Something-Nothing'' Phase Transitions in Planted k-Factor Recovery
(available as arXiv preprint) | 2025-01-01 | Paper |
Finding Planted Cycles in a Random Graph
(available as arXiv preprint) | 2025-01-01 | Paper |
The power of two matrices in spectral algorithms for community recovery
IEEE Transactions on Information Theory | 2024-07-22 | Paper |
| Spectral recovery of binary censored block models | 2024-07-19 | Paper |
Polynomial Freiman-Ruzsa, Reed-Muller codes and Shannon capacity
(available as arXiv preprint) | 2024-01-01 | Paper |
| Reed-Muller codes have vanishing bit-error probability below capacity: a simple tighter proof via camellia boosting | 2023-12-07 | Paper |
Polynomial‐time universality and limitations of deep learning
Communications on Pure and Applied Mathematics | 2023-10-12 | Paper |
| The Power of an Adversary in Glauber Dynamics | 2023-02-21 | Paper |
The Power of an Adversary in Glauber Dynamics
(available as arXiv preprint) | 2023-01-01 | Paper |
Reed-Muller codes have vanishing bit-error probability below capacity: a simple tighter proof via camellia boosting
(available as arXiv preprint) | 2023-01-01 | Paper |
| Spectral Algorithms Optimally Recover Planted Sub-structures | 2022-03-22 | Paper |
Graph powering and spectral robustness
SIAM Journal on Mathematics of Data Science | 2022-02-03 | Paper |
Spectral Algorithms Optimally Recover Planted Sub-structures
(available as arXiv preprint) | 2022-01-01 | Paper |
| Spectral Recovery of Binary Censored Block Models | 2021-07-13 | Paper |
Proof of the achievability conjectures for the general stochastic block model
Communications on Pure and Applied Mathematics | 2018-07-13 | Paper |
Linear Boolean Classification, Coding and the Critical Problem
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
| Detection in the stochastic block model with multiple clusters: proof of the achievability conjectures, acyclic BP, and the information-computation gap | 2015-12-30 | Paper |
| Recovering communities in the general stochastic block model without knowing the parameters | 2015-06-11 | Paper |
| Community detection in general stochastic block models: fundamental limits and efficient recovery algorithms | 2015-03-02 | Paper |
Community detection in general stochastic block models: fundamental limits and efficient recovery algorithms
(available as arXiv preprint) | 2015-01-01 | Paper |
Recovering communities in the general stochastic block model without knowing the parameters
(available as arXiv preprint) | 2015-01-01 | Paper |
Detection in the stochastic block model with multiple clusters: proof of the achievability conjectures, acyclic BP, and the information-computation gap
(available as arXiv preprint) | 2015-01-01 | Paper |
Warnaar's bijection and colored partition identities. II
The Ramanujan Journal | 2014-03-24 | Paper |
Warnaar's bijection and colored partition identities. I.
Journal of Combinatorial Theory. Series A | 2012-11-09 | Paper |
