String hashing for linear probing (2009)

Cached

Download Links

by Mikkel Thorup
Venue:In Proc. 20th SODA
Citations:8 - 3 self

Documents Related by Co-Citation

61 Tabulation based 4-universal hashing with applications to second moment estimation – M Thorup, Y Zhang - 2004
25 On Universal Classes of Extremely Random Constant Time Hash Functions and Their Time-Space Tradeoff – Alan Siegel
331 New Hash Functions and Their Use in Authentication and Set Equality – M N Wegman, J L Carter - 1981
15 Linear probing with constant independence – Anna Pagh, Rasmus Pagh - 2007
10 How caching affects hashing – G L Heileman, W Luo - 2005
6 Notes On "Open" Addressing – Don Knuth - 1963
669 Universal classes of hash functions – L Carter, M Wegman - 1979
59 A reliable randomized algorithm for the closest-pair problem – M Dietzfelbinger, T Hagerup, J Katajainen, M Penttonen - 1993
12 Graph and Hashing Algorithms for Modern Architectures: Design and Performance – John R. Black, Jr., Charles U. Martel, Hongbin Qi - 1998
5 On the k-independence required by linear probing and minwise independence – Mikkel Thorup - 2010
3 Tabulation Based 5-Universal Hashing and Linear Probing – Mikkel Thorup, Yin Zhang
18 Even strongly universal hashing is pretty fast – M Thorup - 2000
39 Universal hashing and k-wise independent random variables via integer arithmetic without primes – Martin Dietzfelbinger - 1996
21 Almost Random Graphs with Simple Hash Functions – Martin Dietzfelbinger, Philipp Woelfel - 2003
696 Art of Computer Programming Volume 3: Sorting and Searching – D E Knuth - 1998
25 Randomized algorithms and pseudorandom numbers – H KARLOFF, P RAGHAVAN - 1988
33 Why simple hash functions work: Exploiting the entropy in a data stream – Michael Mitzenmacher, Salil Vadhan - 2008
3 Special issue on average case analysis of algorithms – H Prodinger, W S - 1998
17 The analysis of closed hashing under limited randomness (extended abstract – Jeanette P Schmidt, Alan Siegel - 1990