Linear probing with constant independence (2007)

by Anna Pagh , Rasmus Pagh
Venue:In STOC ’07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Citations:14 - 2 self

Documents Related by Co-Citation

669 Universal classes of hash functions – L Carter, M Wegman - 1979
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
124 Cuckoo hashing – Rasmus Pagh, Flemming Friche Rodler - 2001
33 Why simple hash functions work: Exploiting the entropy in a data stream – Michael Mitzenmacher, Salil Vadhan - 2008
331 New Hash Functions and Their Use in Authentication and Set Equality – M N Wegman, J L Carter - 1981
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
8 String hashing for linear probing – Mikkel Thorup - 2009
10 How caching affects hashing – G L Heileman, W Luo - 2005
6 Notes On "Open" Addressing – Don Knuth - 1963
39 Universal hashing and k-wise independent random variables via integer arithmetic without primes – Martin Dietzfelbinger - 1996
5 On the k-independence required by linear probing and minwise independence – Mikkel Thorup - 2010
182 Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity – Benny Chor, Oded Goldreich - 1988
17 The analysis of closed hashing under limited randomness (extended abstract – Jeanette P Schmidt, Alan Siegel - 1990
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
104 Chernoff-Hoeffding Bounds for Applications with Limited Independence – Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan - 1993
222 Storing a sparse table with O(1) worst case access time – M L Fredman, J Komlós, E Szemerédi - 1984