Allan Sly

According to our database1, Allan Sly authored at least 32 papers between 2007 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Local geometry of NAE-SAT solutions in the condensation regime.
CoRR, 2023

Exact Phase Transitions for Stochastic Block Models and Reconstruction on Trees.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022
Binary perceptron: efficient algorithms can find solutions in a rare well-connected cluster.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021
One-step replica symmetry breaking of random regular NAE-SAT II.
CoRR, 2021

One-step replica symmetry breaking of random regular NAE-SAT.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Proof of the Contiguity Conjecture and Lognormal Limit for the Symmetric Perceptron.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
Optimal Recovery of Block Models with $q$ Communities.
CoRR, 2020

Learning Sparse Graphons and the Generalized Kesten-Stigum Threshold.
CoRR, 2020

2019
Rapid mixing of hypergraph independent sets.
Random Struct. Algorithms, 2019

2018
A Proof of the Block Model Threshold Conjecture.
Comb., 2018

Social Learning Equilibria.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

2017
How fragile are information cascades?
CoRR, 2017

Group Synchronization on Grids.
CoRR, 2017

2016
Rapid Mixing of Hypergraph Independent Set.
CoRR, 2016

The Number of Solutions for Random Regular NAE-SAT.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
Consistency Thresholds for the Planted Bisection Model.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Proof of the Satisfiability Conjecture for Large k.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

2014
Consistency Thresholds for Binary Symmetric Block Models.
CoRR, 2014

Satisfiability threshold for random regular NAE-SAT.
Proceedings of the Symposium on Theory of Computing, 2014

Belief propagation, robust reconstruction and optimal recovery of block models.
Proceedings of The 27th Conference on Learning Theory, 2014

2013
Robust Estimation of Latent Tree Graphical Models: Inferring Hidden States With Inexact Parameters.
IEEE Trans. Inf. Theory, 2013

Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms.
SIAM J. Comput., 2013

Spectral redemption: clustering sparse networks.
CoRR, 2013

2012
Strategic Learning and the Topology of Social Networks
CoRR, 2012

The Computational Hardness of Counting in Two-Spin Models on d-Regular Graphs.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2010
On the inference of large phylogenies with long branches: How long is too long?
CoRR, 2010

Computational Transition at the Uniqueness Threshold.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Reconstruction Threshold for the Hardcore Model.
Proceedings of the Approximation, 2010

2009
Rapid mixing of Gibbs sampling on graphs that are sparse on average.
Random Struct. Algorithms, 2009

Reconstruction for the Potts model.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008
Mixing Time of Exponential Random Graphs.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007
Reconstruction of Markov Random Fields from Samples: Some Easy Observations and Algorithms
CoRR, 2007


  Loading...