Source: OpenCitations

• Cryptography from Planted Graphs: Security with Logarithmic-Size Messages

  Lecture notes in computer science

  Authors : Damiano Abram , Amos Beimel , Yuval Ishai , Eyal Kushilevitz , Varun Narayanan

  Journal reference : Volume , 2023, pp. 286-315

  DOI : 10.1007/978-3-031-48615-9_11

• Finding Hidden Cliques of Size $$\sqrt{N/e}$$ N / e in Nearly Linear Time

  Foundations of Computational Mathematics

  Authors : Yash Deshpande , Andrea Montanari

  Journal reference : Volume 15, 2014, pp. 1069-1128

  DOI : 10.1007/s10208-014-9215-y

• Toward epidemic thresholds on temporal networks: a review and open questions

  Applied Network Science

  Authors : Jack Leitch , Kathleen A. Alexander , Srijan Sengupta

  Journal reference : Volume 4, 2019, pp.

  DOI : 10.1007/s41109-019-0230-4

• Statistical Algorithms and a Lower Bound for Detecting Planted Cliques

  Journal of the ACM

  Authors : Vitaly Feldman , Elena Grigorescu , Lev Reyzin , Santosh S. Vempala , Ying Xiao

  Journal reference : Volume 64, 2017, pp. 1-37

  DOI : 10.1145/3046674

• Using the Planted Clique Conjecture for Cryptography: Public-Key Encryption from Planted Clique and Noisy 𝑘-LIN over Expanders

  Proceedings of the 57th Annual ACM Symposium on Theory of Computing

  Authors : Riddhi Ghosal , Isaac M. Hair , Aayush Jain, Amit Sahai

  Journal reference : Volume , 2025, pp. 1921-1932

  DOI : 10.1145/3717823.3718306

• Community detection in dense random networks

  The Annals of Statistics

  Authors : Ery Arias-Castro , Nicolas Verzelen

  Journal reference : Volume 42, 2014, pp.

  DOI : 10.1214/14-aos1208

• Guaranteed Recovery of Planted Cliques and Dense Subgraphs by Convex Relaxation

  Journal of Optimization Theory and Applications

  Authors : Brendan P. W. Ames

  Journal reference : Volume 167, 2015, pp. 653-675

  DOI : 10.1007/s10957-015-0777-x

• A Simple SVD Algorithm for Finding Hidden Partitions

  arXiv (Cornell University)

  Authors : VAN VU

  Journal reference : Volume 27, 2017, pp. 124-140

  DOI : 10.1017/s0963548317000463

• Computational barriers in minimax submatrix detection

  The Annals of Statistics

  Authors : Zongming Ma , Yihong Wu

  Journal reference : Volume 43, 2015, pp.

  DOI : 10.1214/14-aos1300

• Do semidefinite relaxations solve sparse PCA up to the information limit?

  The Annals of Statistics

  Authors : Robert Krauthgamer, Boaz Nadler, Dan Vilenchik

  Journal reference : Volume 43, 2015, pp.

  DOI : 10.1214/15-aos1310

• Statistical and computational trade-offs in estimation of sparse principal components

  The Annals of Statistics

  Authors : Tengyao Wang, Quentin Berthet, Richard J. Samworth

  Journal reference : Volume 44, 2016, pp.

  DOI : 10.1214/15-aos1369

• A Planted Clique Perspective on Hypothesis Pruning

  IEEE Robotics and Automation Letters

  Authors : Muyuan Lin, Varun Murali , Sertac Karaman

  Journal reference : Volume 7, 2022, pp. 5167-5174

  DOI : 10.1109/lra.2022.3155198

• A simple spectral algorithm for recovering planted partitions

  Special Matrices

  Authors : Sam Cole , Shmuel Friedland , Lev Reyzin

  Journal reference : Volume 5, 2017, pp. 139-157

  DOI : 10.1515/spma-2017-0013

• Statistical Problems with Planted Structures: Information-Theoretical and Computational Limits

  Cambridge University Press eBooks

  Authors : Yihong Wu , Jiaming Xu

  Journal reference : Volume , 2021, pp. 383-424

  DOI : 10.1017/9781108616799.014

• Convex Optimization for the Densest Subgraph and Densest Submatrix Problems

  arXiv (Cornell University)

  Authors : Polina Bombina , Brendan Ames

  Journal reference : Volume 1, 2020, pp.

  DOI : 10.1007/s43069-020-00020-5

• How to Hide a Clique?

  Theory of Computing Systems

  Authors : Uriel Feige , Vadim Grinberg

  Journal reference : Volume 68, 2024, pp. 773-813

  DOI : 10.1007/s00224-024-10167-x

• The landscape of the planted clique problem: Dense subgraphs and the overlap gap property

  The Annals of Applied Probability

  Authors : David Gamarnik, Ilias Zadik

  Journal reference : Volume 34, 2024, pp.

  DOI : 10.1214/23-aap2003

• Tensor factor model estimation by iterative projection

  The Annals of Statistics

  Authors : Yuefeng Han , Rong Chen , Dan Yang , Cun-Hui Zhang

  Journal reference : Volume 52, 2024, pp.

  DOI : 10.1214/24-aos2412

• Community detection in sparse random networks

  arXiv (Cornell University)

  Authors : Nicolas Verzelen, Ery Arias-Castro

  Journal reference : Volume 25, 2015, pp.

  DOI : 10.1214/14-aap1080

• On the Limitation of Spectral Methods: From the Gaussian Hidden Clique Problem to Rank One Perturbations of Gaussian Tensors

  arXiv (Cornell University)

  Authors : Andrea Montanari , Daniel Reichman , Ofer Zeitouni

  Journal reference : Volume 63, 2016, pp. 1572-1579

  DOI : 10.1109/tit.2016.2637959

• Planted Clique Conjectures Are Equivalent

  Proceedings of the 56th Annual ACM Symposium on Theory of Computing

  Authors : Shuichi Hirahara , Nobutaka Shimizu

  Journal reference : Volume , 2024, pp. 358-366

  DOI : 10.1145/3618260.3649751

• Optimal detection of sparse principal components in high dimension

  The Annals of Statistics

  Authors : Quentin Berthet , Philippe Rigollet

  Journal reference : Volume 41, 2013, pp.

  DOI : 10.1214/13-aos1127