| Publication | Date of Publication | Type |
|---|
| The SDP value of random 2CSPs | 2024-06-24 | Paper |
Testing thresholds for high-dimensional sparse random geometric graphs
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Playing unique games on certified small-set expanders
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| Local and global expansion in random geometric graphs | 2022-09-30 | Paper |
| Sherali-adams strikes back | 2022-07-27 | Paper |
scientific article; zbMATH DE number 7559092 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Computational barriers to estimation from low-degree polynomials
The Annals of Statistics | 2022-06-24 | Paper |
Sherali-Adams strikes back
Theory of Computing | 2021-10-25 | Paper |
| The SDP value of random 2CSPs | 2021-08-02 | Paper |
Computing exact minimum cuts without knowing the graph
(available as arXiv preprint) | 2021-06-15 | Paper |
| Non-asymptotic approximations of neural networks by Gaussian processes | 2021-02-17 | Paper |
HIGH DIMENSIONAL ESTIMATION VIA SUM-OF-SQUARES PROOFS
Proceedings of the International Congress of Mathematicians (ICM 2018) | 2020-09-22 | Paper |
Computational Barriers to Estimation from Low-Degree Polynomials
(available as arXiv preprint) | 2020-08-05 | Paper |
The threshold for SDP-refutation of random regular NAE-3SAT
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
On the integrality gap of degree-4 sum of squares for planted clique
ACM Transactions on Algorithms | 2018-11-13 | Paper |
On the integrality gap of degree-4 sum of squares for planted clique
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors
Random Structures & Algorithms | 2017-08-10 | Paper |
Global and Local Information in Clustering Labeled Block Models
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Gap amplification for small-set expansion via random walks
(available as arXiv preprint) | 2017-03-22 | Paper |
| Global and local information in clustering labeled block models | 2017-03-22 | Paper |
Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Spectral clustering in the Gaussian mixture block model
(available as arXiv preprint) | N/A | Paper |
