DBLife: Piotr Indyk

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

2013

150

Sample-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

149

On Model-Based RIP-1 Matrices. Piotr Indyk, Ilya Razenshteyn. CoRR (abs/1304.3604) (2013). Web SearchBibTeXDownload

148

Euclidean spanners in high dimensions. Sariel Har-Peled, Piotr Indyk, Anastasios Sidiropoulos. SODA 2013, 804-809. Web SearchBibTeXDownload

147

Shift Finding in Sub-Linear Time. Alexandr Andoni, Piotr Indyk, Dina Katabi, Haitham Hassanieh. SODA 2013, 457-465. Web SearchBibTeXDownload

146

Real-time recommendation of diverse related articles. Sofiane Abbar, Sihem Amer-Yahia, Piotr Indyk, Sepideh Mahabadi. WWW 2013, 1-12. Web SearchBibTeXDownload

2012

145

Nearly Optimal Sparse Fourier Transform. Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price. CoRR (abs/1201.2501) (2012). Web SearchBibTeXDownload

144

Compressive Sensing with Local Geometric Features. Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachlin. CoRR (abs/1208.2447) (2012). Web SearchBibTeXDownload

143

Faster GPS via the sparse fourier transform. Haitham Hassanieh, Fadel Adib, Dina Katabi, Piotr Indyk. MOBICOM 2012, 353-364. Web SearchBibTeXDownload

142

Approximating and testing k-histogram distributions in sub-linear time. Piotr Indyk, Reut Levi, Ronitt Rubinfeld. PODS 2012, 15-22. Web SearchBibTeXDownload

141

Efficient and reliable low-power backscatter networks. Jue Wang, Haitham Hassanieh, Dina Katabi, Piotr Indyk. SIGCOMM 2012, 61-72. Web SearchBibTeXDownload

140

Simple and practical algorithm for sparse Fourier transform. Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price. SODA 2012, 1183-1194. Web SearchBibTeXDownload

139

Nearly optimal sparse fourier transform. Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price. STOC 2012, 563-578. Web SearchBibTeXDownload

138

Approximate 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

137

Sparse Recovery with Partial Support Knowledge. Khanh Do Ba, Piotr Indyk. APPROX-RANDOM 2011, 26-37. Web SearchBibTeXDownload

136

K-Median Clustering, Model-Based Compressive Sensing, and Sparse Recovery for Earth Mover Distance. Piotr Indyk, Eric Price. CoRR (abs/1104.4674) (2011). Web SearchBibTeXDownload

135

On the Power of Adaptivity in Sparse Recovery. Piotr Indyk, Eric Price, David P. Woodruff. CoRR (abs/1110.3850) (2011). Web SearchBibTeXDownload

134

Lower Bounds for Sparse Recovery. Khanh Do Ba, Piotr Indyk, Eric Price, David P. Woodruff. CoRR (abs/1106.0365) (2011). Web SearchBibTeXDownload

133

Approximating 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

132

The Complexity of Linear Dependence Problems in Vector Spaces. Arnab Bhattacharyya, Piotr Indyk, David P. Woodruff, Ning Xie. ICS 2011, 496-508. Web SearchBibTeXDownload

131

K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance. Piotr Indyk, Eric Price. STOC 2011, 627-636. Web SearchBibTeXDownload

130

Compressive sensing with local geometric features. Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachlin. Symposium on Computational Geometry 2011, 87-96. Web SearchBibTeXDownload

2010

129

Space-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

128

Online Embeddings. Piotr Indyk, Avner Magen, Anastasios Sidiropoulos, Anastasios Zouzias. APPROX-RANDOM 2010, 246-259. Web SearchBibTeXDownload

127

Almost-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

126

A simple construction of almost-Euclidean subspaces of $\\ell_1^N$ via tensor products. Piotr Indyk, Stanislaw Szarek. CoRR (abs/1001.0041) (2010). Web SearchBibTeXDownload

125

Sparse Recovery Using Sparse Random Matrices. Piotr Indyk. LATIN 2010, 157. Web SearchBibTeXDownload

124

Sparse Recovery Using Sparse Matrices. Anna C. Gilbert, Piotr Indyk. Proceedings of the IEEE (98): 937-947 (2010). Web SearchBibTeXDownload

123

Sublinear Algorithms in the External Memory Model. Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld. Property Testing 2010, 240-243. Web SearchBibTeXDownload

122

Efficiently Decodable Non-adaptive Group Testing. Piotr Indyk, Hung Q. Ngo, Atri Rudra. SODA 2010, 1126-1142. Web SearchBibTeXDownload

121

Lower Bounds for Sparse Recovery. Khanh Do Ba, Piotr Indyk, Eric Price, David P. Woodruff. SODA 2010, 1190-1197. Web SearchBibTeXDownload

120

Motif 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

119

Efficient Sketches for Earth-Mover Distance, with Applications. Alexandr Andoni, Khanh Do Ba, Piotr Indyk, David P. Woodruff. FOCS 2009, 324-330. Web SearchBibTeXDownload

118

External Sampling. Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld. ICALP (1) 2009, 83-94. Web SearchBibTeXDownload

117

Learning Approximate Sequential Patterns for Classification. Zeeshan Syed, Piotr Indyk, John V. Guttag. Journal of Machine Learning Research (10): 1913-1936 (2009). Web SearchBibTeXDownload

116

Space-optimal heavy hitters with strong error bounds. Radu Berinde, Piotr Indyk, Graham Cormode, Martin J. Strauss. PODS 2009, 157-166. Web SearchBibTeXDownload

115

Overcoming the l1 non-embeddability barrier: algorithms for product metrics. Alexandr Andoni, Piotr Indyk, Robert Krauthgamer. SODA 2009, 865-874. Cited by 14Web SearchBibTeXDownload

114

Approximate line nearest neighbor in high dimensions. Alexandr Andoni, Piotr Indyk, Robert Krauthgamer, Huy L. Nguyen. SODA 2009, 293-301. Web SearchBibTeXDownload

113

Efficient 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

112

Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Alexandr Andoni, Piotr Indyk. Commun. ACM (51): 117-122 (2008). Cited by 118Web SearchBibTeXDownload

111

Combining 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

110

Near-Optimal Sparse Recovery in the L1 Norm. Piotr Indyk, Milan Ruzic. FOCS 2008, 199-207. Cited by 11Web SearchBibTeXDownload

109

Nearest-Neighbor Methods in Learning and Vision. Gregory Shakhnarovich, Trevor Darrell, Piotr Indyk. IEEE Transactions on Neural Networks (19): 377 (2008). Cited by 23Web SearchBibTeXDownload

108

Sampling in Dynamic Data Streams and Applications. Gereon Frahling, Piotr Indyk, Christian Sohler. Int. J. Comput. Geometry Appl. (18): 3-28 (2008). Web SearchBibTeXDownload

107

Sketching information divergences. Sudipto Guha, Piotr Indyk, Andrew McGregor. Machine Learning (72): 5-19 (2008). Cited by 12Web SearchBibTeXDownload

106

Earth mover distance over high-dimensional spaces. Alexandr Andoni, Piotr Indyk, Robert Krauthgamer. SODA 2008, 343-352. Cited by 7Web SearchBibTeXDownload

105

Declaring independence via the sketching of sketches. Piotr Indyk, Andrew McGregor. SODA 2008, 737-745. Cited by 9Web SearchBibTeXDownload

104

Explicit constructions for compressed sensing of sparse signals. Piotr Indyk. SODA 2008, 30-33. Cited by 33Web SearchBibTeXDownload

2007

103

Nearest-neighbor-preserving embeddings. Piotr Indyk, Assaf Naor. ACM Transactions on Algorithms (3) (2007). Cited by 26Web SearchBibTeXDownload

102

Sketching Information Divergences. Sudipto Guha, Piotr Indyk, Andrew McGregor. COLT 2007, 424-438. Web SearchBibTeXDownload

101

Earth Mover Distance over High-Dimensional Spaces. Alexandr Andoni, Piotr Indyk, Robert Krauthgamer. Electronic Colloquium on Computational Complexity (ECCC) (14) (2007). Web SearchBibTeXDownload

100

A near linear time constant factor approximation for Euclidean bichromatic matching (cost). Piotr Indyk. SODA 2007, 39-42. Cited by 7Web SearchBibTeXDownload

Approximation algorithms for embedding general metrics into trees. Mihai Badoiu, Piotr Indyk, Anastasios Sidiropoulos. SODA 2007, 512-521. Cited by 14Web SearchBibTeXDownload

Efficient 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

Uncertainty principles, extractors, and explicit embeddings of l2 into l1. Piotr Indyk. STOC 2007, 615-620. Cited by 28Web SearchBibTeXDownload

Probabilistic embeddings of bounded genus graphs into planar graphs. Piotr Indyk, Anastasios Sidiropoulos. Symposium on Computational Geometry 2007, 204-209. Cited by 9Web SearchBibTeXDownload

2006

Low-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

Uncertainty Principles, Extractors, and Explicit Embeddings of L2 into L1. Piotr Indyk. Electronic Colloquium on Computational Complexity (ECCC) (13) (2006). Web SearchBibTeXDownload

Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions. Alexandr Andoni, Piotr Indyk. FOCS 2006, 459-468. Web SearchBibTeXDownload

On the Optimality of the Dimensionality Reduction Method. Alexandr Andoni, Piotr Indyk, Mihai Patrascu. FOCS 2006, 449-458. Cited by 18Web SearchBibTeXDownload

Stable distributions, pseudorandom generators, embeddings, and data stream computation. Piotr Indyk. J. ACM (53): 307-323 (2006). Cited by 311Web SearchBibTeXDownload

Efficient algorithms for substring near neighbor problem. Alexandr Andoni, Piotr Indyk. SODA 2006, 1203-1212. Cited by 10Web SearchBibTeXDownload

Embedding ultrametrics into low-dimensional spaces. Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos. Symposium on Computational Geometry 2006, 187-196. Cited by 10Web SearchBibTeXDownload

Polylogarithmic Private Approximations and Efficient Matching. Piotr Indyk, David P. Woodruff. TCC 2006, 245-264. Cited by 43Web SearchBibTeXDownload

2005

Polylogarithmic Private Approximations and Efficient Matching. Piotr Indyk, David P. Woodruff. Electronic Colloquium on Computational Complexity (ECCC) 2005. Cited by 43Web SearchBibTeXDownload

Facility Location in Sublinear Time. Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian Sohler. ICALP 2005, 866-877. Cited by 15Web SearchBibTeXDownload

Linear-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

Optimal approximations of the frequency moments of data streams. Piotr Indyk, David P. Woodruff. STOC 2005, 202-208. Cited by 70Web SearchBibTeXDownload

Low-distortion embeddings of general metrics into the line. Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos. STOC 2005, 225-233. Cited by 33Web SearchBibTeXDownload

Sampling in dynamic data streams and applications. Gereon Frahling, Piotr Indyk, Christian Sohler. Symposium on Computational Geometry 2005, 142-149. Cited by 31Web SearchBibTeXDownload

2004

Pattern Matching for Sets of Segments. Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian. Algorithmica (40): 147-160 (2004). Cited by 8Web SearchBibTeXDownload

Streaming Algorithms for Geometric Problems. Piotr Indyk. FSTTCS 2004, 32-34. Cited by 4Web SearchBibTeXDownload

Linear-Time List Decoding in Error-Free Settings: (Extended Abstract). Venkatesan Guruswami, Piotr Indyk. ICALP 2004, 695-707. Cited by 4Web SearchBibTeXDownload

Closest Pair Problems in Very High Dimensions. Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat. ICALP 2004, 782-792. Cited by 14Web SearchBibTeXDownload

Fast approximate pattern matching with few indels via embeddings. Mihai Badoiu, Piotr Indyk. SODA 2004, 651-652. Web SearchBibTeXDownload

Approximate Nearest Neighbor under edit distance via product metrics. Piotr Indyk. SODA 2004, 646-650. Cited by 11Web SearchBibTeXDownload

Efficiently decodable codes meeting Gilbert-Varshamov bound for low rates. Venkatesan Guruswami, Piotr Indyk. SODA 2004, 756-757. Cited by 4Web SearchBibTeXDownload

Algorithms for dynamic geometric problems over data streams. Piotr Indyk. STOC 2004, 373-380. Cited by 55Web SearchBibTeXDownload

Low-dimensional embedding with extra information. Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk. Symposium on Computational Geometry 2004, 320-329. Web SearchBibTeXDownload

Locality-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

Combinatorial 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

Approximate congruence in nearly linear time. Piotr Indyk, Suresh Venkatasubramanian. Comput. Geom. (24): 115-128 (2003). Cited by 19Web SearchBibTeXDownload

When Crossings Count - Approximating the Minimum Spanning Tree. Sariel Har-Peled, Piotr Indyk. CoRR (cs.CG/0303001) (2003). Web SearchBibTeXDownload

Tight Lower Bounds for the Distinct Elements Problem. Piotr Indyk, David P. Woodruff. FOCS 2003, 283-288. Cited by 38Web SearchBibTeXDownload

Comparing 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

Probabilistic 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

Better algorithms for high-dimensional proximity problems via asymmetric embeddings. Piotr Indyk. SODA 2003, 539-545. Cited by 22Web SearchBibTeXDownload

Lower 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

Embeddings and non-approximability of geometric problems. Venkatesan Guruswami, Piotr Indyk. SODA 2003, 537-538. Cited by 6Web SearchBibTeXDownload

Linear time encodable and list decodable codes. Venkatesan Guruswami, Piotr Indyk. STOC 2003, 126-135. Cited by 19Web SearchBibTeXDownload

2002

List-decoding in Linear Time. Piotr Indyk. Electronic Colloquium on Computational Complexity (ECCC) 2002. Cited by 4Web SearchBibTeXDownload

Histogramming Data Streams with Fast Per-Item Processing. Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss. ICALP 2002, 681-692. Cited by 55Web SearchBibTeXDownload

New 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

Fast 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

Maintaining Stream Statistics over Sliding Windows. Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani. SIAM J. Comput. (31): 1794-1813 (2002). Cited by 3Web SearchBibTeXDownload

Dynamic multidimensional histograms. Nitin Thaper, Sudipto Guha, Piotr Indyk, Nick Koudas. SIGMOD Conference 2002, 428-439. Cited by 147Web SearchBibTeXDownload

Explicit constructions of selectors and related combinatorial structures, with applications. Piotr Indyk. SODA 2002, 697-704. Cited by 70Web SearchBibTeXDownload

Derandomized dimensionality reduction with applications. Lars Engebretsen, Piotr Indyk, Ryan O'Donnell. SODA 2002, 705-712. Cited by 27Web SearchBibTeXDownload

Maintaining stream statistics over sliding windows (extended abstract). Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani. SODA 2002, 635-644. Cited by 411Web SearchBibTeXDownload

Near-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

Fast, 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

Approximate clustering via core-sets. Mihai Badoiu, Sariel Har-Peled, Piotr Indyk. STOC 2002, 250-257. Cited by 152Web SearchBibTeXDownload

Near-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

Approximate nearest neighbor algorithms for Frechet distance via product metrics. Piotr Indyk. Symposium on Computational Geometry 2002, 102-106. Cited by 23Web SearchBibTeXDownload

Comparing 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

Evaluating 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

Efficient 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

Algorithmic Applications of Low-Distortion Geometric Embeddings. Piotr Indyk. FOCS 2001, 10-33. Cited by 165Web SearchBibTeXDownload

Expander-Based Constructions of Efficiently Decodable Codes. Venkatesan Guruswami, Piotr Indyk. FOCS 2001, 658-667. Cited by 50Web SearchBibTeXDownload

Finding 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

A Small Approximately Min-Wise Independent Family of Hash Functions. Piotr Indyk. J. Algorithms (38): 84-90 (2001). Cited by 72Web SearchBibTeXDownload

On Approximate Nearest Neighbors under linfinity Norm. Piotr Indyk. J. Comput. Syst. Sci. (63): 627-638 (2001). Cited by 12Web SearchBibTeXDownload

Reductions among high dimensional proximity problems. Ashish Goel, Piotr Indyk, Kasturi R. Varadarajan. SODA 2001, 769-778. Cited by 38Web SearchBibTeXDownload

Pattern matching for sets of segments. Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian. SODA 2001, 295-304. Web SearchBibTeXDownload

On 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

Pattern Matching for sets of segments. Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian. CoRR (cs.CG/0009013) (2000). Web SearchBibTeXDownload

Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation. Piotr Indyk. FOCS 2000, 189-197. Web SearchBibTeXDownload

Finding 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

Mining 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

Approximate congruence in nearly linear time. Piotr Indyk, Suresh Venkatasubramanian. SODA 2000, 354-360. Cited by 19Web SearchBibTeXDownload

Dimensionality reduction techniques for proximity problems. Piotr Indyk. SODA 2000, 371-378. Cited by 46Web SearchBibTeXDownload

When crossings count - approximating the minimum spanning tree. Sariel Har-Peled, Piotr Indyk. Symposium on Computational Geometry 2000, 166-175. Cited by 8Web SearchBibTeXDownload

Identifying Representative Trends in Massive Time Series Data Sets Using Sketches. Piotr Indyk, Nick Koudas, S. Muthukrishnan. VLDB 2000, 363-372. Cited by 113Web SearchBibTeXDownload

Scalable Techniques for Clustering the Web. Taher H. Haveliwala, Aristides Gionis, Piotr Indyk. WebDB (Informal Proceedings) 2000, 129-134. Cited by 78Web SearchBibTeXDownload

1999

Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings. Martin Farach-Colton, Piotr Indyk. FOCS 1999, 171-180. Cited by 24Web SearchBibTeXDownload

Stochastic Load Balancing and Related Problems. Ashish Goel, Piotr Indyk. FOCS 1999, 579-586. Cited by 48Web SearchBibTeXDownload

A Sublinear Time Approximation Scheme for Clustering in Metric Spaces. Piotr Indyk. FOCS 1999, 154-159. Cited by 94Web SearchBibTeXDownload

Efficient 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

Fast 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

Geometric Matching Under Noise: Combinatorial Bounds and Algorithms. Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian. SODA 1999, 457-465. Cited by 45Web SearchBibTeXDownload

Tree 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

A Small Approximately min-wise Independent Family of Hash Functions. Piotr Indyk. SODA 1999, 454-456. Web SearchBibTeXDownload

Sublinear Time Algorithms for Metric Space Problems. Piotr Indyk. STOC 1999, 428-434. Cited by 107Web SearchBibTeXDownload

Inerpolation of Symmetric Functions and a New Type of Combinatorial Design. Piotr Indyk. STOC 1999, 736-740. Cited by 5Web SearchBibTeXDownload

Geometric Pattern Matching: A Performance Study. Martin Gavrilov, Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian. Symposium on Computational Geometry 1999, 79-85. Cited by 18Web SearchBibTeXDownload

Similarity Search in High Dimensions via Hashing. Aristides Gionis, Piotr Indyk, Rajeev Motwani. VLDB 1999, 518-529. Cited by 535Web SearchBibTeXDownload

1998

On Approximate Nearest Neighbors in Non-Euclidean Spaces. Piotr Indyk. FOCS 1998, 148-155. Cited by 33Web SearchBibTeXDownload

Faster Algorithms for String Matching Problems: Matching the Convolution Bound. Piotr Indyk. FOCS 1998, 166-173. Cited by 38Web SearchBibTeXDownload

Enhanced Hypertext Categorization Using Hyperlinks. Soumen Chakrabarti, Byron Dom, Piotr Indyk. SIGMOD Conference 1998, 307-318. Cited by 610Web SearchBibTeXDownload

Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. Piotr Indyk, Rajeev Motwani. STOC 1998, 604-613. Cited by 798Web SearchBibTeXDownload

1997

On Learning Disjunctions of Zero-One Treshold Functions with Queries. Tibor Hegedüs, Piotr Indyk. ALT 1997, 446-460. Cited by 4Web SearchBibTeXDownload

External Inverse Pattern Matching. Leszek Gasieniec, Piotr Indyk, Piotr Krysta. CPM 1997, 90-101. Cited by 5Web SearchBibTeXDownload

Efficient Parallel Computing with Memory Faults. Leszek Gasieniec, Piotr Indyk. FCT 1997, 188-197. Cited by 3Web SearchBibTeXDownload

Deterministic Superimposed Coding with Applications to Pattern Matching. Piotr Indyk. FOCS 1997, 127-136. Cited by 40Web SearchBibTeXDownload

On Page Migration and Other Related Task Systems. Yair Bartal, Moses Charikar, Piotr Indyk. SODA 1997, 43-52. Web SearchBibTeXDownload

Locality-Preserving Hashing in Multidimensional Spaces. Piotr Indyk, Rajeev Motwani, Prabhakar Raghavan, Santosh Vempala. STOC 1997, 618-625. Cited by 98Web SearchBibTeXDownload

Probabilistic 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

Shared-Memory Simulations on a Faulty-Memory DMM. Bogdan S. Chlebus, Anna Gambin, Piotr Indyk. ICALP 1996, 586-597. Cited by 20Web SearchBibTeXDownload

On Word-Level Parallelism in Fault-Tolerant Computing. Piotr Indyk. STACS 1996, 193-204. Cited by 10Web SearchBibTeXDownload

1995

Optimal Simulation of Automata by Neural Nets. Piotr Indyk. STACS 1995, 337-348. Cited by 36Web SearchBibTeXDownload

1994

PRAM Computations Resilient to Memory Faults. Bogdan S. Chlebus, Anna Gambin, Piotr Indyk. ESA 1994, 401-412. Cited by 28Web SearchBibTeXDownload

Associate Professor
http://theory.lcs.mit.edu/~indyk/
Massachusettes Institute of Technology
USA
Papers cited 6,947 times
H-Index of 38

Piotr Indyk

Related People

Related Topics

Services

Related Organizations

Talks

1.	^ Untitled Document - Retrieved 2013-05-13 - details Original context from http://clair.si.umich.edu/clair/sigmod-pods06/SIGMOD-org.htm ... Piotr Indyk MIT ...
2.	^ Untitled Document - Retrieved 2013-05-29 - details Original context from http://cimic.rutgers.edu/~sigmod05/PODScfp.htm ...Bell Labs Lucent Technologies, USA Dimitrios Gunopulos , University of California at Riverside, USA Piotr Indyk , MIT, USA Christoph Koch , Technical University of Vienna, Austria Chen Li, University of Californi...
3.	^ Untitled Document - Retrieved 2013-05-29 - details Original context from http://cimic.rutgers.edu/~sigmod05/Organization.htm ...Labs Lucent Technologies, USA Dimitrios Gunopulos, University of California at Riverside, USA Piotr Indyk , MIT, USA Christoph Koch, Technical University of Vienna, Austria Chen Li, University o...
4.	^ Dartmouth Computer Science: Seminar Series - Retrieved 2010-09-21 - details Original context from http://www.cs.dartmouth.edu/seminar.php ...ftware for mesh generation. Details can be found at http://www.cse.ohio-state.edu/~tamaldey . Name: Piotr Indyk Affiliation: CSAIL, MIT Date: Wed, Oct 15 2008 Time: 4:00 - 5:30pm Host: Afra Zomorodian and Hany F...
5.	^ Events Calendar \| CSAIL - Retrieved 2013-05-12 - details Original context from http://www.csail.mit.edu/events/eventcalendar/calendar.php?show=series&id=202 ... Piotr Indyk , CSAIL, MIT LIDS/TOC Talk: Faster Algorithms for the Sparse Fourier Transform ...
6.	^ The IBM Research/NYU/Columbia Theory Day - NYU Computer Science Department - Retrieved 2011-04-23 - details Original context from http://cs.nyu.edu/web/Calendar/colloquium/sp07/apr20_theory_day.html ...nerous support. Abstracts Uncertainty Principles, Extractors, and Explicit Embeddings of L2 into L1 Prof. Piotr Indyk MIT The area of geometric functional analysis is concerned with studying properties of geometric (n...
7.	^ Computer Science & Engineering at OSU - Speakers (Anastasios Sidiropoulos) - Retrieved 2013-05-12 - details Original context from http://www.cse.ohio-state.edu/speaker/speaker256.shtml ...neering and Computer Science at the Massachusetts Institute of Technology, under the supervision of Piotr Indyk . He is currently a post-doctoral fellow in the Computer Science department at the University of Ill...