Allan M. Sly

Calculated based on number of publications stored in Pure and citations from Scopus
20072024

Research activity per year

Filter
Conference contribution

Search results

  • 2023

    Exact Phase Transitions for Stochastic Block Models and Reconstruction on Trees

    Mossel, E., Sly, A. & Sohn, Y., Jun 2 2023, STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Saha, B. & Servedio, R. A. (eds.). Association for Computing Machinery, p. 96-102 7 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
  • 2022

    Binary perceptron: efficient algorithms can find solutions in a rare well-connected cluster

    Abbe, E., Li, S. & Sly, A., Sep 6 2022, STOC 2022 - Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. Leonardi, S. & Gupta, A. (eds.). Association for Computing Machinery, p. 860-873 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    7 Scopus citations
  • One-step replica symmetry breaking of random regular NAE-SAT

    Nam, D., Sly, A. & Sohn, Y., 2022, Proceedings - 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science, FOCS 2021. IEEE Computer Society, p. 310-318 9 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2022-February).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Scopus citations
  • Proof of the Contiguity Conjecture and Lognormal Limit for the Symmetric Perceptron

    Abbe, E., Li, S. & Sly, A., 2022, Proceedings - 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science, FOCS 2021. IEEE Computer Society, p. 327-338 12 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2022-February).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    10 Scopus citations
  • 2019

    Scheduling of Non-Colliding Random Walks

    Basu, R., Sidoravicius, V. & Sly, A., 2019, Sojourns in Probability Theory and Statistical Physics - III - Interacting Particle Systems and Random Walks, A Festschrift for Charles M. Newman. Sidoravicius, V. (ed.). Springer, p. 90-137 48 p. (Springer Proceedings in Mathematics and Statistics; vol. 300).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    2 Scopus citations
  • 2016

    The Number of Solutions for Random Regular NAE-SAT

    Sly, A., Sun, N. & Zhang, Y., Dec 14 2016, Proceedings - 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016. IEEE Computer Society, p. 724-731 8 p. 7782987. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2016-December).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    15 Scopus citations
  • 2015

    Consistency thresholds for the planted bisection model

    Mossel, E., Neeman, J. & Sly, A., Jun 14 2015, STOC 2015 - Proceedings of the 2015 ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 69-75 7 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 14-17-June-2015).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    69 Scopus citations
  • Proof of the satisfiability conjecture for large k

    Ding, J., Sly, A. & Sun, N., Jun 14 2015, STOC 2015 - Proceedings of the 2015 ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 59-68 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 14-17-June-2015).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    108 Scopus citations
  • 2014

    Satisfiability threshold for random regular nae-sat

    Ding, J., Sly, A. & Sun, N., 2014, STOC 2014 - Proceedings of the 2014 ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 814-822 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    19 Scopus citations
  • 2010

    Computational transition at the uniqueness threshold

    Sly, A., 2010, Proceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010. IEEE Computer Society, p. 287-296 10 p. 5671190. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    176 Scopus citations
  • Reconstruction threshold for the hardcore model

    Bhatnagar, N., Sly, A. & Tetali, P., 2010, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Proceedings. p. 434-447 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6302 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    18 Scopus citations
  • 2009

    Reconstruction for the potts model

    Sly, A., 2009, STOC'09 - Proceedings of the 2009 ACM International Symposium on Theory of Computing. p. 581-590 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    18 Scopus citations
  • 2008

    Mixing time of exponential random graphs

    Bhamidi, S., Bresler, G. & Sly, A., 2008, Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008. p. 803-812 10 p. 4691012. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    32 Scopus citations
  • Rapid mixing of Gibbs sampling on graphs that are sparse on average

    Mossel, E. & Sly, A., 2008, Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 238-247 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    7 Scopus citations
  • Reconstruction of Markov random fields from samples: Some observations and algorithms

    Bresler, G., Mossel, E. & Sly, A., 2008, Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques - 11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Proceedings. p. 343-356 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5171 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    67 Scopus citations