Locality-sensitive hashing scheme based on p-stable distributions
Coordination mechanisms for selfish scheduling
Proceedings of the twentieth annual symposium on Computational geometry - SCG ’04
Theoretical Computer Science
Vahab S. Mirrokni
Andreas S. Schulz
Li (Erran) Li
Piotr Indyk
Mayur Datar
Efficient distributed locality sensitive hashing
Stable distributions, pseudorandom generators, embeddings, and data stream computation
Coordination mechanisms from (almost) all scheduling policies
Query-aware locality-sensitive hashing scheme for $$l_p$$ l p norm