| Much faster algorithms for matrix scaling Z Allen-Zhu, Y Li, R Oliveira, A Wigderson 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 130 | 2017 |
| 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 | 130 | 2016 |
| 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 | 119* | 2017 |
| 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 | 95 | 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 | 82 | 2019 |
| Operator scaling: theory and applications A Garg, L Gurvits, R Oliveira, A Wigderson Foundations of Computational Mathematics 20 (2), 223-290, 2020 | 75 | 2020 |
| 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 | 58 | 2018 |
| Barriers for rank methods in arithmetic complexity K Efremenko, A Garg, R Oliveira, A Wigderson arXiv preprint arXiv:1710.09502, 2017 | 48 | 2017 |
| Locally testable and locally correctable codes approaching the Gilbert-Varshamov bound S Gopi, S Kopparty, R Oliveira, N Ron-Zewi, S Saraf IEEE Transactions on Information Theory 64 (8), 5813-5831, 2018 | 42 | 2018 |
| Subexponential size hitting sets for bounded depth multilinear formulas R Oliveira, A Shpilka, BL Volk computational complexity 25, 455-505, 2016 | 31 | 2016 |
| Factors of low individual degree polynomials R Oliveira computational complexity 25, 507-561, 2016 | 27 | 2016 |
| Testing equivalence of polynomials under shifts Z Dvir, RM De Oliveira, A Shpilka International Colloquium on Automata, Languages, and Programming, 417-428, 2014 | 26 | 2014 |
| Rank bounds for design matrices with block entries and geometric applications Z Dvir, A Garg, R Oliveira, J Solymosi arXiv preprint arXiv:1610.08923, 2016 | 21 | 2016 |
| Recent progress on scaling algorithms and applications A Garg, R Oliveira arXiv preprint arXiv:1808.09669, 2018 | 18 | 2018 |
| Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings A Garg, C Ikenmeyer, V Makam, R Oliveira, M Walter, A Wigderson arXiv preprint arXiv:1910.01251, 2019 | 17 | 2019 |
| Near optimal sample complexity for matrix and tensor normal models via geodesic convexity C Franks, R Oliveira, A Ramachandran, M Walter arXiv preprint arXiv:2110.07583, 2021 | 15 | 2021 |
| More barriers for rank methods, via a" numeric to symbolic" transfer A Garg, V Makam, R Oliveira, A Wigderson 2019 IEEE 60th annual symposium on Foundations of Computer Science (FOCS …, 2019 | 11 | 2019 |
| Operator scaling: theory and applications A Garg, L Gurvits, R Oliveira, A Wigderson arXiv preprint arXiv:1511.03730, 2015 | 11 | 2015 |
| Towards optimal depth reductions for syntactically multilinear circuits M Kumar, R Oliveira, R Saptharishi arXiv preprint arXiv:1902.07063, 2019 | 10 | 2019 |
Ankit GargMicrosoft ResearchE-mailová adresa ověřena na: microsoft.com