Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing
Algorithmic and optimization aspects of brascamp-lieb inequalities, via operator scaling
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
Expanders that beat the eigenvalue bound
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC ’93
Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC ’98
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC’07)
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017
Rafael Oliveira
Ankit Garg
Zeyuan Allen-Zhu
Leonid Gurvits
Nathan Linial
Yuanzhi Li
The Paulsen problem, continuous operator scaling, and smoothed analysis
Random graphs and the parity quantifier
Uncertainty principles, extractors, and explicit embeddings of l2 into l1
Inverse conjecture for the gowers norm is false