| Publication | Date of Publication | Type |
|---|
Fitting an ellipsoid to random points: predictions using the replica method
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
On the concentration of Gaussian Cayley matrices
Applied and Computational Harmonic Analysis | 2025-01-06 | Paper |
| Optimality of Glauber dynamics for general-purpose Ising model sampling and free energy approximation | 2024-11-28 | Paper |
| A degree 4 sum-of-squares lower bound for the clique number of the Paley graph | 2024-11-19 | Paper |
| Strong recovery of geometric planted matchings | 2024-07-19 | Paper |
Subexponential-time algorithms for sparse PCA
Foundations of Computational Mathematics | 2024-07-03 | Paper |
Linear Programming and Community Detection
Mathematics of Operations Research | 2024-02-23 | Paper |
The Spectrum of the Grigoriev–Laurent Pseudomoments
SIAM Journal on Discrete Mathematics | 2024-01-10 | Paper |
| Fitting an ellipsoid to random points: predictions using the replica method | 2023-10-02 | Paper |
| Optimality of Glauber dynamics for general-purpose Ising model sampling and free energy approximation | 2023-07-24 | Paper |
| Online Algorithms and Lower Bounds for Average-Case Matrix Discrepancy | 2023-07-19 | Paper |
The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant
SIAM Journal on Discrete Mathematics | 2023-05-31 | Paper |
| Spectral pseudorandomness and the road to improved clique number bounds for Paley graphs | 2023-03-29 | Paper |
scientific article; zbMATH DE number 7650426 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| Generic MANOVA limit theorems for products of projections | 2023-01-23 | Paper |
Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio
(available as arXiv preprint) | 2022-12-13 | Paper |
| On the concentration of Gaussian Cayley matrices | 2022-11-30 | Paper |
Dual bounds for the positive definite functions approach to mutually unbiased bases
Sampling Theory, Signal Processing, and Data Analysis | 2022-11-17 | Paper |
Dual bounds for the positive definite functions approach to mutually unbiased bases
(available as arXiv preprint) | 2022-02-26 | Paper |
The Average-Case Time Complexity of Certifying the Restricted Isometry Property
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian
Mathematical Programming. Series A. Series B | 2021-10-20 | Paper |
| Strong recovery of geometric planted matchings | 2021-07-12 | Paper |
| Hypothesis testing with low-degree polynomials in the Morris class of exponential families | 2020-11-06 | Paper |
| Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs | 2020-08-27 | Paper |
Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio
(available as arXiv preprint) | 2019-07-26 | Paper |
Computational Hardness of Certifying Bounds on Constrained PCA Problems
(available as arXiv preprint) | 2019-02-19 | Paper |
| Sum-of-Squares Optimization and the Sparsity Structure of Equiangular Tight Frames | 2019-01-30 | Paper |
| A Gramian Description of the Degree 4 Generalized Elliptope | 2018-12-30 | Paper |
Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing
(available as arXiv preprint) | N/A | Paper |
Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs
(available as arXiv preprint) | N/A | Paper |
Tensor cumulants for statistical inference on invariant distributions
(available as arXiv preprint) | N/A | Paper |
