Piotr Indyk
1994–2026 年に発表
- 249
- 論文数
- 29,533
- 被引用数
- 72
- h 指数
- 172
- i10 指数
被引用数
引用元
国・地域
機関
分野
- Computer Science77.1%
- Engineering12.5%
- Physics and Astronomy2%
- Decision Sciences2%
- Biochemistry, Genetics and Molecular Biology1.8%
- Mathematics1%
- その他3.6%
トピック
- Advanced Image and Video Retrieval Techniques9.8%
- Data Management and Algorithms5.3%
- Image Retrieval and Classification Techniques4.1%
- Algorithms and Data Compression3.4%
- Sparse and Compressive Sensing Techniques2.7%
- Complexity and Algorithms in Graphs2.6%
- その他72.1%
共著者
- Alexandr Andoni21
- Tal Wagner18
- Sandeep Silwal16
- David P. Woodruff14
- Rajeev Motwani14
- Ludwig Schmidt13
- Ronitt Rubinfeld13
- Sepideh Mahabadi13
- Arturs Backurs11
- Dina Katabi11
- Eric Price11
- Ali Vakilian10
- Chinmay Hegde10
- Justin Y. Chen9
- Shyam Narayanan9
- Haike Xu8
- Haitham Hassanieh8
- Ilya P. Razenshteyn8
- Mihai Badoiu8
- Anastasios Sidiropoulos7
- Aristides Gionis7
- Venkatesan Guruswami7
- Mayur Datar6
- Michael Kapralov6
全論文
- Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality
著者: Piotr Indyk, Rajeev Motwani - thirtieth annual ACM symposium on Theory of computing - STOC '98, Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 1998 被引用: 4,188
- Locality-sensitive hashing scheme based on p-stable distributions
著者: Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab S. Mirrokni - twentieth annual symposium on Computational geometry, SCG 2004 被引用: 2,971
- Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
著者: Alexandr Andoni, Piotr Indyk - 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), Commun. ACM 2006 被引用: 1,458
- Maintaining Stream Statistics over Sliding Windows
著者: Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani - SIAM Journal on Computing, SIAM J. Comput. 2002 被引用: 846
- Fast millimeter wave beam alignment
著者: Haitham Hassanieh, Omid Abari, Michael Rodriguez, Mohammed A. Abdelghany, Dina Katabi, Piotr Indyk - Conference of the ACM Special Interest Group on Data Communication, SIGCOMM 2018 被引用: 194
- Similarity Search in High Dimensions via Hashing
著者: Aristides Gionis, Piotr Indyk, Rajeev Motwani - http://www.cs.ust.hk/~leichen/courses/comp630j/readings/searchhighdim/simsearchviahashing-vldb98.pdf 1999 被引用: 3,108
- Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality
著者: Sariel Har-Peled, Piotr Indyk, Rajeev Motwani - Theory of Computing, Theory Comput. 2012 被引用: 685
- Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False)
著者: Arturs Backurs, Piotr Indyk - forty-seventh annual ACM symposium on Theory of Computing, SIAM J. Comput. 2015 被引用: 261
- Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing
著者: Narayanan Sundaram, Aizana Turmukhametova, Nadathur Satish, Todd Mostak, Piotr Indyk, Samuel Madden, Pradeep Dubey - VLDB Endowment, Proc. VLDB Endow. 2013 被引用: 114
- Approximate clustering via core-sets
著者: Mihai Badoiu, Sariel Har-Peled, Piotr Indyk - thiry-fourth annual ACM symposium on Theory of computing, STOC 2002 被引用: 369
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
著者: Donald Aingworth, Chandra Chekuri, Piotr Indyk, Rajeev Motwani - SIAM Journal on Computing, SIAM J. Comput. 1999 被引用: 337
- Practical and Optimal LSH for Angular Distance
著者: Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya P. Razenshteyn, Ludwig Schmidt - NIPS 2015 被引用: 555
- Simple and practical algorithm for sparse Fourier transform
著者: Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price - Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012 被引用: 243
- Nearest-Neighbor Methods in Learning and Vision
著者: Gregory Shakhnarovich, Trevor Darrell, Piotr Indyk - IEEE Transactions on Neural Networks, IEEE Trans. Neural Networks 2008 被引用: 234
- Optimal approximations of the frequency moments of data streams
著者: Piotr Indyk, David P. Woodruff - thirty-seventh annual ACM symposium on Theory of computing, STOC 2005 被引用: 227
- Stable distributions, pseudorandom generators, embeddings, and data stream computation
著者: Piotr Indyk - Journal of the ACM, FOCS 2000 被引用: 428
- Beyond Locality-Sensitive Hashing
著者: Alexandr Andoni, Piotr Indyk, Huy L. Nguyen, Ilya P. Razenshteyn - Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013 被引用: 84
- Nearly Optimal Sparse Fourier Transform
著者: Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price - forty-fourth annual ACM symposium on Theory of computing, STOC 2012 被引用: 276
- Targeted Supervised Contrastive Learning for Long-Tailed Recognition
著者: Tianhong Li, Peng Cao, Yuan Yuan, Lijie Fan, Yuzhe Yang, Rogério Feris, Piotr Indyk, Dina Katabi - IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) 2022 被引用: 199
- Nearest-neighbor-preserving embeddings
著者: Piotr Indyk, Assaf Naor - ACM Transactions on Algorithms, ACM Trans. Algorithms 2007 被引用: 136
- Approximate Nearest Neighbor Search in High Dimensions
著者: Alexandr Andoni, Piotr Indyk, Ilya P. Razenshteyn - Congress of Mathematicians (ICM 2018), Proceedings of the International Congress of Mathematicians (ICM 2018) 2019 被引用: 51
- Composable core-sets for diversity and coverage maximization
著者: Piotr Indyk, Sepideh Mahabadi, Mohammad Mahdian, Vahab S. Mirrokni - SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS 2014 被引用: 108
- Rapid Sampling for Visualizations with Ordering Guarantees
著者: Albert Kim, Eric Blais, Aditya G. Parameswaran, Piotr Indyk, Samuel Madden, Ronitt Rubinfeld - VLDB Endowment, Proc. VLDB Endow. 2015 被引用: 102
- Approxiamate Nearest Neighbor Search in High Dimensions
著者: Alexandr Andoni, Piotr Indyk, Ilya Razenshteyn - 2018 被引用: 51
