18 citations · 70 across the 15 of their papers we have counts for
Showing 2016 · cs.DSShow all
2 papers · 2 filters
cs.DS2016★ 4 cited
A Simple Hash Class with Strong Randomness Properties in Graphs and Hypergraphs
Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel
We study randomness properties of graphs and hypergraphs generated by simple hash functions. Several hashing applications can be analyzed by studying the structure of -uniform r…
cs.DS2016★ 18 cited
Parameter-free Locality Sensitive Hashing for Spherical Range Reporting
Thomas D. Ahle, Martin Aumüller, Rasmus Pagh
We present a data structure for *spherical range reporting* on a point set , i.e., reporting all points in that lie within radius of a given query point . Our solutio…