default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPiotr Indyk
- > Home > Persons > Piotr Indyk
Publications
- 2012
[j27]Sariel Har-Peled
, Piotr Indyk, Rajeev Motwani:
Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality. Theory Comput. 8(1): 321-350 (2012)- 2004
- [j12]Martin Gavrilov, Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian:
Combinatorial and Experimental Methods for Approximate Point Pattern Matching. Algorithmica 38(1): 59-90 (2004) - 2002
- [j7]Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani:
Maintaining Stream Statistics over Sliding Windows. SIAM J. Comput. 31(6): 1794-1813 (2002) - [c47]Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani:
Maintaining stream statistics over sliding windows (extended abstract). SODA 2002: 635-644 - 2001
- [j2]Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, Cheng Yang:
Finding Interesting Associations without Support Pruning. IEEE Trans. Knowl. Data Eng. 13(1): 64-78 (2001) - 2000
- [c32]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-500 - [c31]Martin Gavrilov, Dragomir Anguelov, Piotr Indyk, Rajeev Motwani:
Mining the stock market (extended abstract): which measure is best? KDD 2000: 487-496 - 1999
- [j1]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) - [c26]Martin Gavrilov, Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian:
Geometric Pattern Matching: A Performance Study. SCG 1999: 79-85 - [c19]Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian:
Geometric Matching Under Noise: Combinatorial Bounds and Algorithms. SODA 1999: 457-465 - [c16]Aristides Gionis, Piotr Indyk, Rajeev Motwani:
Similarity Search in High Dimensions via Hashing. VLDB 1999: 518-529 - 1998
- [c12]Piotr Indyk, Rajeev Motwani:
Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. STOC 1998: 604-613 - 1997
- [c5]Piotr Indyk, Rajeev Motwani, Prabhakar Raghavan, Santosh S. Vempala:
Locality-Preserving Hashing in Multidimensional Spaces. STOC 1997: 618-625
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-11 00:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
