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