209 citations · 489 across the 24 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.DS2017★ 1 cited
Graph-based time-space trade-offs for approximate near neighbors
Thijs Laarhoven
We take a first step towards a rigorous asymptotic analysis of graph-based approaches for finding (approximate) nearest neighbors in high-dimensional spaces, by analyzing the compl…
cs.DS2017★ 2 cited
Faster tuple lattice sieving using spherical locality-sensitive filters
Thijs Laarhoven
To overcome the large memory requirement of classical lattice sieving algorithms for solving hard lattice problems, Bai-Laarhoven-Stehlé [ANTS 2016] studied tuple lattice sieving,…
cs.DS2017★ 6 cited
Hypercube LSH for approximate near neighbors
Thijs Laarhoven
A celebrated technique for finding near neighbors for the angular distance involves using a set of \textit{random} hyperplanes to partition the space into hash regions [Charikar, S…