Reconstruction of Markov Random Fields from Samples: Some Easy Observations and Algorithms - Guy Bresler; Elchanan Mossel; Allan Sly (CoRR, 2007)

Mixing Time of Exponential Random Graphs. - Shankar Bhamidi; Guy Bresler; Allan Sly (FOCS, 2008)

Reconstruction for the Potts model. - Allan Sly (STOC, 2009)

Rapid mixing of Gibbs sampling on graphs that are sparse on average. - Elchanan Mossel; Allan Sly (Random Struct. Algorithms, 2009)

Reconstruction Threshold for the Hardcore Model. - Nayantara Bhatnagar; Allan Sly; Prasad Tetali (APPROX-RANDOM, 2010)

Computational Transition at the Uniqueness Threshold. - Allan Sly (FOCS, 2010)

On the inference of large phylogenies with long branches: How long is too long? - Elchanan Mossel; Sebastien Roch; Allan Sly (CoRR, 2010)

The Computational Hardness of Counting in Two-Spin Models on d-Regular Graphs. - Allan Sly; Nike Sun (FOCS, 2012)

Strategic Learning and the Topology of Social Networks - Elchanan Mossel; Allan Sly; Omer Tamuz (CoRR, 2012)

Spectral redemption: clustering sparse networks. - Florent Krzakala; Cristopher Moore; Elchanan Mossel; Joe Neeman; Allan Sly; Lenka Zdeborová; Pan Zhang (CoRR, 2013)

Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms. - Guy Bresler; Elchanan Mossel; Allan Sly (SIAM J. Comput., 2013)

Robust Estimation of Latent Tree Graphical Models: Inferring Hidden States With Inexact Parameters. - Elchanan Mossel; Sébastien Roch; Allan Sly (IEEE Trans. Inf. Theory, 2013)

Belief propagation, robust reconstruction and optimal recovery of block models. - Elchanan Mossel; Joe Neeman; Allan Sly (COLT, 2014)

Satisfiability threshold for random regular NAE-SAT. - Jian Ding; Allan Sly; Nike Sun (STOC, 2014)

Consistency Thresholds for Binary Symmetric Block Models. - Elchanan Mossel; Joe Neeman; Allan Sly (CoRR, 2014)

Proof of the Satisfiability Conjecture for Large k. - Jian Ding; Allan Sly; Nike Sun (STOC, 2015)

Consistency Thresholds for the Planted Bisection Model. - Elchanan Mossel; Joe Neeman; Allan Sly (STOC, 2015)

The Number of Solutions for Random Regular NAE-SAT. - Allan Sly; Nike Sun; Yumeng Zhang (FOCS, 2016)

Rapid Mixing of Hypergraph Independent Set. - Jonathan Hermon; Allan Sly; Yumeng Zhang (CoRR, 2016)

Group Synchronization on Grids. - Emmanuel Abbe; Laurent Massoulié; Andrea Montanari; Allan Sly; Nikhil Srivastava (CoRR, 2017)

How fragile are information cascades? - Yuval Peres; Miklós Z. Rácz; Allan Sly; Izabella Stuhl (CoRR, 2017)

Social Learning Equilibria. - Elchanan Mossel; Manuel Mueller-Frank; Allan Sly; Omer Tamuz (EC, 2018)

A Proof of the Block Model Threshold Conjecture. - Elchanan Mossel; Joe Neeman; Allan Sly (Comb., 2018)

Rapid mixing of hypergraph independent sets. - Jonathan Hermon; Allan Sly; Yumeng Zhang (Random Struct. Algorithms, 2019)

Learning Sparse Graphons and the Generalized Kesten-Stigum Threshold. - Emmanuel Abbe; Shuangping Li; Allan Sly (CoRR, 2020)

Optimal Recovery of Block Models with $q$ Communities. - Byron Chin; Allan Sly (CoRR, 2020)

Proof of the Contiguity Conjecture and Lognormal Limit for the Symmetric Perceptron. - Emmanuel Abbe; Shuangping Li; Allan Sly (FOCS, 2021)

One-step replica symmetry breaking of random regular NAE-SAT. - Danny Nam; Allan Sly; Youngtak Sohn (FOCS, 2021)

One-step replica symmetry breaking of random regular NAE-SAT II. - Danny Nam; Allan Sly; Youngtak Sohn (CoRR, 2021)

Binary perceptron: efficient algorithms can find solutions in a rare well-connected cluster. - Emmanuel Abbe; Shuangping Li; Allan Sly (STOC, 2022)

Exact Phase Transitions for Stochastic Block Models and Reconstruction on Trees. - Elchanan Mossel; Allan Sly; Youngtak Sohn (STOC, 2023)

Local Geometry of NAE-SAT Solutions in the Condensation Regime. - Allan Sly; Youngtak Sohn (STOC, 2024)

Weak Recovery, Hypothesis Testing, and Mutual Information in Stochastic Block Models and Planted Factor Graphs. - Elchanan Mossel; Allan Sly; Youngtak Sohn (STOC, 2025)