| An elementary proof of a theorem of Johnson and Lindenstrauss S Dasgupta, A Gupta Random Structures & Algorithms 22 (1), 60-65, 2003 | 945 | 2003 |
| Near-optimal sensor placements: Maximizing information while minimizing communication cost A Krause, C Guestrin, A Gupta, J Kleinberg Proceedings of the 5th international conference on Information processing in …, 2006 | 536 | 2006 |
| Bounded geometries, fractals, and low-distortion embeddings A Gupta, R Krauthgamer, JR Lee 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003 | 428 | 2003 |
| An elementary proof of the Johnson-Lindenstrauss lemma S Dasgupta, A Gupta International Computer Science Institute, Technical Report 22 (1), 1-5, 1999 | 387 | 1999 |
| An elementary proof of the Johnson-Lindenstrauss lemma S Dasgupta, A Gupta International Computer Science Institute, Technical Report 22 (1), 1-5, 1999 | 372 | 1999 |
| Provisioning a virtual private network: A network design problem for multicommodity flow A Gupta, J Kleinberg, A Kumar, R Rastogi, B Yener Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001 | 359 | 2001 |
| Robust Submodular Observation Selection. A Krause, HB McMahan, C Guestrin, A Gupta Journal of Machine Learning Research 9 (12), 2008 | 280 | 2008 |
| Intravenous immunoglobulin for the treatment of Kawasaki disease in children RM Oates‐Whitehead, JH Baumer, L Haines, S Love, IK Maconochie, ... Cochrane Database of Systematic Reviews, 2003 | 276 | 2003 |
| Simpler and better approximation algorithms for network design A Gupta, A Kumar, T Roughgarden Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 208 | 2003 |
| Boosted sampling: approximation algorithms for stochastic optimization A Gupta, M Pál, R Ravi, A Sinha Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004 | 191 | 2004 |
| Cuts, trees and ℓ 1-embeddings of graphs A Gupta, I Newman, Y Rabinovich, A Sinclair Combinatorica 24 (2), 233-269, 2004 | 184 | 2004 |
| Constrained non-monotone submodular maximization: Offline and secretary algorithms A Gupta, A Roth, G Schoenebeck, K Talwar International Workshop on Internet and Network Economics, 246-257, 2010 | 169 | 2010 |
| Iterative constructions and private data release A Gupta, A Roth, J Ullman Theory of cryptography conference, 339-356, 2012 | 164 | 2012 |
| Approximate clustering without the approximation MF Balcan, A Blum, A Gupta Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009 | 159 | 2009 |
| Differentially private combinatorial optimization A Gupta, K Ligett, F McSherry, A Roth, K Talwar Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 157 | 2010 |
| Privately releasing conjunctions and the statistical query barrier A Gupta, M Hardt, A Roth, J Ullman SIAM Journal on Computing 42 (4), 1494-1520, 2013 | 139 | 2013 |
| Systematic review and meta‐analysis of outcomes following emergency surgery for Clostridium difficile colitis A Bhangu, D Nepogodiev, A Gupta, A Torrance, P Singh, ... British journal of surgery 99 (11), 1501-1513, 2012 | 130 | 2012 |
| On hierarchical routing in doubling metrics THH Chan, A Gupta, BM Maggs, S Zhou Carnegie Mellon University, 2005 | 130 | 2005 |
| Discovering pathways by orienting edges in protein interaction networks A Gitter, J Klein-Seetharaman, A Gupta, Z Bar-Joseph Nucleic acids research 39 (4), e22-e22, 2011 | 115 | 2011 |
| Forest density estimation H Liu, M Xu, H Gu, A Gupta, J Lafferty, L Wasserman The Journal of Machine Learning Research 12, 907-951, 2011 | 108 | 2011 |
R RaviCarnegie Mellon UnviersityVerified email at andrew.cmu.edu
