PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors

Multidimensional binary search trees used for associative searching

Jon Louis Bentley · 1975

Earlier work this paper cites.

Data structures and algorithms for nearest neighbor search in general metric spaces

Peter N. Yianilos · 1993

Earlier work this paper cites.

On the resemblance and containment of documents

Andrei Z. Broder · 1997

Earlier work this paper cites.

M-tree: An efficient access method for similarity search in metric spaces

Paolo Ciaccia, Marco Patella, and Pavel Zezula · 1997

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.

Approximate similarity retrieval with M-Trees

Pavel Zezula, Pasquale Savino, Giuseppe Amato, and Fausto Rabitti · 1998

Earlier work this paper cites.

Similarity estimation techniques from rounding algorithms

Moses Charikar · 2002

Earlier work this paper cites.

E2LSH, user manual

Alexandr Andoni and Piotr Indyk · 2005

Earlier work this paper cites.

LSH forest: self-tuning indexes for similarity search

Mayank Bawa, Tyson Condie, and Prasanna Ganesan · 2005

Earlier work this paper cites.

Efficient algorithms for substring near neighbor problem

Alexandr Andoni and Piotr Indyk · 2006

Earlier work this paper cites.

Spherical LSH for approximate nearest neighbor search on unit hypersphere

Kengo Terasawa and Yuzuru Tanaka · 2007

Cited alongside, same era.

Modeling LSH for performance tuning

Wei Dong, Zhe Wang, William Josephson, Moses Charikar, and Kai Li · 2008

Cited alongside, same era.

Random features for large-scale kernel machines

Ali Rahimi and Benjamin Recht · 2008

Cited alongside, same era.

Theory and applications of b -bit minwise hashing

Ping Li and Arnd Christian König · 2011

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.

Bayesian locality sensitive hashing for fast similarity search

Venu Satuluri and Srinivasan Parthasarathy · 2012

Cited alongside, same era.

Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs

Original

Y. A. Malkov and D. A. Yashunin · 2016

Later among the works it cites.

ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms

Martin Aumüller, Erik Bernhardsson, and Alexander Faithfull · 2017

Later among the works it cites.

Fast locality-sensitive hashing for approximate near neighbor search

Original

Tobias Christiani · 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.

Fast similarity sketching

Søren Dahlgaard, Mathias Bæk Tejs Knudsen, and Mikkel Thorup · 2017

Later among the works it cites.