Information Lower Bounds via Self-reducibility. - Mark Braverman; Ankit Garg 001; Denis Pankratov; Omri Weinstein (CSR, 2013)

From information to exact communication. - Mark Braverman; Ankit Garg 001; Denis Pankratov; Omri Weinstein (STOC, 2013)

Public vs Private Coin in Bounded-Round Information. - Mark Braverman; Ankit Garg 001 (ICALP (1), 2014)

On Communication Cost of Distributed Statistical Estimation and Dimensionality. - Ankit Garg 001; Tengyu Ma 001; Huy L. Nguyen (NIPS, 2014)

Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness. - Mark Braverman; Ankit Garg 001; Young Kun-Ko; Jieming Mao; Dave Touchette (FOCS, 2015)

Small Value Parallel Repetition for General Games. - Mark Braverman; Ankit Garg 001 (STOC, 2015)

A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing. - Ankit Garg 001; Leonid Gurvits; Rafael Mendes de Oliveira; Avi Wigderson (FOCS, 2016)

Communication lower bounds for statistical estimation problems via a distributed data processing inequality. - Mark Braverman; Ankit Garg 001; Tengyu Ma 001; Huy L. Nguyen 001; David P. Woodruff (STOC, 2016)

Rank bounds for design matrices with block entries and geometric applications. - Zeev Dvir; Ankit Garg 001; Rafael Oliveira 002; József Solymosi (CoRR, 2016)

Algorithmic aspects of Brascamp-Lieb inequalities. - Ankit Garg 001; Leonid Gurvits; Rafael Mendes de Oliveira; Avi Wigderson (CoRR, 2016)

Information Theoretic Relaxations in Complexity Theory. - Ankit Garg 001 (2016)

Separating Quantum Communication and Approximate Rank. - Anurag Anshu; Shalev Ben-David; Ankit Garg 001; Rahul Jain 001; Robin Kothari; Troy Lee (CCC, 2017)

Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling. - Ankit Garg 001; Leonid Gurvits; Rafael Mendes de Oliveira; Avi Wigderson (STOC, 2017)

Classical Lower Bounds from Quantum Upper Bounds. - Shalev Ben-David; Adam Bouland; Ankit Garg 001; Robin Kothari (FOCS, 2018)

Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment Polytopes. - Peter Bürgisser; Cole Franks; Ankit Garg 001; Rafael Mendes de Oliveira; Michael Walter 005; Avi Wigderson (FOCS, 2018)

Alternating Minimization, Scaling Algorithms, and the Null-Cone Problem from Invariant Theory. - Peter Bürgisser; Ankit Garg 001; Rafael Mendes de Oliveira; Michael Walter 005; Avi Wigderson (ITCS, 2018)

Barriers for Rank Methods in Arithmetic Complexity. - Klim Efremenko; Ankit Garg 001; Rafael Mendes de Oliveira; Avi Wigderson (ITCS, 2018)

Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing. - Zeyuan Allen-Zhu; Ankit Garg 001; Yuanzhi Li; Rafael Mendes de Oliveira; Avi Wigderson (STOC, 2018)

Monotone circuit lower bounds from resolution. - Ankit Garg 001; Mika Göös; Pritish Kamath; Dmitry Sokolov 001 (STOC, 2018)

A matrix expander Chernoff bound. - Ankit Garg 001; Yin Tat Lee; Zhao Song 002; Nikhil Srivastava (STOC, 2018)

Recent progress on scaling algorithms and applications. - Ankit Garg 001; Rafael Mendes de Oliveira (Electron. Colloquium Comput. Complex., 2018)

Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes. - Peter Bürgisser; Cole Franks; Ankit Garg 001; Rafael Mendes de Oliveira; Michael Walter 005; Avi Wigderson (FOCS, 2019)

More Barriers for Rank Methods, via a "numeric to Symbolic" Transfer. - Ankit Garg 001; Visu Makam; Rafael Mendes de Oliveira; Avi Wigderson (FOCS, 2019)

Determinant Equivalence Test over Finite Fields and over Q. - Ankit Garg 001; Nikhil Gupta 008; Neeraj Kayal; Chandan Saha 001 (ICALP, 2019)

Towards a theory of non-commutative optimization: geodesic first and second order methods for moment maps and polytopes. - Peter Bürgisser; Cole Franks; Ankit Garg 001; Rafael Mendes de Oliveira; Michael Walter 005; Avi Wigderson (CoRR, 2019)

Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings. - Ankit Garg 001; Visu Makam; Rafael Mendes de Oliveira; Avi Wigderson (Electron. Colloquium Comput. Complex., 2019)

Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings. - Ankit Garg 001; Christian Ikenmeyer; Visu Makam; Rafael Mendes de Oliveira; Michael Walter 005; Avi Wigderson (CCC, 2020)

Learning sums of powers of low-degree polynomials in the non-degenerate case. - Ankit Garg 001; Neeraj Kayal; Chandan Saha 001 (FOCS, 2020)

Operator Scaling: Theory and Applications. - Ankit Garg 001; Leonid Gurvits; Rafael Mendes de Oliveira; Avi Wigderson (Found. Comput. Math., 2020)

No Quantum Speedup over Gradient Descent for Non-Smooth Convex Optimization. - Ankit Garg 001; Robin Kothari; Praneeth Netrapalli; Suhail Sherif (ITCS, 2021)

Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness. - Ankit Garg 001; Robin Kothari; Praneeth Netrapalli; Suhail Sherif (NeurIPS, 2021)

Learning Generalized Depth Three Arithmetic Circuits in the Non-Degenerate Case. - Vishwas Bhargava; Ankit Garg 001; Neeraj Kayal; Chandan Saha 001 (APPROX/RANDOM, 2022)

Low-depth arithmetic circuit lower bounds via shifted partials. - Prashanth Amireddy; Ankit Garg 001; Neeraj Kayal; Chandan Saha 001; Bhargav Thankey (Electron. Colloquium Comput. Complex., 2022)

Low-Depth Arithmetic Circuit Lower Bounds: Bypassing Set-Multilinearization. - Prashanth Amireddy; Ankit Garg 001; Neeraj Kayal; Chandan Saha 001; Bhargav Thankey (ICALP, 2023)

Learning Arithmetic Formulas in the Presence of Noise: A General Framework and Applications to Unsupervised Learning. - Pritam Chandra; Ankit Garg 001; Neeraj Kayal; Kunal Mittal; Tanmay Sinha (ITCS, 2024)

Incorporating Token Importance in Multi-Vector Retrieval. - Archish S; Ankit Garg 001; Kirankumar Shiragur; Neeraj Kayal (AAAI, 2026)

On Strengths and Limitations of Single-Vector Embeddings. - Archish S; Mihir Agarwal; Ankit Garg 001; Neeraj Kayal; Kirankumar Shiragur (CoRR, 2026)