| Publication | Date of Publication | Type |
|---|
Efficient algorithms for the Potts model on small-set expanders
(available as arXiv preprint) | N/A | Paper |
| A spectral approach to approximately counting independent sets in dense bipartite graphs | 2026-01-14 | Paper |
| Algorithms for the ferromagnetic Potts model on expanders | 2025-08-15 | Paper |
Algorithms for the ferromagnetic Potts model on expanders
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
Efficient algorithms for the Potts model on small-set expanders
Chicago Journal of Theoretical Computer Science | 2024-05-14 | Paper |
Computational thresholds for the fixed-magnetization Ising model
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
| Approximately counting independent sets in dense bipartite graphs via subspace enumeration | 2023-07-18 | Paper |
| Lower bounds for max-cut via semidefinite programming | 2022-10-13 | Paper |
| Spectral aspects of symmetric matrix signings | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561741 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| Algorithms for the ferromagnetic Potts model on expanders | 2022-04-04 | Paper |
Dimension-free \(L^p\)-maximal inequalities for spherical means in \(\mathbb{Z}_{m+1}^N\)
IMRN. International Mathematics Research Notices | 2021-09-21 | Paper |
| On the expansion of group-based lifts | 2021-07-28 | Paper |
Spectrally robust graph isomorphism
(available as arXiv preprint) | 2021-07-28 | Paper |
Lower bounds for max-cut in H-free graphs via semidefinite programming
SIAM Journal on Discrete Mathematics | 2021-07-23 | Paper |
Spectral aspects of symmetric matrix signings
Discrete Optimization | 2020-07-30 | Paper |
Statistical physics approaches to Unique Games
(available as arXiv preprint) | 2019-11-04 | Paper |
Optimal lower bounds for sketching graph cuts
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
On the expansion of group-based lifts
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
Approximation of non-Boolean 2CSP
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Invertibility and Largest Eigenvalue of Symmetric Matrix Signings | 2016-11-11 | Paper |
Unique games on the hypercube
Chicago Journal of Theoretical Computer Science | 2015-08-07 | Paper |
| Multisection in the Stochastic Block Model using Semidefinite Programming | 2015-07-08 | Paper |
Dimension-free L2 maximal inequality for spherical means in the hypercube
Theory of Computing | 2014-10-06 | Paper |
Subgraph sparsification and nearly optimal ultrasparsifiers
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
How to Play Unique Games Against a Semi-random Adversary: Study of Semi-random Models of Unique Games
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
| Dimension-Free $L^p$-Maximal Inequalities in $\mathbb{Z}_{m+1}^N$ | 2014-06-27 | Paper |
Spectral algorithms for unique games
Computational Complexity | 2011-11-08 | Paper |
scientific article; zbMATH DE number 5568627 (Why is no real title available?)
(available as arXiv preprint) | 2009-06-23 | Paper |
| Unique games on expanding constraint graphs are easy (extended abstract) | 2009-01-05 | Paper |
Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks
Automata, Languages and Programming | 2008-08-19 | Paper |
