| Communication lower bounds for statistical estimation problems via a distributed data processing inequality M Braverman, A Garg, T Ma, HL Nguyen, DP Woodruff Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 206 | 2016 |
| A deterministic polynomial time algorithm for non-commutative rational identity testing A Garg, L Gurvits, R Oliveira, A Wigderson Foundations of Computer Science (FOCS), 2016 IEEE 57th Annual Symposium on …, 2016 | 181* | 2016 |
| On communication cost of distributed statistical estimation and dimensionality A Garg, T Ma, H Nguyen Advances in Neural Information Processing Systems 27, 2726-2734, 2014 | 114 | 2014 |
| Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling A Garg, L Gurvits, R Oliveira, A Wigderson Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 103 | 2017 |
| From information to exact communication M Braverman, A Garg, D Pankratov, O Weinstein Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 102 | 2013 |
| Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing Z Allen-Zhu, A Garg, Y Li, R Oliveira, A Wigderson Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 96 | 2018 |
| Towards a theory of non-commutative optimization: geodesic 1st and 2nd order methods for moment maps and polytopes P Bürgisser, C Franks, A Garg, R Oliveira, M Walter, A Wigderson 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 79 | 2019 |
| Towards a theory of non-commutative optimization: geodesic first and second order methods for moment maps and polytopes P Bürgisser, C Franks, A Garg, R Oliveira, M Walter, A Wigderson arXiv preprint arXiv:1910.12375, 2019 | 79* | 2019 |
| Monotone Circuit Lower Bounds from Resolution A Garg, M Göös, P Kamath, D Sokolov Electronic Colloquium on Computational Complexity (ECCC), 2017 | 71 | 2017 |
| Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory P Bürgisser, A Garg, R Oliveira, M Walter, A Wigderson arXiv preprint arXiv:1711.08039, 2017 | 66 | 2017 |
| Efficient algorithms for tensor scaling, quantum marginals, and moment polytopes P Bürgisser, C Franks, A Garg, R Oliveira, M Walter, A Wigderson 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018 | 57 | 2018 |
| Public vs private coin in bounded-round information M Braverman, A Garg International Colloquium on Automata, Languages, and Programming, 502-513, 2014 | 48 | 2014 |
| Barriers for Rank Methods in Arithmetic Complexity K Efremenko, A Garg, R Oliveira, A Wigderson arXiv preprint arXiv:1710.09502, 2017 | 47 | 2017 |
| Small value parallel repetition for general games M Braverman, A Garg Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015 | 47 | 2015 |
| Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness M Braverman, A Garg, YK Ko, J Mao, D Touchette SIAM Journal on Computing 47 (6), 2277-2314, 2018 | 42 | 2018 |
| Information lower bounds via self-reducibility M Braverman, A Garg, D Pankratov, O Weinstein Theory of Computing Systems 59 (2), 377-396, 2016 | 35 | 2016 |
| Learning sums of powers of low-degree polynomials in the non-degenerate case A Garg, N Kayal, C Saha arXiv preprint arXiv:2004.06898, 2020 | 30 | 2020 |
| A Matrix Expander Chernoff Bound A Garg, YT Lee, Z Song, N Srivastava arXiv preprint arXiv:1704.03864, 2017 | 29 | 2017 |
| Classical lower bounds from quantum upper bounds S Ben-David, A Bouland, A Garg, R Kothari 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018 | 23 | 2018 |
| No quantum speedup over gradient descent for non-smooth convex optimization A Garg, R Kothari, P Netrapalli, S Sherif arXiv preprint arXiv:2010.01801, 2020 | 21 | 2020 |
Rafael OliveiraUniversity of WaterlooVerified email at uwaterloo.ca