On the k-independence required by linear probing and minwise independence (2010)

Cached

Download Links

by Mikkel Thorup
Venue:In Proc. 37th International Colloquium on Automata, Languages and Programming (ICALP
Citations:5 - 1 self

Active Bibliography

8 String hashing for linear probing – Mikkel Thorup - 2009
529 Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web – David Karger, Eric Lehman, Tom Leighton, Matthew Levine, Daniel Lewin, Rina Panigrahy Abstract - 1997
14 Linear probing with constant independence – Anna Pagh, Rasmus Pagh - 2007
1 LINEAR PROBING WITH 5-WISE INDEPENDENCE ∗ – Anna Pagh, Rasmus Pagh, Milan, Ru Zi Ć
Tabulation Based 5-independent Hashing with Applications to Linear Probing and Second Moment Estimation ∗ – Mikkel Thorup, Yin Zhang
The Power of Simple Tabulation Hashing Mihai Pǎtras¸cu AT&T Labs – Mikkel Thorup - 2011
231 Randomness is Linear in Space – Noam Nisan, David Zuckerman - 1993
207 Trajectory Sampling for Direct Traffic Observation – N. G. Duffield, M. Grossglauser - 2001
207 Approximate distance oracles – Mikkel Thorup, Uri Zwick