Anupam Gupta

	2012
133		Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs: Scheduling heterogeneous processors isn't as easy as you think. SODA 2012: 1242-1253
132		Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi: Approximation algorithms for stochastic orienteering. SODA 2012: 1522-1538
131		Anupam Gupta, Aaron Roth, Jonathan Ullman: Iterative Constructions and Private Data Release. TCC 2012: 339-356
130		Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra: When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings. Algorithmica 63(4): 733-762 (2012)
	2011
129		Avrim Blum, Anupam Gupta, Yishay Mansour, Ankit Sharma: Welfare and Profit Maximization with Production Costs. FOCS 2011: 77-86
128		Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi: Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits. FOCS 2011: 827-836
127		Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan: Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs. SPAA 2011: 13-22
126		Anupam Gupta, Moritz Hardt, Aaron Roth, Jonathan Ullman: Privately releasing conjunctions and the statistical query barrier. STOC 2011: 803-812
125		Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev: Set connectivity problems in undirected graphs and the directed steiner network problem. ACM Transactions on Algorithms 7(2): 18 (2011)
124		Anupam Gupta, Kunal Talwar: Making Doubling Metrics Geodesic. Algorithmica 59(1): 66-80 (2011)
123		Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi: Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits CoRR abs/1102.3749: (2011)
122		Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs: Scalably Scheduling Power-Heterogeneous Processors CoRR abs/1105.3748: (2011)
121		Anupam Gupta, Aaron Roth, Jonathan Ullman: Iterative Constructions and Private Data Release CoRR abs/1107.3731: (2011)
120		Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs: Online Primal-Dual For Non-linear Optimization with Applications to Speed Scaling CoRR abs/1109.5931: (2011)
119		Avrim Blum, Anupam Gupta, Yishay Mansour, Ankit Sharma: Welfare and Profit Maximization with Production Costs CoRR abs/1110.4992: (2011)
118		Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan: Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs CoRR abs/1111.1750: (2011)
117		Andreas Krause, Ram Rajagopal, Anupam Gupta, Carlos Guestrin: Simultaneous Optimization of Sensor Placements and Balanced Schedules. IEEE Trans. Automat. Contr. 56(10): 2390-2405 (2011)
116		Han Liu, Min Xu, Haijie Gu, Anupam Gupta, John D. Lafferty, Larry A. Wasserman: Forest Density Estimation. Journal of Machine Learning Research 12: 907-951 (2011)
115		Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha: Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems. SIAM J. Comput. 40(5): 1361-1401 (2011)
114		Andreas Krause, Carlos Guestrin, Anupam Gupta, Jon M. Kleinberg: Robust sensor placements at informative and communication-efficient locations. TOSN 7(4): 31 (2011)
	2010
113		Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar: Vertex Sparsifiers: New Results from Old Techniques. APPROX-RANDOM 2010: 152-165
112		Anupam Gupta, John D. Lafferty, Han Liu, Larry A. Wasserman, Min Xu: Forest Density Estimation. COLT 2010: 394-406
111		Vyas Sekar, Anupam Gupta, Mike K. Reiter, Hui Zhang: Coordinated sampling sans Origin-Destination identifiers: Algorithms and analysis. COMSNETS 2010: 1-10
110		Vyas Sekar, Ravishankar Krishnaswamy, Anupam Gupta, Michael K. Reiter: Network-wide deployment of intrusion detection and prevention systems. CoNEXT 2010: 18
109		Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra: When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract). ESA (2) 2010: 218-229
108		Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs: Nonclairvoyantly scheduling power-heterogeneous processors. Green Computing Conference 2010: 165-173
107		Anupam Gupta, Viswanath Nagarajan, R. Ravi: Thresholded Covering Algorithms for Robust and Max-min Optimization. ICALP (1) 2010: 262-274
106		Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs: Scalably Scheduling Power-Heterogeneous Processors. ICALP (1) 2010: 312-323
105		Anupam Gupta, Viswanath Nagarajan, R. Ravi: Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. ICALP (1) 2010: 690-701
104		Anupam Gupta, Katrina Ligett, Frank McSherry, Aaron Roth, Kunal Talwar: Differentially Private Combinatorial Optimization. SODA 2010: 1106-1125
103		Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi: Tree Embeddings for Two-Edge-Connected Network Design. SODA 2010: 1521-1538
102		Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy: A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover. SODA 2010: 1539-1545
101		Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs: Scheduling jobs with varying parallelizability to reduce variance. SPAA 2010: 11-20
100		Anupam Gupta, Aaron Roth, Grant Schoenebeck, Kunal Talwar: Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms. WINE 2010: 246-257
99		Anupam Gupta, Mohammad Taghi Hajiaghayi, Viswanath Nagarajan, R. Ravi: Dial a Ride from k-forest. ACM Transactions on Algorithms 6(2): (2010)
98		Nikhil Bansal, Anupam Gupta, Viswanath Nagarajan, Atri Rudra: When LP is the Cure for Your Matching Woes: Approximating Stochastic Matchings CoRR abs/1003.0167: (2010)
97		Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi: Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems CoRR abs/1003.0722: (2010)
96		Anupam Gupta, Aaron Roth, Grant Schoenebeck, Kunal Talwar: Constrained Non-Monotone Submodular Maximization: Offline and Secretary Algorithms CoRR abs/1003.1517: (2010)
95		Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Räcke, Inbal Talgam-Cohen, Kunal Talwar: Vertex Sparsifiers: New Results from Old Techniques CoRR abs/1006.4586: (2010)
94		Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra: When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings CoRR abs/1008.5356: (2010)
93		Anupam Gupta, Moritz Hardt, Aaron Roth, Jonathan Ullman: Privately Releasing Conjunctions and the Statistical Query Barrier CoRR abs/1011.1296: (2010)
92		Anupam Gupta, Viswanath Nagarajan, R. Ravi: Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets CoRR abs/1012.4962: (2010)
91		T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar: Ultra-low-dimensional embeddings for doubling metrics. J. ACM 57(4): (2010)
90		Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Viswanath Nagarajan: A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems. Math. Oper. Res. 35(1): 79-101 (2010)
89		Anupam Gupta, Viswanath Nagarajan, R. Ravi: An improved approximation algorithm for requirement cut. Oper. Res. Lett. 38(4): 322-325 (2010)
	2009
88		Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev: Scheduling with Outliers. APPROX-RANDOM 2009: 149-162
87		Andreas Krause, Ram Rajagopal, Anupam Gupta, Carlos Guestrin: Simultaneous placement and scheduling of sensors. IPSN 2009: 181-192
86		Maria-Florina Balcan, Avrim Blum, Anupam Gupta: Approximate clustering without the approximation. SODA 2009: 1068-1077
85		Moshe Babaioff, Michael Dinitz, Anupam Gupta, Nicole Immorlica, Kunal Talwar: Secretary problems: weights and discounts. SODA 2009: 1245-1254
84		Anupam Gupta, Amit Kumar: A constant-factor approximation for stochastic Steiner forest. STOC 2009: 659-668
83		Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi: Online and stochastic survivable network design. STOC 2009: 685-694
82		Anupam Gupta, Katrina Ligett, Frank McSherry, Aaron Roth, Kunal Talwar: Differentially Private Approximation Algorithms CoRR abs/0903.4510: (2009)
81		Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev: Scheduling with Outliers CoRR abs/0906.2020: (2009)
80		Anupam Gupta, Viswanath Nagarajan, R. Ravi: Thresholded Covering Algorithms for Robust and Max-Min Optimization CoRR abs/0912.1045: (2009)
79		T.-H. Hubert Chan, Anupam Gupta: Small Hop-diameter Sparse Spanners for Doubling Metrics. Discrete & Computational Geometry 41(1): 28-44 (2009)
78		T.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Aleksandrs Slivkins: Metric Embeddings with Relaxed Guarantees. SIAM J. Comput. 38(6): 2303-2329 (2009)
	2008
77		Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh: Set Covering with our Eyes Closed. FOCS 2008: 347-356
76		Daniel Golovin, Anupam Gupta, Amit Kumar, Kanat Tangwongsan: All-Norms and All-L_p-Norms Approximation Algorithms. FSTTCS 2008: 199-210
75		Anupam Gupta, Kunal Talwar: How to Complete a Doubling Metric. LATIN 2008: 36-47
74		Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Viswanath Nagarajan: A plant location guide for the unsure. SODA 2008: 1164-1173
73		T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar: Ultra-low-dimensional embeddings for doubling metrics. SODA 2008: 333-342
72		Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev: Set connectivity problems in undirected graphs and the directed Steiner network problem. SODA 2008: 532-541
71		T.-H. Hubert Chan, Anupam Gupta: Approximating TSP on metrics with bounded global growth. SODA 2008: 690-699
70		Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr Sankowski: Stochastic analyses for online combinatorial optimization problems. SODA 2008: 942-951
69		Shuchi Chawla, Anupam Gupta, Harald Räcke: Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. ACM Transactions on Algorithms 4(2): (2008)
68		Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha: On the approximability of some network design problems. ACM Transactions on Algorithms 4(2): (2008)
67		Anupam Gupta, Aravind Srinivasan, Éva Tardos: Cost-Sharing Mechanisms for Network Design. Algorithmica 50(1): 98-119 (2008)
66		Anupam Gupta, Kanat Tangwongsan: Simpler Analyses of Local Search Algorithms for Facility Location CoRR abs/0809.2554: (2008)
65		Anupam Gupta, Ziv Bar-Joseph: Extracting Dynamics from Static Cancer Expression Data. IEEE/ACM Trans. Comput. Biology Bioinform. 5(2): 172-182 (2008)
	2007
64		Anupam Gupta, MohammadTaghi Hajiaghayi, Amit Kumar: Stochastic Steiner Tree with Non-uniform Inflation. APPROX-RANDOM 2007: 134-148
63		Yuri Breitbart, Minos N. Garofalakis, Anupam Gupta, Amit Kumar, Rajeev Rastogi: On Configuring BGP Route Reflectors. COMSWARE 2007
62		Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi: Dial a Ride from k -Forest. ESA 2007: 241-252
61		Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. Ravi: Pricing Tree Access Networks with Connected Backbones. ESA 2007: 498-509
60		Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor: An O (log2 k )-Competitive Algorithm for Metric Bipartite Matching. ESA 2007: 522-533
59		Barbara M. Anthony, Anupam Gupta: Infrastructure Leasing Problems. IPCO 2007: 424-438
58		Andreas Krause, H. Brendan McMahan, Carlos Guestrin, Anupam Gupta: Selecting Observations against Adversarial Objectives. NIPS 2007
57		Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer: An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. SODA 2007: 1153-1162
56		Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar: Approximation Algorithms for the Unsplittable Flow Problem. Algorithmica 47(1): 53-78 (2007)
55		Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi: Dial a Ride from k-forest CoRR abs/0707.0648: (2007)
54		Anupam Gupta, Kunal Talwar: How to Complete a Doubling Metric CoRR abs/0712.3331: (2007)
53		Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden: Approximation via cost sharing: Simpler and better approximation algorithms for network design. J. ACM 54(3): 11 (2007)
52		Anupam Gupta, R. Ravi, Amitabh Sinha: LP Rounding Approximation Algorithms for Stochastic Network Design. Math. Oper. Res. 32(2): 345-364 (2007)
	2006
51		Hubert T.-H. Chan, Michael Dinitz, Anupam Gupta: Spanners with Slack. ESA 2006: 196-207
50		Andreas Krause, Carlos Guestrin, Anupam Gupta, Jon M. Kleinberg: Near-optimal sensor placements: maximizing information while minimizing communication cost. IPSN 2006: 2-10
49		Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter: Quorum placement in networks: minimizing network congestion. PODC 2006: 16-25
48		Kedar Dhamdhere, Anupam Gupta, Harald Räcke: Improved embeddings of graph metrics into random trees. SODA 2006: 61-69
47		Hubert T.-H. Chan, Anupam Gupta: Small hop-diameter sparse spanners for doubling metrics. SODA 2006: 70-78
46		Anupam Gupta, Mohammad Taghi Hajiaghayi, Harald Räcke: Oblivious network design. SODA 2006: 970-979
45		Anupam Gupta, Kunal Talwar: Approximating unique games. SODA 2006: 99-106
44		Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair: Embedding k-Outerplanar Graphs into l 1. SIAM J. Discrete Math. 20(1): 119-136 (2006)
43		Kedar Dhamdhere, Anupam Gupta, R. Ravi: Approximation Algorithms for Minimizing Average Distortion. Theory Comput. Syst. 39(1): 93-111 (2006)
42		Anupam Gupta, Aravind Srinivasan: An Improved Approximation Ratio for the Covering Steiner Problem. Theory of Computing 2(1): 53-64 (2006)
	2005
41		Anupam Gupta, Amit Kumar: Where's the Winner? Max-Finding and Sorting with Metric Costs. APPROX-RANDOM 2005: 74-85
40		Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha: What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization. APPROX-RANDOM 2005: 86-98
39		Ittai Abraham, Yair Bartal, Hubert T.-H. Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, Aleksandrs Slivkins: Metric Embeddings with Relaxed Guarantees. FOCS 2005: 83-100
38		Anupam Gupta, Martin Pál: Stochastic Steiner Trees Without a Root. ICALP 2005: 1051-1063
37		Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter: Quorum placement in networks to minimize access delays. PODC 2005: 87-96
36		Shuchi Chawla, Anupam Gupta, Harald Räcke: Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. SODA 2005: 102-111
35		Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald Räcke, R. Ravi, Anastasios Sidiropoulos: Approximation algorithms for low-distortion embeddings into low-dimensional spaces. SODA 2005: 119-128
34		Hubert T.-H. Chan, Anupam Gupta, Bruce M. Maggs, Shuheng Zhou: On hierarchical routing in doubling metrics. SODA 2005: 762-771
33		Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha: On the approximability of some network design problems. SODA 2005: 943-951
32		Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz: Building Edge-Failure Resilient Networks. Algorithmica 43(1-2): 17-41 (2005)
31		Chandra Chekuri, Anupam Gupta, Amit Kumar: On a bidirected relaxation for the MULTIWAY CUT problem. Discrete Applied Mathematics 150(1-3): 67-79 (2005)
	2004
30		Anupam Gupta, Aravind Srinivasan, Éva Tardos: Cost-Sharing Mechanisms for Network Design. APPROX-RANDOM 2004: 139-150
29		Anupam Gupta, R. Ravi, Amitabh Sinha: An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design. FOCS 2004: 218-227
28		Kedar Dhamdhere, Anupam Gupta, R. Ravi: Approximation Algorithms for Minimizing Average Distortion. STACS 2004: 234-245
27		Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha: Boosted sampling: approximation algorithms for stochastic optimization. STOC 2004: 417-426
26		Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair: Cuts, Trees and l1-Embeddings of Graphs. Combinatorica 24(2): 233-269 (2004)
25		Anupam Gupta, Amit Kumar, Rajeev Rastogi: Traveling with a Pez Dispenser (or, Routing Issues in MPLS). SIAM J. Comput. 34(2): 453-474 (2004)
	2003
24		Anupam Gupta, Robert Krauthgamer, James R. Lee: Bounded Geometries, Fractals, and Low-Distortion Embeddings. FOCS 2003: 534-543
23		Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden: Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. FOCS 2003: 606-615
22		Anupam Gupta, Aravind Srinivasan: On the Covering Steiner Problem. FSTTCS 2003: 244-251
21		Anupam Gupta, Amit Kumar, Rajeev Rastogi: Exploring the trade-off between label size and stack depth in MPLS Routing. INFOCOM 2003
20		Anupam Gupta, Francis Zane: Counting inversions in lists. SODA 2003: 253-254
19		Anupam Gupta: Improved results for directed multicut. SODA 2003: 454-455
18		Alexandr Andoni, Michel Deza, Anupam Gupta, Piotr Indyk, Sofya Raskhodnikova: Lower bounds for embedding edit distance into normed spaces. SODA 2003: 523-526
17		Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair: Embedding k-outerplanar graphs into l1. SODA 2003: 527-536
16		Anupam Gupta, Amit Kumar, Mikkel Thorup: Tree based MPLS routing. SPAA 2003: 193-199
15		Anupam Gupta, Amit Kumar, Tim Roughgarden: Simpler and better approximation algorithms for network design. STOC 2003: 365-372
14		Sanjoy Dasgupta, Anupam Gupta: An elementary proof of a theorem of Johnson and Lindenstrauss. Random Struct. Algorithms 22(1): 60-65 (2003)
	2002
13		Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar: Approximation Algorithms for the Unsplittable Flow Problem. APPROX 2002: 51-66
12		Amit Kumar, Anupam Gupta, Tim Roughgarden: A Constant-Factor Approximation Algorithm for the Multicommodity. FOCS 2002: 333-
11		Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz: Building Edge-Failure Resilient Networks. IPCO 2002: 439-456
	2001
10		Anupam Gupta, Amit Kumar, Rajeev Rastogi: Traveling with a Pez Dispenser (Or, Routing Issues in MPLS). FOCS 2001: 148-157
9		Anupam Gupta, Amit Kumar: Sorting and Selection with Structured Costs. FOCS 2001: 416-425
8		Anupam Gupta: Steiner points in tree metrics don't (really) help. SODA 2001: 220-227
7		Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev Rastogi, Bülent Yener: Provisioning a virtual private network: a network design problem for multicommodity flow. STOC 2001: 389-398
6		Anupam Gupta: Improved Bandwidth Approximation for Trees and Chordal Graphs. J. Algorithms 40(1): 24-36 (2001)
	2000
5		Anupam Gupta: Improved bandwidth approximation for trees. SODA 2000: 788-793
4		Anupam Gupta, Éva Tardos: A constant factor approximation algorithm for a class of classification problems. STOC 2000: 652-658
3		Anupam Gupta: Embedding Tree Metrics into Low-Dimensional Euclidean Spaces. Discrete & Computational Geometry 24(1): 105-116 (2000)
	1999
2		Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair: Cuts, Trees and l1-Embeddings of Graphs. FOCS 1999: 399-409
1		Anupam Gupta: Embedding Tree Metrics Into Low Dimensional Euclidean Spaces. STOC 1999: 694-700

Coauthor Index

1	Ittai Abraham	[39]
2	Alexandr Andoni	[18]
3	Barbara M. Anthony	[59] [74] [90]
4	Moshe Babaioff	[85]
5	Mihai Badoiu	[35]
6	Maria-Florina Balcan (Maria-Florina Popa)	[86]
7	Nikhil Bansal	[60] [94] [98] [102] [109] [130]
8	Ziv Bar-Joseph	[65]
9	Yair Bartal	[39]
10	Guy E. Blelloch	[118] [127]
11	Avrim Blum	[86] [119] [129]
12	Yuri Breitbart	[63]
13	Niv Buchbinder	[60]
14	Amit Chakrabarti	[13] [56]
15	T.-H. Hubert Chan (Hubert T.-H. Chan)	[34] [39] [47] [51] [71] [73] [78] [79] [91]
16	Shuchi Chawla	[36] [69]
17	Chandra Chekuri	[11] [13] [17] [31] [32] [44] [56] [72] [125]
18	Julia Chuzhoy	[33] [68]
19	Sanjoy Dasgupta	[14]
20	Michel Deza	[18]
21	Kedar Dhamdhere	[28] [35] [39] [43] [48] [78]
22	Michael Dinitz	[51] [85]
23	Matthias Englert	[95] [113]
24	Guy Even	[72] [125]
25	Naveen Garg	[70]
26	Minos N. Garofalakis	[63]
27	Daniel Golovin	[49] [76]
28	Vineet Goyal	[61] [74] [90]
29	Fabrizio Grandoni	[77]
30	Haijie Gu	[116]
31	Carlos Guestrin	[50] [58] [87] [114] [117]
32	Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi)	[46] [55] [62] [64] [99]
33	Moritz Hardt	[93] [126]
34	Sungjin Im	[101] [133]
35	Nicole Immorlica	[85]
36	Piotr Indyk	[18]
37	Jon M. Kleinberg	[7] [39] [50] [78] [114]
38	Jochen Könemann	[57]
39	Ioannis Koutis	[118] [127]
40	Andreas Krause	[50] [58] [87] [114] [117]
41	Robert Krauthgamer	[24] [95] [113]
42	Ravishankar Krishnaswamy	[81] [83] [88] [97] [101] [102] [103] [106] [108] [110] [120] [122] [123] [128] [132] [133]
43	Amit Kumar	[7] [9] [10] [11] [12] [13] [15] [16] [21] [23] [25] [31] [32] [41] [53] [56] [63] [64] [76] [81] [84] [88]
44	John D. Lafferty	[112] [116]
45	James R. Lee	[24]
46	Stefano Leonardi	[57] [61] [70] [77]
47	Jian Li	[94] [109] [130]
48	Katrina Ligett	[82] [104]
49	Han Liu	[112] [116]
50	Bruce M. Maggs	[34] [37] [49]
51	Yishay Mansour	[119] [129]
52	H. Brendan McMahan	[58]
53	Frank McSherry	[82] [104]
54	Julián Mestre	[94] [109] [130]
55	Pauli Miettinen	[77]
56	Gary L. Miller	[118] [127]
57	Marco Molinaro	[123] [128]
58	Benjamin Moseley	[101] [133]
59	Viswanath Nagarajan	[55] [62] [74] [80] [89] [90] [92] [94] [97] [98] [99] [105] [107] [109] [130] [132]
60	Joseph Naor (Seffi Naor)	[11] [32] [33] [60] [68]
61	Ofer Neiman	[39]
62	Ilan Newman	[2] [17] [26] [44]
63	Florian Oprea	[37] [49]
64	Martin Pál (Martin Pal)	[23] [27] [38] [40] [53] [115]
65	Richard Peng	[118] [127]
66	Kirk Pruhs	[101] [106] [108] [120] [122] [133]
67	Yuri Rabinovich	[2] [17] [26] [35] [44]
68	Harald Räcke	[35] [36] [46] [48] [69] [95] [113]
69	Ram Rajagopal	[87] [117]
70	Sofya Raskhodnikova	[18]
71	Rajeev Rastogi	[7] [10] [21] [25] [63]
72	R. Ravi	[27] [28] [29] [35] [40] [43] [52] [55] [57] [61] [62] [80] [83] [89] [92] [97] [99] [103] [105] [107] [115] [123] [128] [132]
73	Danny Raz	[11] [32]
74	Michael K. Reiter	[37] [49] [110]
75	Mike K. Reiter	[111]
76	Aaron Roth	[82] [93] [96] [100] [104] [121] [126] [131]
77	Tim Roughgarden	[12] [15] [23] [53]
78	Atri Rudra	[94] [98] [109] [130]
79	Piotr Sankowski	[70] [77]
80	Guido Schäfer	[57]
81	Grant Schoenebeck	[96] [100]
82	Danny Segev	[72] [81] [88] [125]
83	Vyas Sekar	[110] [111]
84	Ankit Sharma	[119] [129]
85	Anastasios Sidiropoulos	[35]
86	Alistair Sinclair	[2] [17] [26] [44]
87	Mohit Singh	[77]
88	Amitabh Sinha	[27] [29] [33] [40] [52] [68] [115]
89	Aleksandrs Slivkins	[39] [78]
90	Aravind Srinivasan	[22] [30] [42] [67]
91	Inbal Talgam-Cohen	[95] [113]
92	Kunal Talwar	[45] [54] [73] [75] [82] [85] [91] [95] [96] [100] [104] [113] [124]
93	Kanat Tangwongsan	[66] [76] [118] [127]
94	Éva Tardos	[4] [30] [67]
95	Mikkel Thorup	[16]
96	Jonathan Ullman	[93] [121] [126] [131]
97	Larry A. Wasserman	[112] [116]
98	Min Xu	[112] [116]
99	Bülent Yener	[7]
100	Francis Zane	[20]
101	Hui Zhang	[111]
102	Shuheng Zhou	[34]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page