Anupam Gupta
Anupam Gupta
Professor of Computer Science, Carnegie Mellon University
Verified email at cs.cmu.edu
TitleCited byYear
An elementary proof of a theorem of Johnson and Lindenstrauss
S Dasgupta, A Gupta
Random Structures & Algorithms 22 (1), 60-65, 2003
8092003
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
4882006
Bounded geometries, fractals, and low-distortion embeddings
A Gupta, R Krauthgamer, JR Lee
44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003
3912003
An elementary proof of the Johnson-Lindenstrauss lemma
S Dasgupta, A Gupta
International Computer Science Institute, Technical Report 22 (1), 1-5, 1999
3481999
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
3422001
An elementary proof of the Johnson-Lindenstrauss lemma
S Dasgupta, A Gupta
International Computer Science Institute, Technical Report 22 (1), 1-5, 1999
3381999
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
2352003
Robust submodular observation selection
A Krause, HB McMahan, C Guestrin, A Gupta
Journal of Machine Learning Research 9 (Dec), 2761-2801, 2008
2152008
Simpler and better approximation algorithms for network design
A Gupta, A Kumar, T Roughgarden
STOC 3, 365-372, 2003
2012003
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
1812004
Cuts, Trees and ℓ1-Embeddings of Graphs
A Gupta, I Newman, Y Rabinovich, A Sinclair
Combinatorica 24 (2), 233-269, 2004
1742004
Approximate clustering without the approximation
MF Balcan, A Blum, A Gupta
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
1452009
Iterative constructions and private data release
A Gupta, A Roth, J Ullman
Theory of cryptography conference, 339-356, 2012
1382012
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
1262010
On hierarchical routing in doubling metrics
HTH Chan, A Gupta, BM Maggs, S Zhou
Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005
1212005
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
1162013
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, 2010
1092010
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
1092010
Steiner points in tree metrics don't (really) help
A Gupta
Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms …, 2001
922001
Forest density estimation
H Liu, M Xu, H Gu, A Gupta, J Lafferty, L Wasserman
Journal of Machine Learning Research 12 (Mar), 907-951, 2011
872011
The system can't perform the operation now. Try again later.
Articles 1–20