Seguir
Ankit Garg
Ankit Garg
Microsoft Research
Email confirmado em microsoft.com - Página inicial
Título
Citado por
Citado por
Ano
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
1802016
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
163*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
1032014
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
1002013
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
882017
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
842018
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
662019
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
66*2019
Monotone Circuit Lower Bounds from Resolution
A Garg, M Göös, P Kamath, D Sokolov
Electronic Colloquium on Computational Complexity (ECCC), 2017
622017
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
602017
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
512018
Small value parallel repetition for general games
M Braverman, A Garg
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
462015
Barriers for Rank Methods in Arithmetic Complexity
K Efremenko, A Garg, R Oliveira, A Wigderson
arXiv preprint arXiv:1710.09502, 2017
442017
Public vs private coin in bounded-round information
M Braverman, A Garg
International Colloquium on Automata, Languages, and Programming, 502-513, 2014
422014
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
402018
Information lower bounds via self-reducibility
M Braverman, A Garg, D Pankratov, O Weinstein
Theory of Computing Systems 59 (2), 377-396, 2016
342016
A Matrix Expander Chernoff Bound
A Garg, YT Lee, Z Song, N Srivastava
arXiv preprint arXiv:1704.03864, 2017
252017
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
212020
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
192018
Constructive extensions of two results on graphic sequences
A Garg, A Goel, A Tripathi
Discrete Applied Mathematics 159 (17), 2170-2174, 2011
192011
O sistema não pode efectuar a operação agora. Tente mais tarde.
Artigos 1–20