|
86
|
Cuckoo hashing
– Rasmus Pagh, Flemming Friche Rodler
- 2001
|
|
34
|
Space Efficient Hash Tables With Worst Case Constant Access Time
– Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul Spirakis
- 2003
|
|
210
|
Balanced Allocations
– Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal
- 1994
|
|
27
|
Why simple hash functions work: Exploiting the entropy in a data stream
– Michael Mitzenmacher, Salil Vadhan
- 2008
|
|
61
|
Using Multiple Hash Functions to Improve IP Lookups
– Michael Mitzenmacher, Andrei Broder
- 2000
|
|
10
|
Using a queue to de-amortize cuckoo hashing in hardware
– A Kirsch, M Mitzenmacher
- 2007
|
|
12
|
More Robust Hashing: Cuckoo Hashing with a Stash
– Adam Kirsch, Michael Mitzenmacher, Udi Wieder
- 2008
|
|
13
|
Cuckoo hashing: Further analysis
– Luc Devroye, Pat Morin, Communicated F. Dehne
- 2003
|
|
13
|
Efficient hashing with lookups in two memory accesses, in: 16th
– Rina Panigrahy
|
|
5
|
Bipartite random graphs and cuckoo hashing
– R Kutzelnigg
- 2006
|
|
207
|
Storing a sparse table with O(1) worst case access time
– M Fredman, J Komlós, E Szemerédi
- 1984
|
|
12
|
The power of one move: Hashing schemes for hardware
– Adam Kirsch, Michael Mitzenmacher
- 2008
|
|
71
|
How Asymmetry Helps Load Balancing
– Berthold Vöcking
- 1999
|
|
590
|
Universal classes of hash functions
– J L Carter, M N Wegman
- 1979
|
|
39
|
Multilevel Adaptive Hashing
– A Broder, A Karlin
- 1990
|
|
10
|
The korientability thresholds for Gn,p
– D Fernholz, V Ramachandran
- 2007
|
|
47
|
The Bloomier Filter: An Efficient Data Structure for Static Support Lookup Tables
– Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ayellet Tal, Oh Boy
- 2004
|
|
15
|
Efficient minimal perfect hashing in nearly minimal space
– T Hagerup, T Tholey
- 2001
|
|
6
|
History-Independent Cuckoo Hashing
– Moni Naor, Gil Segev, Udi Wieder
|
