Piotr Indyk

	2012
141		Piotr Indyk, Reut Levi, Ronitt Rubinfeld: Approximating and testing k-histogram distributions in sub-linear time. PODS 2012: 15-22
140		Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price: Simple and practical algorithm for sparse Fourier transform. SODA 2012: 1183-1194
139		Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price: Nearly optimal sparse fourier transform. STOC 2012: 563-578
138		Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price: Nearly Optimal Sparse Fourier Transform CoRR abs/1201.2501: (2012)
	2011
137		Khanh Do Ba, Piotr Indyk: Sparse Recovery with Partial Support Knowledge. APPROX-RANDOM 2011: 26-37
136		Piotr Indyk, Eric Price, David P. Woodruff: On the Power of Adaptivity in Sparse Recovery. FOCS 2011: 285-294
135		Arnab Bhattacharyya, Piotr Indyk, David P. Woodruff, Ning Xie: The Complexity of Linear Dependence Problems in Vector Spaces. ICS 2011: 496-508
134		Piotr Indyk, Eric Price: K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance. STOC 2011: 627-636
133		Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachlin: Compressive sensing with local geometric features. Symposium on Computational Geometry 2011: 87-96
132		Piotr Indyk, Eric Price: K-Median Clustering, Model-Based Compressive Sensing, and Sparse Recovery for Earth Mover Distance CoRR abs/1104.4674: (2011)
131		Khanh Do Ba, Piotr Indyk, Eric Price, David P. Woodruff: Lower Bounds for Sparse Recovery CoRR abs/1106.0365: (2011)
130		Piotr Indyk, Eric Price, David P. Woodruff: On the Power of Adaptivity in Sparse Recovery CoRR abs/1110.3850: (2011)
129		Piotr Indyk, Reut Levi, Ronitt Rubinfeld: Approximating and Testing k-Histogram Distributions in Sub-linear time. Electronic Colloquium on Computational Complexity (ECCC) 18: 171 (2011)
	2010
128		Piotr Indyk, Avner Magen, Anastasios Sidiropoulos, Anastasios Zouzias: Online Embeddings. APPROX-RANDOM 2010: 246-259
127		Piotr Indyk, Stanislaw Szarek: Almost-Euclidean Subspaces of l1N\ell_1^N via Tensor Products: A Simple Approach to Randomness Reduction. APPROX-RANDOM 2010: 632-641
126		Piotr Indyk: Sparse Recovery Using Sparse Random Matrices. LATIN 2010: 157
125		Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld: Sublinear Algorithms in the External Memory Model. Property Testing 2010: 240-243
124		Piotr Indyk, Hung Q. Ngo, Atri Rudra: Efficiently Decodable Non-adaptive Group Testing. SODA 2010: 1126-1142
123		Khanh Do Ba, Piotr Indyk, Eric Price, David P. Woodruff: Lower Bounds for Sparse Recovery. SODA 2010: 1190-1197
122		Radu Berinde, Piotr Indyk, Graham Cormode, Martin J. Strauss: Space-optimal heavy hitters with strong error bounds. ACM Trans. Database Syst. 35(4): 26 (2010)
121		Piotr Indyk, Stanislaw Szarek: A simple construction of almost-Euclidean subspaces of $\ell_1^N$ via tensor products CoRR abs/1001.0041: (2010)
120		Zeeshan Syed, Collin Stultz, Manolis Kellis, Piotr Indyk, John V. Guttag: Motif discovery in physiological datasets: A methodology for inferring predictive elements. TKDD 4(1): (2010)
	2009
119		Alexandr Andoni, Khanh Do Ba, Piotr Indyk, David P. Woodruff: Efficient Sketches for Earth-Mover Distance, with Applications. FOCS 2009: 324-330
118		Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld: External Sampling. ICALP (1) 2009: 83-94
117		Radu Berinde, Graham Cormode, Piotr Indyk, Martin J. Strauss: Space-optimal heavy hitters with strong error bounds. PODS 2009: 157-166
116		Alexandr Andoni, Piotr Indyk, Robert Krauthgamer, Huy L. Nguyen: Approximate line nearest neighbor in high dimensions. SODA 2009: 293-301
115		Alexandr Andoni, Piotr Indyk, Robert Krauthgamer: Overcoming the l1 non-embeddability barrier: algorithms for product metrics. SODA 2009: 865-874
114		Zeeshan Syed, Piotr Indyk, John V. Guttag: Learning Approximate Sequential Patterns for Classification. Journal of Machine Learning Research 10: 1913-1936 (2009)
113		Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat: Efficient computations of l1 and l INFINITY rearrangement distances. Theor. Comput. Sci. 410(43): 4382-4390 (2009)
	2008
112		Piotr Indyk, Milan Ruzic: Near-Optimal Sparse Recovery in the L1 Norm. FOCS 2008: 199-207
111		Piotr Indyk: Explicit constructions for compressed sensing of sparse signals. SODA 2008: 30-33
110		Alexandr Andoni, Piotr Indyk, Robert Krauthgamer: Earth mover distance over high-dimensional spaces. SODA 2008: 343-352
109		Piotr Indyk, Andrew McGregor: Declaring independence via the sketching of sketches. SODA 2008: 737-745
108		Radu Berinde, Anna C. Gilbert, Piotr Indyk, Howard J. Karloff, Martin J. Strauss: Combining geometry and combinatorics: A unified approach to sparse signal recovery CoRR abs/0804.4666: (2008)
107		Alexandr Andoni, Piotr Indyk: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1): 117-122 (2008)
106		Gregory Shakhnarovich, Trevor Darrell, Piotr Indyk: Nearest-Neighbor Methods in Learning and Vision. IEEE Transactions on Neural Networks 19(2): 377 (2008)
105		Gereon Frahling, Piotr Indyk, Christian Sohler: Sampling in Dynamic Data Streams and Applications. Int. J. Comput. Geometry Appl. 18(1/2): 3-28 (2008)
104		Sudipto Guha, Piotr Indyk, Andrew McGregor: Sketching information divergences. Machine Learning 72(1-2): 5-19 (2008)
	2007
103		Sudipto Guha, Piotr Indyk, Andrew McGregor: Sketching Information Divergences. COLT 2007: 424-438
102		Piotr Indyk: A near linear time constant factor approximation for Euclidean bichromatic matching (cost). SODA 2007: 39-42
101		Mihai Badoiu, Piotr Indyk, Anastasios Sidiropoulos: Approximation algorithms for embedding general metrics into trees. SODA 2007: 512-521
100		Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat: Efficient Computations of l1 and linfinity Rearrangement Distances. SPIRE 2007: 39-49
99		Piotr Indyk: Uncertainty principles, extractors, and explicit embeddings of l2 into l1. STOC 2007: 615-620
98		Piotr Indyk, Anastasios Sidiropoulos: Probabilistic embeddings of bounded genus graphs into planar graphs. Symposium on Computational Geometry 2007: 204-209
97		Piotr Indyk, Assaf Naor: Nearest-neighbor-preserving embeddings. ACM Transactions on Algorithms 3(3): (2007)
96		Alexandr Andoni, Piotr Indyk, Robert Krauthgamer: Earth Mover Distance over High-Dimensional Spaces. Electronic Colloquium on Computational Complexity (ECCC) 14(048): (2007)
	2006
95		Alexandr Andoni, Piotr Indyk, Mihai Patrascu: On the Optimality of the Dimensionality Reduction Method. FOCS 2006: 449-458
94		Alexandr Andoni, Piotr Indyk: Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions. FOCS 2006: 459-468
93		Alexandr Andoni, Piotr Indyk: Efficient algorithms for substring near neighbor problem. SODA 2006: 1203-1212
92		Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos: Embedding ultrametrics into low-dimensional spaces. Symposium on Computational Geometry 2006: 187-196
91		Piotr Indyk, David P. Woodruff: Polylogarithmic Private Approximations and Efficient Matching. TCC 2006: 245-264
90		Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk: Low-Dimensional Embedding with Extra Information. Discrete & Computational Geometry 36(4): 609-632 (2006)
89		Piotr Indyk: Uncertainty Principles, Extractors, and Explicit Embeddings of L2 into L1. Electronic Colloquium on Computational Complexity (ECCC) 13(126): (2006)
88		Piotr Indyk: Stable distributions, pseudorandom generators, embeddings, and data stream computation. J. ACM 53(3): 307-323 (2006)
	2005
87		Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian Sohler: Facility Location in Sublinear Time. ICALP 2005: 866-877
86		Piotr Indyk, David P. Woodruff: Optimal approximations of the frequency moments of data streams. STOC 2005: 202-208
85		Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos: Low-distortion embeddings of general metrics into the line. STOC 2005: 225-233
84		Gereon Frahling, Piotr Indyk, Christian Sohler: Sampling in dynamic data streams and applications. Symposium on Computational Geometry 2005: 142-149
83		Piotr Indyk, David P. Woodruff: Polylogarithmic Private Approximations and Efficient Matching Electronic Colloquium on Computational Complexity (ECCC)(117): (2005)
82		Venkatesan Guruswami, Piotr Indyk: Linear-time encodable/decodable codes with near-optimal rate. IEEE Transactions on Information Theory 51(10): 3393-3400 (2005)
	2004
81		Piotr Indyk: Streaming Algorithms for Geometric Problems. FSTTCS 2004: 32-34
80		Venkatesan Guruswami, Piotr Indyk: Linear-Time List Decoding in Error-Free Settings: (Extended Abstract). ICALP 2004: 695-707
79		Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat: Closest Pair Problems in Very High Dimensions. ICALP 2004: 782-792
78		Piotr Indyk: Approximate Nearest Neighbor under edit distance via product metrics. SODA 2004: 646-650
77		Mihai Badoiu, Piotr Indyk: Fast approximate pattern matching with few indels via embeddings. SODA 2004: 651-652
76		Venkatesan Guruswami, Piotr Indyk: Efficiently decodable codes meeting Gilbert-Varshamov bound for low rates. SODA 2004: 756-757
75		Piotr Indyk: Algorithms for dynamic geometric problems over data streams. STOC 2004: 373-380
74		Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab S. Mirrokni: Locality-sensitive hashing scheme based on p-stable distributions. Symposium on Computational Geometry 2004: 253-262
73		Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk: Low-dimensional embedding with extra information. Symposium on Computational Geometry 2004: 320-329
72		Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian: Pattern Matching for Sets of Segments. Algorithmica 40(3): 147-160 (2004)
	2003
71		Piotr Indyk, David P. Woodruff: Tight Lower Bounds for the Distinct Elements Problem. FOCS 2003: 283-288
70		Alexandr Andoni, Michel Deza, Anupam Gupta, Piotr Indyk, Sofya Raskhodnikova: Lower bounds for embedding edit distance into normed spaces. SODA 2003: 523-526
69		Venkatesan Guruswami, Piotr Indyk: Embeddings and non-approximability of geometric problems. SODA 2003: 537-538
68		Piotr Indyk: Better algorithms for high-dimensional proximity problems via asymmetric embeddings. SODA 2003: 539-545
67		Venkatesan Guruswami, Piotr Indyk: Linear time encodable and list decodable codes. STOC 2003: 126-135
66		Martin Gavrilov, Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian: Combinatorial and Experimental Methods for Approximate Point Pattern Matching. Algorithmica 38(1): 59-90 (2003)
65		Sariel Har-Peled, Piotr Indyk: When Crossings Count - Approximating the Minimum Spanning Tree CoRR cs.CG/0303001: (2003)
64		Piotr Indyk, Suresh Venkatasubramanian: Approximate congruence in nearly linear time. Comput. Geom. 24(2): 115-128 (2003)
63		Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthukrishnan: Comparing Data Streams Using Hamming Norms (How to Zero In). IEEE Trans. Knowl. Data Eng. 15(3): 529-540 (2003)
62		Julien Basch, Harish Devarajan, Piotr Indyk, Li Zhang: Probabilistic Analysis for Discrete Attributes of Moving Points. Int. J. Comput. Geometry Appl. 13(1): 5-22 (2003)
	2002
61		Moses Charikar, Piotr Indyk, Rina Panigrahy: New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems. ICALP 2002: 451-462
60		Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss: Histogramming Data Streams with Fast Per-Item Processing. ICALP 2002: 681-692
59		Graham Cormode, Piotr Indyk, Nick Koudas, S. Muthukrishnan: Fast Mining of Massive Tabular Data via Approximate Distance Computations. ICDE 2002: 605-614
58		Nitin Thaper, Sudipto Guha, Piotr Indyk, Nick Koudas: Dynamic multidimensional histograms. SIGMOD Conference 2002: 428-439
57		Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani: Maintaining stream statistics over sliding windows (extended abstract). SODA 2002: 635-644
56		Piotr Indyk: Explicit constructions of selectors and related combinatorial structures, with applications. SODA 2002: 697-704
55		Lars Engebretsen, Piotr Indyk, Ryan O'Donnell: Derandomized dimensionality reduction with applications. SODA 2002: 705-712
54		Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss: Near-optimal sparse fourier representations via sampling. STOC 2002: 152-161
53		Mihai Badoiu, Sariel Har-Peled, Piotr Indyk: Approximate clustering via core-sets. STOC 2002: 250-257
52		Anna C. Gilbert, Sudipto Guha, Piotr Indyk, Yannis Kotidis, S. Muthukrishnan, Martin Strauss: Fast, small-space algorithms for approximate histogram maintenance. STOC 2002: 389-398
51		Venkatesan Guruswami, Piotr Indyk: Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets. STOC 2002: 812-821
50		Piotr Indyk: Approximate nearest neighbor algorithms for Frechet distance via product metrics. Symposium on Computational Geometry 2002: 102-106
49		Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthukrishnan: Comparing Data Streams Using Hamming Norms (How to Zero In). VLDB 2002: 335-345
48		Taher H. Haveliwala, Aristides Gionis, Dan Klein, Piotr Indyk: Evaluating strategies for similarity search on the web. WWW 2002: 432-442
47		Piotr Indyk: List-decoding in Linear Time Electronic Colloquium on Computational Complexity (ECCC)(024): (2002)
46		Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani: Maintaining Stream Statistics over Sliding Windows. SIAM J. Comput. 31(6): 1794-1813 (2002)
	2001
45		Piotr Indyk: Algorithmic Applications of Low-Distortion Geometric Embeddings. FOCS 2001: 10-33
44		Venkatesan Guruswami, Piotr Indyk: Expander-Based Constructions of Efficiently Decodable Codes. FOCS 2001: 658-667
43		Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian: Pattern matching for sets of segments. SODA 2001: 295-304
42		Ashish Goel, Piotr Indyk, Kasturi R. Varadarajan: Reductions among high dimensional proximity problems. SODA 2001: 769-778
41		Arnon Amir, Alon Efrat, Piotr Indyk, Hanan Samet: Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems. Algorithmica 30(2): 164-187 (2001)
40		Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, Cheng Yang: Finding Interesting Associations without Support Pruning. IEEE Trans. Knowl. Data Eng. 13(1): 64-78 (2001)
39		Piotr Indyk: A Small Approximately Min-Wise Independent Family of Hash Functions. J. Algorithms 38(1): 84-90 (2001)
38		Piotr Indyk: On Approximate Nearest Neighbors under linfinity Norm. J. Comput. Syst. Sci. 63(4): 627-638 (2001)
37		Yair Bartal, Moses Charikar, Piotr Indyk: On page migration and other relaxed task systems. Theor. Comput. Sci. 268(1): 43-66 (2001)
	2000
36		Piotr Indyk: Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation. FOCS 2000: 189-197
35		Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, Cheng Yang: Finding Interesting Associations without Support Pruning. ICDE 2000: 489-500
34		Martin Gavrilov, Dragomir Anguelov, Piotr Indyk, Rajeev Motwani: Mining the stock market (extended abstract): which measure is best? KDD 2000: 487-496
33		Piotr Indyk, Suresh Venkatasubramanian: Approximate congruence in nearly linear time. SODA 2000: 354-360
32		Piotr Indyk: Dimensionality reduction techniques for proximity problems. SODA 2000: 371-378
31		Sariel Har-Peled, Piotr Indyk: When crossings count - approximating the minimum spanning tree. Symposium on Computational Geometry 2000: 166-175
30		Piotr Indyk, Nick Koudas, S. Muthukrishnan: Identifying Representative Trends in Massive Time Series Data Sets Using Sketches. VLDB 2000: 363-372
29		Taher H. Haveliwala, Aristides Gionis, Piotr Indyk: Scalable Techniques for Clustering the Web. WebDB (Informal Proceedings) 2000: 129-134
28		Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian: Pattern Matching for sets of segments CoRR cs.CG/0009013: (2000)
	1999
27		Piotr Indyk: A Sublinear Time Approximation Scheme for Clustering in Metric Spaces. FOCS 1999: 154-159
26		Arnon Amir, Alon Efrat, Piotr Indyk, Hanan Samet: Efficient Regular Data Structures and Algorithms for Location and Proximity Problems. FOCS 1999: 160-170
25		Martin Farach-Colton, Piotr Indyk: Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings. FOCS 1999: 171-180
24		Ashish Goel, Piotr Indyk: Stochastic Load Balancing and Related Problems. FOCS 1999: 579-586
23		Richard Cole, Ramesh Hariharan, Piotr Indyk: Tree Pattern Matching and Subset Matching in Deterministic O(n log3 n)-time. SODA 1999: 245-254
22		Piotr Indyk: A Small Approximately min-wise Independent Family of Hash Functions. SODA 1999: 454-456
21		Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian: Geometric Matching Under Noise: Combinatorial Bounds and Algorithms. SODA 1999: 457-465
20		Piotr Indyk: Sublinear Time Algorithms for Metric Space Problems. STOC 1999: 428-434
19		Piotr Indyk: Inerpolation of Symmetric Functions and a New Type of Combinatorial Design. STOC 1999: 736-740
18		Martin Gavrilov, Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian: Geometric Pattern Matching: A Performance Study. Symposium on Computational Geometry 1999: 79-85
17		Aristides Gionis, Piotr Indyk, Rajeev Motwani: Similarity Search in High Dimensions via Hashing. VLDB 1999: 518-529
16		Donald Aingworth, Chandra Chekuri, Piotr Indyk, Rajeev Motwani: Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication). SIAM J. Comput. 28(4): 1167-1181 (1999)
	1998
15		Piotr Indyk: On Approximate Nearest Neighbors in Non-Euclidean Spaces. FOCS 1998: 148-155
14		Piotr Indyk: Faster Algorithms for String Matching Problems: Matching the Convolution Bound. FOCS 1998: 166-173
13		Soumen Chakrabarti, Byron Dom, Piotr Indyk: Enhanced Hypertext Categorization Using Hyperlinks. SIGMOD Conference 1998: 307-318
12		Piotr Indyk, Rajeev Motwani: Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. STOC 1998: 604-613
	1997
11		Tibor Hegedüs, Piotr Indyk: On Learning Disjunctions of Zero-One Treshold Functions with Queries. ALT 1997: 446-460
10		Leszek Gasieniec, Piotr Indyk, Piotr Krysta: External Inverse Pattern Matching. CPM 1997: 90-101
9		Leszek Gasieniec, Piotr Indyk: Efficient Parallel Computing with Memory Faults. FCT 1997: 188-197
8		Piotr Indyk: Deterministic Superimposed Coding with Applications to Pattern Matching. FOCS 1997: 127-136
7		Yair Bartal, Moses Charikar, Piotr Indyk: On Page Migration and Other Related Task Systems. SODA 1997: 43-52
6		Piotr Indyk, Rajeev Motwani, Prabhakar Raghavan, Santosh Vempala: Locality-Preserving Hashing in Multidimensional Spaces. STOC 1997: 618-625
5		Li Zhang, Harish Devarajan, Julien Basch, Piotr Indyk: Probabilistic Analysis for Combinatorial Functions of Moving Points. Symposium on Computational Geometry 1997: 442-444
	1996
4		Bogdan S. Chlebus, Anna Gambin, Piotr Indyk: Shared-Memory Simulations on a Faulty-Memory DMM. ICALP 1996: 586-597
3		Piotr Indyk: On Word-Level Parallelism in Fault-Tolerant Computing. STACS 1996: 193-204
	1995
2		Piotr Indyk: Optimal Simulation of Automata by Neural Nets. STACS 1995: 337-348
	1994
1		Bogdan S. Chlebus, Anna Gambin, Piotr Indyk: PRAM Computations Resilient to Memory Faults. ESA 1994: 401-412

Coauthor Index

1	Donald Aingworth	[16]
2	Amihood Amir	[100] [113]
3	Arnon Amir	[26] [41]
4	Alexandr Andoni	[70] [93] [94] [95] [96] [107] [110] [115] [116] [118] [119] [125]
5	Dragomir Anguelov	[34]
6	Yonatan Aumann	[100] [113]
7	Khanh Do Ba	[119] [123] [131] [137]
8	Mihai Badoiu	[53] [73] [77] [85] [87] [90] [92] [101]
9	Yair Bartal	[7] [37]
10	Julien Basch	[5] [62]
11	Radu Berinde	[108] [117] [122]
12	Arnab Bhattacharyya	[135]
13	Soumen Chakrabarti	[13]
14	Moses Charikar	[7] [37] [61]
15	Chandra Chekuri	[16]
16	Bogdan S. Chlebus	[1] [4]
17	Julia Chuzhoy	[85] [92]
18	Edith Cohen	[35] [40]
19	Richard Cole	[23]
20	Graham Cormode	[49] [59] [63] [117] [122]
21	Artur Czumaj	[87]
22	Trevor Darrell	[106]
23	Mayur Datar	[35] [40] [46] [49] [57] [63] [74]
24	Erik D. Demaine	[73] [90]
25	Harish Devarajan	[5] [62]
26	Michel Deza	[70]
27	Byron Dom	[13]
28	Alon Efrat	[26] [28] [41] [43] [72]
29	Lars Engebretsen	[55]
30	Martin Farach-Colton (Martin Farach)	[25]
31	Gereon Frahling	[84] [105]
32	Shinji Fujiwara	[35] [40]
33	Anna Gambin	[1] [4]
34	Leszek Gasieniec	[9] [10]
35	Martin Gavrilov	[18] [34] [66]
36	Anna C. Gilbert	[52] [54] [108]
37	Aristides Gionis	[17] [29] [35] [40] [46] [48] [57]
38	Ashish Goel	[24] [42]
39	Sudipto Guha	[52] [54] [58] [60] [103] [104]
40	Anupam Gupta	[70]
41	Rishi Gupta	[133]
42	Venkatesan Guruswami	[44] [51] [67] [69] [76] [80] [82]
43	John V. Guttag	[114] [120]
44	Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi)	[73] [90]
45	Sariel Har-Peled	[31] [53] [65]
46	Ramesh Hariharan	[23]
47	Haitham Hassanieh	[138] [139] [140]
48	Taher H. Haveliwala	[29] [48]
49	Tibor Hegedüs	[11]
50	Nicole Immorlica	[74]
51	Howard J. Karloff	[108]
52	Dina Katabi	[138] [139] [140]
53	Manolis Kellis	[120]
54	Dan Klein	[48]
55	Yannis Kotidis	[52]
56	Nick Koudas	[30] [58] [59]
57	Robert Krauthgamer	[96] [110] [115] [116]
58	Piotr Krysta	[10]
59	Reut Levi	[129] [141]
60	Avivit Levy (Avivit Kapah-Levy)	[100] [113]
61	Moshe Lewenstein	[79]
62	Ohad Lipsky	[79]
63	Avner Magen	[128]
64	Andrew McGregor	[103] [104] [109]
65	Vahab S. Mirrokni (Seyed Vahab Mirrokni)	[74]
66	Rajeev Motwani	[6] [12] [16] [17] [18] [21] [34] [35] [40] [46] [57] [66]
67	S. Muthukrishnan (S. Muthu Muthukrishnan)	[30] [49] [52] [54] [59] [60] [63]
68	Assaf Naor	[97]
69	Hung Q. Ngo (Hung Quang Ngo)	[124]
70	Huy L. Nguyen	[116]
71	Ryan O'Donnell	[55]
72	Krzysztof Onak	[118] [125]
73	Rina Panigrahy	[61]
74	Mihai Patrascu	[95]
75	Ely Porat	[79] [100] [113]
76	Eric Price	[123] [130] [131] [132] [133] [134] [136] [138] [139] [140]
77	Yaron Rachlin	[133]
78	Prabhakar Raghavan	[6]
79	Sofya Raskhodnikova	[70]
80	Ronitt Rubinfeld	[118] [125] [129] [141]
81	Atri Rudra	[124]
82	Milan Ruzic	[112]
83	Hanan Samet	[26] [41]
84	Gregory Shakhnarovich	[106]
85	Anastasios Sidiropoulos	[85] [92] [98] [101] [128]
86	Christian Sohler	[84] [87] [105]
87	Martin Strauss (Martin J. Strauss)	[52] [54] [60] [108] [117] [122]
88	Collin Stultz	[120]
89	Zeeshan Syed	[114] [120]
90	Stanislaw Szarek	[121] [127]
91	Nitin Thaper	[58]
92	Jeffrey D. Ullman	[35] [40]
93	Kasturi R. Varadarajan	[42]
94	Santosh Vempala	[6]
95	Suresh Venkatasubramanian	[18] [21] [28] [33] [43] [64] [66] [72]
96	David P. Woodruff	[71] [83] [86] [91] [119] [123] [130] [131] [135] [136]
97	Ning Xie	[135]
98	Cheng Yang	[35] [40]
99	Li Zhang	[5] [62]
100	Anastasios Zouzias	[128]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page