Piotr Indyk Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2010
119Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk, Stanislaw Szarek: A simple construction of almost-Euclidean subspaces of $\ell_1^N$ via tensor products CoRR abs/1001.0041: (2010)
2009
118Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr Andoni, Khanh Do Ba, Piotr Indyk, David P. Woodruff: Efficient Sketches for Earth-Mover Distance, with Applications. FOCS 2009: 324-330
117Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld: External Sampling. ICALP (1) 2009: 83-94
116Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRadu Berinde, Graham Cormode, Piotr Indyk, Martin J. Strauss: Space-optimal heavy hitters with strong error bounds. PODS 2009: 157-166
115Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr Andoni, Piotr Indyk, Robert Krauthgamer, Huy L. Nguyen: Approximate line nearest neighbor in high dimensions. SODA 2009: 293-301
114Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr Andoni, Piotr Indyk, Robert Krauthgamer: Overcoming the l1 non-embeddability barrier: algorithms for product metrics. SODA 2009: 865-874
113Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmihood 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
112Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk, Milan Ruzic: Near-Optimal Sparse Recovery in the L1 Norm. FOCS 2008: 199-207
111Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: Explicit constructions for compressed sensing of sparse signals. SODA 2008: 30-33
110Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr Andoni, Piotr Indyk, Robert Krauthgamer: Earth mover distance over high-dimensional spaces. SODA 2008: 343-352
109Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk, Andrew McGregor: Declaring independence via the sketching of sketches. SODA 2008: 737-745
108Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRadu 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)
107Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr Andoni, Piotr Indyk: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1): 117-122 (2008)
106Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGregory Shakhnarovich, Trevor Darrell, Piotr Indyk: Nearest-Neighbor Methods in Learning and Vision. IEEE Transactions on Neural Networks 19(2): 377-377 (2008)
105Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGereon Frahling, Piotr Indyk, Christian Sohler: Sampling in Dynamic Data Streams and Applications. Int. J. Comput. Geometry Appl. 18(1/2): 3-28 (2008)
104Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSudipto Guha, Piotr Indyk, Andrew McGregor: Sketching information divergences. Machine Learning 72(1-2): 5-19 (2008)
2007
103Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSudipto Guha, Piotr Indyk, Andrew McGregor: Sketching Information Divergences. COLT 2007: 424-438
102Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: A near linear time constant factor approximation for Euclidean bichromatic matching (cost). SODA 2007: 39-42
101Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Badoiu, Piotr Indyk, Anastasios Sidiropoulos: Approximation algorithms for embedding general metrics into trees. SODA 2007: 512-521
100Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat: Efficient Computations of l1 and linfinity Rearrangement Distances. SPIRE 2007: 39-49
99Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: Uncertainty principles, extractors, and explicit embeddings of l2 into l1. STOC 2007: 615-620
98Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk, Anastasios Sidiropoulos: Probabilistic embeddings of bounded genus graphs into planar graphs. Symposium on Computational Geometry 2007: 204-209
97Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk, Assaf Naor: Nearest-neighbor-preserving embeddings. ACM Transactions on Algorithms 3(3): (2007)
96Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr Andoni, Piotr Indyk, Robert Krauthgamer: Earth Mover Distance over High-Dimensional Spaces. Electronic Colloquium on Computational Complexity (ECCC) 14(048): (2007)
2006
95Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr Andoni, Piotr Indyk, Mihai Patrascu: On the Optimality of the Dimensionality Reduction Method. FOCS 2006: 449-458
94Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr Andoni, Piotr Indyk: Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions. FOCS 2006: 459-468
93Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr Andoni, Piotr Indyk: Efficient algorithms for substring near neighbor problem. SODA 2006: 1203-1212
92Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos: Embedding ultrametrics into low-dimensional spaces. Symposium on Computational Geometry 2006: 187-196
91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk, David P. Woodruff: Polylogarithmic Private Approximations and Efficient Matching. TCC 2006: 245-264
90Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk: Low-Dimensional Embedding with Extra Information. Discrete & Computational Geometry 36(4): 609-632 (2006)
89Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: Uncertainty Principles, Extractors, and Explicit Embeddings of L2 into L1. Electronic Colloquium on Computational Complexity (ECCC) 13(126): (2006)
88Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: Stable distributions, pseudorandom generators, embeddings, and data stream computation. J. ACM 53(3): 307-323 (2006)
2005
87Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Badoiu, Artur Czumaj, Piotr Indyk, Christian Sohler: Facility Location in Sublinear Time. ICALP 2005: 866-877
86Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk, David P. Woodruff: Optimal approximations of the frequency moments of data streams. STOC 2005: 202-208
85Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos: Low-distortion embeddings of general metrics into the line. STOC 2005: 225-233
84Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGereon Frahling, Piotr Indyk, Christian Sohler: Sampling in dynamic data streams and applications. Symposium on Computational Geometry 2005: 142-149
83Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk, David P. Woodruff: Polylogarithmic Private Approximations and Efficient Matching Electronic Colloquium on Computational Complexity (ECCC)(117): (2005)
82Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVenkatesan Guruswami, Piotr Indyk: Linear-time encodable/decodable codes with near-optimal rate. IEEE Transactions on Information Theory 51(10): 3393-3400 (2005)
2004
81Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: Streaming Algorithms for Geometric Problems. FSTTCS 2004: 32-34
80Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVenkatesan Guruswami, Piotr Indyk: Linear-Time List Decoding in Error-Free Settings: (Extended Abstract). ICALP 2004: 695-707
79Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat: Closest Pair Problems in Very High Dimensions. ICALP 2004: 782-792
78Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: Approximate Nearest Neighbor under edit distance via product metrics. SODA 2004: 646-650
77Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Badoiu, Piotr Indyk: Fast approximate pattern matching with few indels via embeddings. SODA 2004: 651-652
76Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVenkatesan Guruswami, Piotr Indyk: Efficiently decodable codes meeting Gilbert-Varshamov bound for low rates. SODA 2004: 756-757
75Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: Algorithms for dynamic geometric problems over data streams. STOC 2004: 373-380
74Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMayur Datar, Nicole Immorlica, Piotr Indyk, Vahab S. Mirrokni: Locality-sensitive hashing scheme based on p-stable distributions. Symposium on Computational Geometry 2004: 253-262
73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk: Low-dimensional embedding with extra information. Symposium on Computational Geometry 2004: 320-329
72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlon Efrat, Piotr Indyk, Suresh Venkatasubramanian: Pattern Matching for Sets of Segments. Algorithmica 40(3): 147-160 (2004)
2003
71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk, David P. Woodruff: Tight Lower Bounds for the Distinct Elements Problem. FOCS 2003: 283-
70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr Andoni, Michel Deza, Anupam Gupta, Piotr Indyk, Sofya Raskhodnikova: Lower bounds for embedding edit distance into normed spaces. SODA 2003: 523-526
69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVenkatesan Guruswami, Piotr Indyk: Embeddings and non-approximability of geometric problems. SODA 2003: 537-538
68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: Better algorithms for high-dimensional proximity problems via asymmetric embeddings. SODA 2003: 539-545
67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVenkatesan Guruswami, Piotr Indyk: Linear time encodable and list decodable codes. STOC 2003: 126-135
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Gavrilov, Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian: Combinatorial and Experimental Methods for Approximate Point Pattern Matching. Algorithmica 38(1): 59-90 (2003)
65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSariel Har-Peled, Piotr Indyk: When Crossings Count - Approximating the Minimum Spanning Tree CoRR cs.CG/0303001: (2003)
64no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk, Suresh Venkatasubramanian: Approximate congruence in nearly linear time. Comput. Geom. 24(2): 115-128 (2003)
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGraham 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)
62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulien 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
61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMoses Charikar, Piotr Indyk, Rina Panigrahy: New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems. ICALP 2002: 451-462
60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss: Histogramming Data Streams with Fast Per-Item Processing. ICALP 2002: 681-692
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGraham Cormode, Piotr Indyk, Nick Koudas, S. Muthukrishnan: Fast Mining of Massive Tabular Data via Approximate Distance Computations. ICDE 2002: 605-
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNitin Thaper, Sudipto Guha, Piotr Indyk, Nick Koudas: Dynamic multidimensional histograms. SIGMOD Conference 2002: 428-439
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani: Maintaining stream statistics over sliding windows (extended abstract). SODA 2002: 635-644
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: Explicit constructions of selectors and related combinatorial structures, with applications. SODA 2002: 697-704
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLars Engebretsen, Piotr Indyk, Ryan O'Donnell: Derandomized dimensionality reduction with applications. SODA 2002: 705-712
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss: Near-optimal sparse fourier representations via sampling. STOC 2002: 152-161
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Badoiu, Sariel Har-Peled, Piotr Indyk: Approximate clustering via core-sets. STOC 2002: 250-257
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnna C. Gilbert, Sudipto Guha, Piotr Indyk, Yannis Kotidis, S. Muthukrishnan, Martin Strauss: Fast, small-space algorithms for approximate histogram maintenance. STOC 2002: 389-398
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVenkatesan Guruswami, Piotr Indyk: Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets. STOC 2002: 812-821
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: Approximate nearest neighbor algorithms for Frechet distance via product metrics. Symposium on Computational Geometry 2002: 102-106
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGraham Cormode, Mayur Datar, Piotr Indyk, S. Muthukrishnan: Comparing Data Streams Using Hamming Norms (How to Zero In). VLDB 2002: 335-345
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTaher H. Haveliwala, Aristides Gionis, Dan Klein, Piotr Indyk: Evaluating strategies for similarity search on the web. WWW 2002: 432-442
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: List-decoding in Linear Time Electronic Colloquium on Computational Complexity (ECCC)(024): (2002)
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani: Maintaining Stream Statistics over Sliding Windows. SIAM J. Comput. 31(6): 1794-1813 (2002)
2001
45no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: Algorithmic Applications of Low-Distortion Geometric Embeddings. FOCS 2001: 10-33
44no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVenkatesan Guruswami, Piotr Indyk: Expander-Based Constructions of Efficiently Decodable Codes. FOCS 2001: 658-667
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlon Efrat, Piotr Indyk, Suresh Venkatasubramanian: Pattern matching for sets of segments. SODA 2001: 295-304
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAshish Goel, Piotr Indyk, Kasturi R. Varadarajan: Reductions among high dimensional proximity problems. SODA 2001: 769-778
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArnon 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)
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith 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)
39no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: A Small Approximately Min-Wise Independent Family of Hash Functions. J. Algorithms 38(1): 84-90 (2001)
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: On Approximate Nearest Neighbors under linfinity Norm. J. Comput. Syst. Sci. 63(4): 627-638 (2001)
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYair Bartal, Moses Charikar, Piotr Indyk: On page migration and other relaxed task systems. Theor. Comput. Sci. 268(1): 43-66 (2001)
2000
36no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation. FOCS 2000: 189-197
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith 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-499
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Gavrilov, Dragomir Anguelov, Piotr Indyk, Rajeev Motwani: Mining the stock market (extended abstract): which measure is best? KDD 2000: 487-496
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk, Suresh Venkatasubramanian: Approximate congruence in nearly linear time. SODA 2000: 354-360
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: Dimensionality reduction techniques for proximity problems. SODA 2000: 371-378
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSariel Har-Peled, Piotr Indyk: When crossings count - approximating the minimum spanning tree. Symposium on Computational Geometry 2000: 166-175
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk, Nick Koudas, S. Muthukrishnan: Identifying Representative Trends in Massive Time Series Data Sets Using Sketches. VLDB 2000: 363-372
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTaher H. Haveliwala, Aristides Gionis, Piotr Indyk: Scalable Techniques for Clustering the Web. WebDB (Informal Proceedings) 2000: 129-134
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlon Efrat, Piotr Indyk, Suresh Venkatasubramanian: Pattern Matching for sets of segments CoRR cs.CG/0009013: (2000)
1999
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: A Sublinear Time Approximation Scheme for Clustering in Metric Spaces. FOCS 1999: 154-159
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArnon Amir, Alon Efrat, Piotr Indyk, Hanan Samet: Efficient Regular Data Structures and Algorithms for Location and Proximity Problems. FOCS 1999: 160-170
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Farach-Colton, Piotr Indyk: Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings. FOCS 1999: 171-180
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAshish Goel, Piotr Indyk: Stochastic Load Balancing and Related Problems. FOCS 1999: 579-586
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard Cole, Ramesh Hariharan, Piotr Indyk: Tree Pattern Matching and Subset Matching in Deterministic O(n log3 n)-time. SODA 1999: 245-254
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: A Small Approximately min-wise Independent Family of Hash Functions. SODA 1999: 454-456
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian: Geometric Matching Under Noise: Combinatorial Bounds and Algorithms. SODA 1999: 457-465
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: Sublinear Time Algorithms for Metric Space Problems. STOC 1999: 428-434
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: Inerpolation of Symmetric Functions and a New Type of Combinatorial Design. STOC 1999: 736-740
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Gavrilov, Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian: Geometric Pattern Matching: A Performance Study. Symposium on Computational Geometry 1999: 79-85
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAristides Gionis, Piotr Indyk, Rajeev Motwani: Similarity Search in High Dimensions via Hashing. VLDB 1999: 518-529
16no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDonald 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
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: On Approximate Nearest Neighbors in Non-Euclidean Spaces. FOCS 1998: 148-155
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: Faster Algorithms for String Matching Problems: Matching the Convolution Bound. FOCS 1998: 166-173
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSoumen Chakrabarti, Byron Dom, Piotr Indyk: Enhanced Hypertext Categorization Using Hyperlinks. SIGMOD Conference 1998: 307-318
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk, Rajeev Motwani: Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. STOC 1998: 604-613
1997
11no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTibor Hegedüs, Piotr Indyk: On Learning Disjunctions of Zero-One Treshold Functions with Queries. ALT 1997: 446-460
10no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLeszek Gasieniec, Piotr Indyk, Piotr Krysta: External Inverse Pattern Matching. CPM 1997: 90-101
9no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLeszek Gasieniec, Piotr Indyk: Efficient Parallel Computing with Memory Faults. FCT 1997: 188-197
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: Deterministic Superimposed Coding with Applications to Pattern Matching. FOCS 1997: 127-136
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYair Bartal, Moses Charikar, Piotr Indyk: On Page Migration and Other Related Task Systems. SODA 1997: 43-52
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk, Rajeev Motwani, Prabhakar Raghavan, Santosh Vempala: Locality-Preserving Hashing in Multidimensional Spaces. STOC 1997: 618-625
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLi Zhang, Harish Devarajan, Julien Basch, Piotr Indyk: Probabilistic Analysis for Combinatorial Functions of Moving Points. Symposium on Computational Geometry 1997: 442-444
1996
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBogdan S. Chlebus, Anna Gambin, Piotr Indyk: Shared-Memory Simulations on a Faulty-Memory DMM. ICALP 1996: 586-597
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: On Word-Level Parallelism in Fault-Tolerant Computing. STACS 1996: 193-204
1995
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Indyk: Optimal Simulation of Automata by Neural Nets. STACS 1995: 337-348
1994
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBogdan S. Chlebus, Anna Gambin, Piotr Indyk: PRAM Computations Resilient to Memory Faults. ESA 1994: 401-412

Coauthor Index

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

Colors in the list of coauthors

Copyright © Fri Mar 12 12:56:28 2010 by Michael Ley (ley@uni-trier.de)