On the k-independence required by linear probing and minwise independence (2010)
by
Mikkel Thorup
| Venue: | In Proc. 37th International Colloquium on Automata, Languages and Programming (ICALP |
| Citations: | 2 - 1 self |
BibTeX
@INPROCEEDINGS{Thorup10onthe,
author = {Mikkel Thorup},
title = {On the k-independence required by linear probing and minwise independence},
booktitle = {In Proc. 37th International Colloquium on Automata, Languages and Programming (ICALP},
year = {2010},
pages = {715--726}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
)-independent hash functions are required, matching an upper bound of [Indyk, SODA’99]. We also show that the multiply-shift scheme of Dietzfelbinger, most commonly used in practice, fails badly in both applications. Abstract. We show that linear probing requires 5-independent hash functions for expected constant-time performance, matching an upper bound of [Pagh et al. STOC’07]. For (1 + ε)-approximate minwise independence, we show that Ω(lg 1 ε 1
