On the Probe Complexities of Membership and Perfect Hashing

Cached

Download Links

by Rasmus Pagh
Citations:12 - 5 self

Documents Related by Co-Citation

57 Are bitvectors optimal? – H. Buhrman, P. B. Miltersen, J. Radhakrishnan, S. Venkatesh
138 Should tables be sorted – Andrew Chi-chih Yao - 1981
669 Universal classes of hash functions – L Carter, M Wegman - 1979
39 János Komlós, and Endre Szemerédi. Storing a sparse table with O(1) worst case access time – Michael L Fredman - 1984
127 Dynamic Perfect Hashing: Upper and Lower Bounds – Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert E. Tarjan - 1990
124 Cuckoo hashing – Rasmus Pagh, Flemming Friche Rodler - 2001
255 Sorting and Searching, volume 3 of The Art of Computer Programming – Donald E Knuth - 1998
254 Balanced Allocations – Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal - 1994
68 Using Multiple Hash Functions to Improve IP Lookups – Michael Mitzenmacher, Andrei Broder - 2000
63 Membership in constant time and almost-minimum space – A BRODNIK, J MUNRO - 1999
37 The Marsaglia random number CDROM including the diehard battery of tests of randomness. http://stat.fsu.edu/pub/diehard – George Marsaglia
8 Torben Hagerup, Jyrki Katajainen, and Martti Penttonen. A reliable randomized algorithm for the closest-pair problem – Martin Dietzfelbinger - 1997
38 auf der Heide. A new universal class of hash functions and dynamic hashing in real time – Martin Dietzfelbinger, Friedhelm Meyer - 1990
58 BALANCED ALLOCATIONS: THE HEAVILY LOADED CASE – Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking - 2006
59 A reliable randomized algorithm for the closest-pair problem – M Dietzfelbinger, T Hagerup, J Katajainen, M Penttonen - 1993
33 Why simple hash functions work: Exploiting the entropy in a data stream – Michael Mitzenmacher, Salil Vadhan - 2008
6 Munro and Hendra Suwanda. Implicit data structures for fast search and update – J Ian - 1980
5 Fiat and Moni Naor. Implicit O(1) probe search – Amos - 1993
7 Stølting Brodal and Rolf Fagerberg. Dynamic representation of sparse graphs – Gerth - 1999