| |
 |      |
                                         |
Note: Links lead to the DBLP on the Web. Piotr Indyk 67 Piotr Indyk, David Woodruff : Tight Lower Bounds for the Distinct Elements Problem. FOCS 2003 : 283- 66 Alexandr Andoni , Michael Deza , Anupam Gupta , Piotr Indyk, Sofya Raskhodnikova : Lower bounds for embedding edit distance into normed spaces. SODA 2003 : 523-526 65 Venkatesan Guruswami , Piotr Indyk: Embeddings and non-approximability of geometric problems. SODA 2003 : 537-538 64 Piotr Indyk: Better algorithms for high-dimensional proximity problems via asymmetric embeddings. SODA 2003 : 539-545 63 Venkatesan Guruswami , Piotr Indyk: Linear time encodable and list decodable codes. STOC 2003 : 126-135 62 Piotr Indyk, Suresh Venkatasubramanian : Approximate congruence in nearly linear time. Computational Geometry 24 (2): 115-128 (2003) 61 Julien Basch , Harish Devarajan , Piotr Indyk, Li Zhang : Probabilistic Analysis for Discrete Attributes of Moving Points. International Journal of Computational Geometry and Applications 13 (1): 5-22 (2003) 60 Graham Cormode , Mayur Datar , Piotr Indyk, S. Muthukrishnan : Comparing Data Streams Using Hamming Norms (How to Zero In). TKDE 15 (3): 529-540 (2003) 59 Moses Charikar , Piotr Indyk, Rina Panigrahy : New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems. ICALP 2002 : 451-462 58 Sudipto Guha , Piotr Indyk, S. Muthukrishnan , Martin Strauss : Histogramming Data Streams with Fast Per-Item Processing. ICALP 2002 : 681-692 57 Graham Cormode , Piotr Indyk, Nick Koudas , S. Muthukrishnan : Fast Mining of Massive Tabular Data via Approximate Distance Computations. ICDE 2002 : 605- 56 Nitin Thaper , Sudipto Guha , Piotr Indyk, Nick Koudas : Dynamic multidimensional histograms. SIGMOD Conference 2002 : 428-439 55 Mayur Datar , Aristides Gionis , Piotr Indyk, Rajeev Motwani : Maintaining stream statistics over sliding windows (extended abstract). SODA 2002 : 635-644 54 Piotr Indyk: Explicit constructions of selectors and related combinatorial structures, with applications. SODA 2002 : 697-704 53 Lars Engebretsen , Piotr Indyk, Ryan O'Donnell : Derandomized dimensionality reduction with applications. SODA 2002 : 705-712 52 Anna C. Gilbert , Sudipto Guha , Piotr Indyk, S. Muthukrishnan , Martin Strauss : Near-optimal sparse fourier representations via sampling. STOC 2002 : 152-161 51 Mihai Badoiu , Sariel Har-Peled , Piotr Indyk: Approximate clustering via core-sets. STOC 2002 : 250-257 50 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 49 Venkatesan Guruswami , Piotr Indyk: Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets. STOC 2002 : 812-821 48 Piotr Indyk: Approximate nearest neighbor algorithms for Frechet distance via product metrics. Symposium on Computational Geometry 2002 : 102-106 47 Graham Cormode , Mayur Datar , Piotr Indyk, S. Muthukrishnan : Comparing Data Streams Using Hamming Norms (How to Zero In). VLDB 2002 : 335-345 46 Taher H. Haveliwala , Aristides Gionis , Dan Klein , Piotr Indyk: Evaluating strategies for similarity search on the web. WWW 2002 : 432-442 45 Piotr Indyk: List-decoding in Linear Time. Electronic Colloquium on Computational Complexity (ECCC) (024): (2002) 44 Piotr Indyk: Algorithmic Applications of Low-Distortion Geometric Embeddings. FOCS 2001 : 10-33 43 Venkatesan Guruswami , Piotr Indyk: Expander-Based Constructions of Efficiently Decodable Codes. FOCS 2001 : 658-667 42 Alon Efrat , Piotr Indyk, Suresh Venkatasubramanian : Pattern matching for sets of segments. SODA 2001 : 295-304 41 Ashish Goel , Piotr Indyk, Kasturi R. Varadarajan : Reductions among high dimensional proximity problems. SODA 2001 : 769-778 40 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) 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 l infinity Norm. JCSS 63 (4): 627-638 (2001) 37 Yair Bartal , Moses Charikar , Piotr Indyk: On page migration and other relaxed task systems. TCS 268 (1): 43-66 (2001) 36 Edith Cohen , Mayur Datar , Shinji Fujiwara , Aristides Gionis , Piotr Indyk, Rajeev Motwani , Jeffrey D. Ullman , Cheng Yang : Finding Interesting Associations without Support Pruning. TKDE 13 (1): 64-78 (2001) 35 Piotr Indyk: Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation. FOCS 2000 : 189-197 34 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-499 33 Martin Gavrilov , Dragomir Anguelov , Piotr Indyk, Rajeev Motwani : Mining the stock market (extended abstract): which measure is best? KDD 2000 : 487-496 32 Piotr Indyk, Suresh Venkatasubramanian : Approximate congruence in nearly linear time. SODA 2000 : 354-360 31 Piotr Indyk: Dimensionality reduction techniques for proximity problems. SODA 2000 : 371-378 30 Sariel Har-Peled , Piotr Indyk: When crossings count - approximating the minimum spanning tree. Symposium on Computational Geometry 2000 : 166-175 29 Piotr Indyk, Nick Koudas , S. Muthukrishnan : Identifying Representative Trends in Massive Time Series Data Sets Using Sketches. VLDB 2000 : 363-372 28 Taher H. Haveliwala , Aristides Gionis , Piotr Indyk: Scalable Techniques for Clustering the Web. WebDB (Informal Proceedings) 2000 : 129-134 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 log 3 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) 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 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 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 2 Piotr Indyk: Optimal Simulation of Automata by Neural Nets. STACS 1995 : 337-348 1 Bogdan S. Chlebus , Anna Gambin , Piotr Indyk: PRAM Computations Resilient to Memory Faults. ESA 1994 : 401-412  DiSC'03 © 2003 Association for Computing Machinery |
