Falconn++: A Locality-sensitive Filtering Approach for Approximate Nearest Neighbor Search

Perceptrons: An introduction to computational geometry

Marvin Minsky and Seymour A Papert · 1969

Earlier work this paper cites.

The asymptotic theory of concomitants of order statistics

H. A. David and J. Galambos · 1974

Earlier work this paper cites.

Approximate nearest neighbors: Towards removing the curse of dimensionality

Piotr Indyk and Rajeev Motwani · 1998

Earlier work this paper cites.

A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces

Roger Weber, Hans-Jörg Schek, and Stephen Blott · 1998

Earlier work this paper cites.

Which problems have strongly exponential complexity?

Russell Impagliazzo, Ramamohan Paturi, and Francis Zane · 2001

Earlier work this paper cites.

Item-based collaborative filtering recommendation algorithms

Badrul Munir Sarwar, George Karypis, Joseph A. Konstan, and John Riedl · 2001

Earlier work this paper cites.

Similarity estimation techniques from rounding algorithms

Moses Charikar · 2002

Earlier work this paper cites.

Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions

Alexandr Andoni and Piotr Indyk · 2006

Earlier work this paper cites.

Finding near-duplicate web pages: a large-scale evaluation of algorithms

Monika Rauch Henzinger · 2006

Earlier work this paper cites.

Entropy based nearest neighbor search in high dimensions

Rina Panigrahy · 2006

Earlier work this paper cites.

Multi-probe LSH: efficient indexing for high-dimensional similarity search

Qin Lv, William Josephson, Zhe Wang, Moses Charikar, and Kai Li · 2007

Cited alongside, same era.

Nearest-neighbor methods in learning and vision

Gregory Shakhnarovich, Trevor Darrell, and Piotr Indyk · 2008

Cited alongside, same era.

Approximate nearest neighbor: Towards removing the curse of dimensionality

Sariel Har-Peled, Piotr Indyk, and Rajeev Motwani · 2012

Cited alongside, same era.

Streaming similarity search over one billion tweets using parallel locality-sensitive hashing

Narayanan Sundaram, Aizana Turmukhametova, Nadathur Satish, Todd Mostak, Piotr Indyk, Samuel Madden, and Pradeep Dubey · 2013

Cited alongside, same era.

Optimal lower bounds for locality-sensitive hashing (except when q is tiny)

Ryan O’Donnell, Yi Wu, and Yuan Zhou · 2014

Cited alongside, same era.

Finding orthogonal vectors in discrete structures

Optimal hashing-based time-space trade-offs for approximate near neighbors

Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, and Erik Waingarten · 2017

Later among the works it cites.

A framework for similarity search with space-time tradeoffs using locality-sensitive filtering

Tobias Christiani · 2017

Later among the works it cites.

Approximate nearest neighbor search in high dimensions

Original

Alexandr Andoni, Piotr Indyk, and Ilya P. Razenshteyn · 2018

Later among the works it cites.

Explaining the success of nearest neighbor methods in prediction

George H. Chen and Devavrat Shah · 2018

Later among the works it cites.

Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs

Yu A Malkov and Dmitry A Yashunin · 2018

Later among the works it cites.