Martin Aumüller

Parameter-free locality sensitive hashing for spherical range reporting

We present a data structure for *spherical range reporting* on a point set

Optimal Partitioning for Dual-Pivot Quicksort

S

Explicit and efficient hash families suffice for cuckoo hashing with a stash

, i.e., reporting all points in

How Good Is Multi-Pivot Quicksort?

S

Experimental Variations of a Theoretically Good Retrieval Data Structure

that lie within radius

Optimal partitioning for dual pivot quicksort

r

Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash

of a given query point

Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort

q

Optimal Partitioning for Dual Pivot Quicksort - (Extended Abstract).

. Our solution builds upon the Locality-Sensitive Hashing (LSH) framework of Indyk and Motwani, which represents the asymptotically best solutions to near neighbor problems in high dimensions. While traditional LSH data structures have several parameters whose optimal values depend on the distance distribution from

High-dimensional Spherical Range Reporting by Output-Sensitive Multi-Probing LSH.

q