Preprint A Hitting Set Relaxation for $k$-Server and an Extension to Time-Windows 2021 Gupta A, Kumar A, Panigrahi D
Preprint A Quasipolynomial $(2+\varepsilon)$-Approximation for Planar Sparsest Cut 2021 Cohen-Addad V, Gupta A, Klein PN, Li J
Conference A Quasipolynomial (2+ε)-Approximation for Planar Sparsest Cut 2021 • Annual ACM Symposium on Theory of Computing • 1056-1069 Cohen-Addad V, Gupta A, Klein PN, Li J
Conference Bag-of-tasks scheduling on related machines 2021 • Leibniz International Proceedings in Informatics • 207: Gupta A, Kumar A, Singla S
Journal Article Chasing Convex Bodies with Linear Competitive Ratio 2021 • Journal of the ACM • 68(5): Argue CJ, Gupta A, Tang Z, Guruganesh G
Conference Chasing Convex Bodies with Linear Competitive Ratio (Invited Paper) 2021 • Annual ACM Symposium on Theory of Computing • 5-5 Argue CJ, Gupta A, Guruganesh G, Tang Z
Journal Article Fair algorithms for selecting citizens' assemblies 2021 • Nature • 596(7873):548-+ Flanigan B, Golz P, Gupta A, Hennig B, Procaccia AD
Preprint Lipschitz Selectors may not Yield Competitive Algorithms for Convex Body Chasing 2021 Argue CJ, Gupta A, Molinaro M
Preprint Non-Adaptive Stochastic Score Classification and Explainable Halfspace Evaluation 2021 Ghuge R, Gupta A, Nagarajan V
Preprint Robust Secretary and Prophet Algorithms for Packing Integer Programs 2021 Argue CJ, Gupta A, Molinaro M, Singla S
Journal Article Stochastic Load Balancing on Unrelated Machines 2021 • Mathematics of Operations Research • 46(1):115-133 Gupta A, Kumar A, Nagarajan V, Shen X
Conference Structural iterative rounding for generalized k-median problems 2021 • Leibniz International Proceedings in Informatics • 198: Gupta A, Moseley B, Zhou R
Conference The connectivity threshold for dense graphs 2021 • Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms • 89-105 Gupta A, Lee E, Li J
Conference Caching with Time Windows 2020 • Annual ACM Symposium on Theory of Computing • 1125-1138 Gupta A, Kumar A, Panigrahi D
Conference Chasing Convex Bodies with Linear Competitive Ratio 2020 • PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20) • 1519-1524 Argue CJ, Gupta A, Guruganesh G, Tang Z
Conference Dimension-Free Bounds for Chasing Convex Functions 2020 • CONFERENCE ON LEARNING THEORY, VOL 125 • 125: Argue CJ, Gupta A, Guruganesh G
Conference Fully-Dynamic Submodular Cover with Bounded Recourse 2020 • Annual Symposium on Foundations of Computer Science • 1147-1157 Gupta A, Levin R
Preprint Neutralizing Self-Selection Bias in Sampling for Sortition 2020 Flanigan B, Gölz P, Gupta A, Procaccia A
Journal Article Neutralizing self-selection bias in sampling for sortition 2020 • Advances in Neural Information Processing Systems • 2020-December: Flanigan B, Gölz P, Gupta A, Procaccia AD
Conference Online carpooling using expander decompositions 2020 • Leibniz International Proceedings in Informatics • 182: Gupta A, Krishnaswamy R, Kumar A, Singla S
Conference Robust algorithms for the secretary problem 2020 • Leibniz International Proceedings in Informatics • 151: Bradac D, Gupta A, Singla S, Zuzic G
