Conference Quorum placement in networks 2006 • Proceedings of the Annual ACM Symposium on Principles of Distributed Computing • 16-25 Golovin D, Gupta A, Maggs BM, Oprea F, Reiter MK
Conference Securing Sensor Networks Using A Novel Multi-Channel Architecture 2006 1-10 Gui C, Gupta A, Mohapatra P
Conference Small Hop-diameter Sparse Spanners for Doubling Metrics 2006 • PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS • 70-78 Chan T-HH, Gupta A
Conference Spanners with slack 2006 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 4168:196-207 Chan T-HH, Dinitz M, Gupta A
Conference Approximation Algorithms for Low-Distortion Embeddings Into Low-Dimensional Spaces 2005 • PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS • 119-128 Badoiu M, Dhamdhere K, Gupta A, Rabinovich Y, Raecke H, Ravi R, Sidiropoulos A
Journal Article Building edge-failure resilient networks 2005 • Algorithmica • 43(1-2):17-41 Chekuri C, Gupta A, Kumar A, Naor J, Raz D
Conference Metric Embeddings with Relaxed Guarantees 2005 • Annual Symposium on Foundations of Computer Science • 83-100 Abraham I, Bartal Y, Chan T-HH, Dhamdhere K, Gupta A, Kleinberg J, Neiman O, Slivkins A
Journal Article On a bidirected relaxation for the MULTIWAY CUT problem 2005 • Discrete Applied Mathematics • 150(1-3):67-79 Chekuri C, Gupta A, Kumar A
Conference On the approximability of some network design problems 2005 • Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms • 943-951 Chuzhoy J, Gupta A, Naor J, Sinha A
Conference Quorum placement in networks to minimize access delays 2005 • Proceedings of the Annual ACM Symposium on Principles of Distributed Computing • 87-96 Gupta A, Maggs BM, Oprea F, Reiter MK
Conference Stochastic Steiner trees without a root 2005 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 3580:1051-1063 Gupta A, Pál M
Conference What about wednesday? Approximation algorithms for multistage stochastic optimization 2005 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 3624:86-98 Gupta A, Pál M, Ravi R, Sinha A
Conference Where's the winner? Max-finding and sorting with metric costs 2005 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 3624:74-85 Gupta A, Kumar A
Conference An edge in time saves nine: LP rounding approximation algorithms for stochastic network design 2004 • Annual Symposium on Foundations of Computer Science • 218-227 Gupta A, Ravi R, Sinha A
Journal Article Approximation algorithms for minimizing average distortion 2004 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 2996:234-245 Dhamdhere K, Gupta A, Ravi R
Conference Boosted sampling 2004 • Conference Proceedings of the Annual ACM Symposium on Theory of Computing • 417-426 Gupta A, Pál M, Ravi R, Sinha A
Journal Article Cost-sharing mechanisms for network design 2004 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 3122:139-150 Gupta A, Srinivasan A, Tardos É
Journal Article Cuts, trees and <i>l</i><sub>1</sub>-embeddings of graphs 2004 • Combinatorica • 24(2):233-269 Gupta A, Newman I, Rabinovich Y, Sinclair A
Journal Article Traveling with a pez dispenser (or, routing issues in MPLS) 2004 • SIAM journal on computing (Print) • 34(2):453-474 Gupta A, Kumar A, Rastogi R
Journal Article An elementary proof of a theorem of Johnson and Lindenstrauss 2003 • Random structures & algorithms (Print) • 22(1):60-65 Dasgupta S, Gupta A
Conference Approximation via cost-sharing: A simple approximation algorithm for the multicommodity rent-or-buy problem 2003 • Annual Symposium on Foundations of Computer Science • 606-615 Gupta A, Kumar A, Pál M, Roughgarden T
Conference Approximation via cost-sharing: A simple approximation algorithm for the multicommodity rent-or-buy problem 2003 • Annual Symposium on Foundations of Computer Science • 606-615 Gupta A, Kumar A, Pál M, Roughgarden T
Conference Bounded geometries, fractals, and low-distortion embeddings 2003 • Annual Symposium on Foundations of Computer Science • 534-543 Gupta A, Krauthgamer R, Lee JR
Conference Bounded geometries, fractals, and low-distortion embeddings 2003 • Annual Symposium on Foundations of Computer Science • 534-543 Gupta A, Krauthgamer R, Lee JR
