Preprint Stochastic Makespan Minimization in Structured Set Systems 2020 Gupta A, Kumar A, Nagarajan V, Shen X
Conference Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract) 2020 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 12125:158-170 Gupta A, Kumar A, Nagarajan V, Shen X
Conference The Karger-Stein Algorithm Is Optimal for k-Cut 2020 • Annual ACM Symposium on Theory of Computing • 473-484 Gupta A, Lee E, Li J
Conference The Online Submodular Cover Problem 2020 • PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20) • 1525-1537 Gupta A, Levin R
Conference A Nearly-Linear Bound for Chasing Nested Convex Bodies 2019 • PROCEEDINGS OF THE 2019 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA • 117-122 Argue CJ, Bubeck S, Cohen MB, Gupta A, Lee YT
Journal Article APPROXIMATION ALGORITHMS FOR LOW-DISTORTION EMBEDDINGS INTO LOW-DIMENSIONAL SPACES 2019 • SIAM Journal on Discrete Mathematics • 33(1):454-473 Sidiropoulos A, Badoiu M, Dhamdhere K, Gupta A, Indyk P, Rabinovich Y, Racke H, Ravi R
Preprint Better Algorithms for Stochastic Bandits with Adversarial Corruptions 2019 Gupta A, Koren T, Talwar K
Conference Better Algorithms for Stochastic Bandits with Adversarial Corruptions 2019 • CONFERENCE ON LEARNING THEORY, VOL 99 • 99: Gupta A, Koren T, Talwar K
Preprint Chasing Convex Bodies with Linear Competitive Ratio 2019 Argue CJ, Gupta A, Guruganesh G, Tang Z
Journal Article COPS, ROBBERS, AND THREATENING SKELETONS: PADDED DECOMPOSITION FOR MINOR-FREE GRAPHS 2019 • SIAM journal on computing (Print) • 48(3):1120-1145 Abraham I, Gavoille C, Gupta A, Neiman O, Talwar K
Conference Elastic Caching 2019 • PROCEEDINGS OF THE 2019 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA • 143-156 Gupta A, Krishnaswamy R, Kumar A, Panigrahi D
Conference K-servers with a smile: Online algorithms via projections 2019 • Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms • 98-116 Buchbinder N, Gupta A, Molinaro M, Naor J
Conference Losing Treewidth by Separating Subsets 2019 • PROCEEDINGS OF THE 2019 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA • 1731-1749 Gupta A, Lee E, Li J, Manurangsi P, Wlodarczyk M
Conference Non-clairvoyant precedence constrained scheduling 2019 • Leibniz International Proceedings in Informatics • 132: Garg N, Gupta A, Kumar A, Singla S
Journal Article Potential-Function Proofs for Gradient Methods 2019 • Theory of Computing • 15: Bansal N, Gupta A
Conference Stochastic online metric matching 2019 • Leibniz International Proceedings in Informatics • 132: Gupta A, Guruganesh G, Peng B, Wajc D
Conference The Markovian Price of Information 2019 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 11480:233-246 Gupta A, Jiang H, Scully Z, Singla S
Conference The number of minimum k -cuts: improving the Karger-Stein bound 2019 • Annual ACM Symposium on Theory of Computing • 229-240 Gupta A, Lee E, Li J
Conference Tight FPT approximations for k-median and K-means 2019 • Leibniz International Proceedings in Informatics • 132: Cohen-Addad V, Gupta A, Kumar A, Lee E, Li J
Preprint $k$-Servers with a Smile: Online Algorithms via Projections 2018 Buchbinder N, Gupta A, Molinaro M, Joseph, Naor
Conference A Local-Search Algorithm for Steiner Forest 2018 • Leibniz International Proceedings in Informatics • 94: Gross M, Gupta A, Kumar A, Matuschke J, Schmidt DR, Schmidt M, Verschae J
Conference An FPT algorithm beating 2-approximation for k-cut 2018 • Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms • 2821-2837 Gupta A, Lee E, Li J
Conference Faster Exact and Approximate Algorithms for k-cut 2018 • Annual Symposium on Foundations of Computer Science • 113-123 Gupta A, Lee E, Li J
