On the k-Independence Required by Linear Probing and Minwise Independence

DOI10.1007/978-3-642-14165-2_60zbMath1288.68050OpenAlexW1851100088WikidataQ61386870 ScholiaQ61386870MaRDI QIDQ3587421

Mikkel Thorup, Mihai Pǎtraşcu

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14165-2_60

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (3)

Binary vectors for fast distance and similarity estimation ⋮ d-k-min-wise independent family of hash functions ⋮ Exponential time improvement for min-wise based algorithms

This page was built for publication: On the k-Independence Required by Linear Probing and Minwise Independence