| 2026 | ICALP | Expander Decomposition with Almost Optimal Overhead. | Nikhil Bansal, Arun Jambulapati, Thatchaphol Saranurak |
| 2025 | FOCS | Radial Isotropic Position via an Implicit Newton's Method. | Arun Jambulapati, Jonathan Li, Kevin Tian |
| 2025 | SODA | Eulerian Graph Sparsification by Effective Resistance Decomposition. | Arun Jambulapati, Sushant Sachdeva, Aaron Sidford, Kevin Tian, Yibin Zhao |
| 2024 | COLT | Black-Box k-to-1-PCA Reductions: Theory and Applications. | Arun Jambulapati, Syamantak Kumar, Jerry Li, Shourya Pandey, Ankit Pensia, Kevin Tian |
| 2024 | COLT | Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization. | Arun Jambulapati, Aaron Sidford, Kevin Tian |
| 2024 | SODA | A Whole New Ball Game: A Primal Accelerated Method for Matrix Games and Minimizing the Maximum of Smooth Functions. | Yair Carmon, Arun Jambulapati, Yujia Jin, Aaron Sidford |
| 2024 | SODA | Linear-Sized Sparsifiers via Near-Linear Time Discrepancy Theory. | Arun Jambulapati, Victor Reis, Kevin Tian |
| 2024 | STOC | Sparsifying Generalized Linear Models. | Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford |
| 2023 | FOCS | ReSQueing Parallel and Private Stochastic Convex Optimization. | Yair Carmon, Arun Jambulapati, Yujia Jin, Yin Tat Lee, Daogao Liu, Aaron Sidford, Kevin Tian |
| 2023 | FOCS | Sparsifying Sums of Norms. | Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford |
| 2023 | STOC | Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification. | Arun Jambulapati, Yang P. Liu, Aaron Sidford |
| 2022 | ICALP | Regularized Box-Simplex Games and Dynamic Decremental Bipartite Matching. | Arun Jambulapati, Yujia Jin, Aaron Sidford, Kevin Tian |
| 2022 | ICML | RECAPP: Crafting a More Efficient Catalyst for Convex Optimization. | Yair Carmon, Arun Jambulapati, Yujia Jin, Aaron Sidford |
| 2022 | SODA | Semi-Streaming Bipartite Matching in Fewer Passes and Optimal Space. | Sepehr Assadi, Arun Jambulapati, Yujia Jin, Aaron Sidford, Kevin Tian |
| 2022 | STOC | Faster maxflow via improved dynamic spectral vertex sparsifiers. | Jan van den Brand, Yu Gao, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, Aaron Sidford |
| 2022 | STOC | Improved iteration complexities for overconstrained | Arun Jambulapati, Yang P. Liu, Aaron Sidford |
| 2021 | COLT | Thinking Inside the Ball: Near-Optimal Minimization of the Maximal Loss. | Yair Carmon, Arun Jambulapati, Yujia Jin, Aaron Sidford |
| 2021 | SODA | Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers. | Arun Jambulapati, Aaron Sidford |
| 2020 | STOC | Positive semidefinite programming: mixed, parallel, and width-independent. | Arun Jambulapati, Yin Tat Lee, Jerry Li, Swati Padmanabhan, Kevin Tian |
| 2019 | FOCS | Parallel Reachability in Almost Linear Work and Square Root Depth. | Yang P. Liu, Arun Jambulapati, Aaron Sidford |
| 2019 | SODA | Perron-Frobenius Theory in Nearly Linear Time: Positive Eigenvectors, M-matrices, Graph Kernels, and Other Applications. | AmirMahdi Ahmadinejad, Arun Jambulapati, Amin Saberi, Aaron Sidford |
| 2018 | SODA | Efficient | Arun Jambulapati, Aaron Sidford |