default search action
Allan Sly
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c18]Allan Sly
, Youngtak Sohn
Local Geometry of NAE-SAT Solutions in the Condensation Regime. STOC 2024: 1083-1093 - [i21]Elchanan Mossel, Allan Sly, Youngtak Sohn:
Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs. CoRR abs/2406.15957 (2024) - 2023
- [c17]Elchanan Mossel, Allan Sly, Youngtak Sohn:
Exact Phase Transitions for Stochastic Block Models and Reconstruction on Trees. STOC 2023: 96-102 - [i20]Allan Sly, Youngtak Sohn:
Local geometry of NAE-SAT solutions in the condensation regime. CoRR abs/2305.17334 (2023) - 2022
- [c16]Emmanuel Abbe, Shuangping Li, Allan Sly:
Binary perceptron: efficient algorithms can find solutions in a rare well-connected cluster. STOC 2022: 860-873 - [i19]Elchanan Mossel, Allan Sly, Youngtak Sohn:
Exact Phase Transitions for Stochastic Block Models and Reconstruction on Trees. CoRR abs/2212.03362 (2022) - 2021
- [c15]Danny Nam, Allan Sly, Youngtak Sohn:
One-step replica symmetry breaking of random regular NAE-SAT. FOCS 2021: 310-318 - [c14]Emmanuel Abbe, Shuangping Li, Allan Sly:
Proof of the Contiguity Conjecture and Lognormal Limit for the Symmetric Perceptron. FOCS 2021: 327-338 - [i18]Danny Nam, Allan Sly, Youngtak Sohn:
One-step replica symmetry breaking of random regular NAE-SAT II. CoRR abs/2112.00152 (2021) - 2020
- [i17]Emmanuel Abbe, Shuangping Li, Allan Sly:
Learning Sparse Graphons and the Generalized Kesten-Stigum Threshold. CoRR abs/2006.07695 (2020) - [i16]Byron Chin, Allan Sly:
Optimal Recovery of Block Models with $q$ Communities. CoRR abs/2010.10672 (2020)
2010 – 2019
- 2019
- [j5]Jonathan Hermon, Allan Sly, Yumeng Zhang:
Rapid mixing of hypergraph independent sets. Random Struct. Algorithms 54(4): 730-767 (2019) - 2018
- [j4]Elchanan Mossel, Joe Neeman, Allan Sly:
A Proof of the Block Model Threshold Conjecture. Comb. 38(3): 665-708 (2018) - [c13]Elchanan Mossel, Manuel Mueller-Frank, Allan Sly, Omer Tamuz:
Social Learning Equilibria. EC 2018: 639 - 2017
- [i15]Emmanuel Abbe, Laurent Massoulié, Andrea Montanari, Allan Sly, Nikhil Srivastava:
Group Synchronization on Grids. CoRR abs/1706.08561 (2017) - [i14]Yuval Peres, Miklós Z. Rácz, Allan Sly, Izabella Stuhl:
How fragile are information cascades? CoRR abs/1711.04024 (2017) - 2016
- [c12]Allan Sly, Nike Sun, Yumeng Zhang:
The Number of Solutions for Random Regular NAE-SAT. FOCS 2016: 724-731 - [i13]Jonathan Hermon, Allan Sly, Yumeng Zhang:
Rapid Mixing of Hypergraph Independent Set. CoRR abs/1610.07999 (2016) - 2015
- [c11]Jian Ding, Allan Sly, Nike Sun:
Proof of the Satisfiability Conjecture for Large k. STOC 2015: 59-68 - [c10]Elchanan Mossel, Joe Neeman, Allan Sly:
Consistency Thresholds for the Planted Bisection Model. STOC 2015: 69-75 - 2014
- [c9]Elchanan Mossel, Joe Neeman, Allan Sly:
Belief propagation, robust reconstruction and optimal recovery of block models. COLT 2014: 356-370 - [c8]Jian Ding, Allan Sly, Nike Sun:
Satisfiability threshold for random regular NAE-SAT. STOC 2014: 814-822 - [i12]Elchanan Mossel, Joe Neeman, Allan Sly:
Consistency Thresholds for Binary Symmetric Block Models. CoRR abs/1407.1591 (2014) - [i11]Jian Ding, Allan Sly, Nike Sun:
Proof of the satisfiability conjecture for large k. CoRR abs/1411.0650 (2014) - 2013
- [j3]Guy Bresler, Elchanan Mossel
Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms. SIAM J. Comput. 42(2): 563-578 (2013) - [j2]Elchanan Mossel
Robust Estimation of Latent Tree Graphical Models: Inferring Hidden States With Inexact Parameters. IEEE Trans. Inf. Theory 59(7): 4357-4373 (2013) - [i10]Florent Krzakala, Cristopher Moore, Elchanan Mossel, Joe Neeman, Allan Sly, Lenka Zdeborová, Pan Zhang:
Spectral redemption: clustering sparse networks. CoRR abs/1306.5550 (2013) - [i9]Elchanan Mossel, Joe Neeman, Allan Sly:
Belief Propagation, Robust Reconstruction, and Optimal Recovery of Block Models. CoRR abs/1309.1380 (2013) - [i8]Elchanan Mossel, Joe Neeman, Allan Sly:
A Proof Of The Block Model Threshold Conjecture. CoRR abs/1311.4115 (2013) - 2012
- [c7]Allan Sly, Nike Sun:
The Computational Hardness of Counting in Two-Spin Models on d-Regular Graphs. FOCS 2012: 361-369 - [i7]Allan Sly, Nike Sun:
The computational hardness of counting in two-spin models on d-regular graphs. CoRR abs/1203.2602 (2012) - [i6]Elchanan Mossel, Allan Sly, Omer Tamuz:
Strategic Learning and the Topology of Social Networks. CoRR abs/1209.5527 (2012) - 2011
- [i5]Elchanan Mossel, Sébastien Roch, Allan Sly:
Robust estimation of latent tree graphical models: Inferring hidden states with inexact parameters. CoRR abs/1109.4668 (2011) - 2010
- [c6]Nayantara Bhatnagar, Allan Sly, Prasad Tetali:
Reconstruction Threshold for the Hardcore Model. APPROX-RANDOM 2010: 434-447 - [c5]Allan Sly:
Computational Transition at the Uniqueness Threshold. FOCS 2010: 287-296 - [i4]Elchanan Mossel, Sebastien Roch, Allan Sly:
On the inference of large phylogenies with long branches: How long is too long? CoRR abs/1001.3480 (2010) - [i3]Nayantara Bhatnagar, Allan Sly, Prasad Tetali:
Reconstruction Threshold for the Hardcore Model. CoRR abs/1004.3531 (2010) - [i2]Allan Sly:
Computational Transition at the Uniqueness Threshold. CoRR abs/1005.5584 (2010)
2000 – 2009
- 2009
- [j1]Elchanan Mossel
Rapid mixing of Gibbs sampling on graphs that are sparse on average. Random Struct. Algorithms 35(2): 250-270 (2009) - [c4]Allan Sly:
Reconstruction for the Potts model. STOC 2009: 581-590 - 2008
- [c3]Guy Bresler, Elchanan Mossel
Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms. APPROX-RANDOM 2008: 343-356 - [c2]Shankar Bhamidi
Mixing Time of Exponential Random Graphs. FOCS 2008: 803-812 - [c1]Elchanan Mossel, Allan Sly:
Rapid mixing of Gibbs sampling on graphs that are sparse on average. SODA 2008: 238-247 - 2007
- [i1]Guy Bresler, Elchanan Mossel, Allan Sly:
Reconstruction of Markov Random Fields from Samples: Some Easy Observations and Algorithms. CoRR abs/0712.1402 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-25 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: