Fetching the paper…
Reading the bibliography…
The Indyk-Motwani Locality-Sensitive Hashing (LSH) framework (STOC 1998) is a general technique for constructing a data structure to answer approximate near neighbor queries by using a distribution $\mathcal{H}$ over locality-sensitive hash functions that partition space.
Probability inequalities for sums of bounded random variables
W. Hoeffding · 1963
Earlier work this paper cites.
Analytic inequalities
Dragoslav S Mitrinović · 1970
Earlier work this paper cites.
A new hashing method with application for game playing
Albert L Zobrist · 1970
Earlier work this paper cites.
Universal classes of hash functions
J. L. Carter and M. N. Wegman · 1977
Earlier work this paper cites.
Universal classes of hash functions
J. L. Carter and M. N. Wegman · 1979
Earlier work this paper cites.
New hash functions and their use in authentication and set equality
J. L. Carter and M. N. Wegman · 1981
Earlier work this paper cites.
Worst-case optimal insertion and deletion methods for decomposable searching problems
M. H. Overmars and J. van Leeuwen · 1981
Earlier work this paper cites.
Storing a sparse table with 0(1) worst case access time
M. L. Fredman, J. Komlós, and E. Szemerédi · 1984
Earlier work this paper cites.
Sorting and searching on the word RAM
T. Hagerup · 1998
Earlier work this paper cites.
Approximate nearest neighbors: towards removing the curse of dimensionality
P. Indyk and R. Motwani · 1998
Earlier work this paper cites.
Min-wise independent permutations
Andrei Z. Broder, Moses Charikar, Alan M. Frieze, and Michael Mitzenmacher · 2000
Earlier work this paper cites.
Similarity estimation techniques from rounding algorithms
M. Charikar · 2002
Earlier work this paper cites.
Locality-sensitive hashing scheme based on p-stable distributions
M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni · 2004
Cited alongside, same era.
Efficient algorithms for substring near neighbor problem
A. Andoni and P. Indyk · 2006
Cited alongside, same era.
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
A. Andoni and P. Indyk · 2006
Cited alongside, same era.
Spherical LSH for approximate nearest neighbor search on unit hypersphere
K. Terasawa and Y. Tanaka · 2007
Cited alongside, same era.
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
A. Andoni and P. Indyk · 2008
Cited alongside, same era.
Locality sensitive hash functions based on concomitant rank order statistics
K. Eshghi and S. Rajaram · 2008
Streaming similarity search over one billion tweets using parallel locality-sensitive hashing
N. Sundaram, A. Turmukhametova, N. Satish, T. Mostak, P. Indyk, S. Madden, and P. Dubey · 2013
Later among the works it cites.
Hashing for similarity search: A survey
J. Wang, H. T. Shen, J. Song, and J. Ji · 2014
Later among the works it cites.
Practical and optimal lsh for angular distance
A. Andoni, P. Indyk, T. Laarhoven, I. Razenshteyn, and L. Schmidt · 2015
Later among the works it cites.
New directions in nearest neighbor searching with applications to lattice sieving
A. Becker, L. Ducas, N. Gama, and T. Laarhoven · 2016
Later among the works it cites.
Simple and efficient weighted minwise hashing
A. Shrivastava · 2016
Later among the works it cites.
Optimal hashing-based time-space trade-offs for approximate near neighbors
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Spectral hashing
Y. Weiss, A. Torralba, and R. Fergus · 2008
Cited alongside, same era.
Bucketing coding and information theory for the statistical high-dimensional nearest-neighbor problem
M. Dubiner · 2010
Cited alongside, same era.
Fast locality-sensitive hashing
A. Dasgupta, R. Kumar, and T. Sarlós · 2011
Cited alongside, same era.
Theory and applications of b-bit minwise hashing
P. Li and A. C. König · 2011
Cited alongside, same era.
Angular quantization-based binary codes for fast similarity search
Y. Gong, S. Kumar, V. Verma, and S. Lazebnik · 2012
Cited alongside, same era.
Approximate nearest neighbor: Towards removing the curse of dimensionality
S. Har-Peled, P. Indyk, and R. Motwani · 2012
Cited alongside, same era.
A. Andoni, T. Laarhoven, I. P. Razenshteyn, and E. Waingarten · 2017
Closest in time.
A framework for similarity search with space-time tradeoffs using locality-sensitive filtering
T. Christiani · 2017
Closest in time.
Scalable and robust set similarity join
T. Christiani, R. Pagh, and J. Sivertsen · 2017
Closest in time.
S. Dahlgaard, M. B. T. Knudsen, and M. Thorup · 2017
Closest in time.
Fast cross-polytope locality-sensitive hashing
C. Kennedy and R. Ward · 2017
Closest in time.
Optimal densification for fast and accurate minwise hashing
A. Shrivastava · 2017
Closest in time.