|
86
|
Cuckoo hashing
– Rasmus Pagh, Flemming Friche Rodler
- 2001
|
|
12
|
The power of one move: Hashing schemes for hardware
– Adam Kirsch, Michael Mitzenmacher
- 2008
|
|
10
|
Using a queue to de-amortize cuckoo hashing in hardware
– A Kirsch, M Mitzenmacher
- 2007
|
|
24
|
Balanced allocation and dictionaries with tightly packed constant size bins
– Martin Dietzfelbinger, et al.
- 2007
|
|
71
|
How Asymmetry Helps Load Balancing
– Berthold Vöcking
- 1999
|
|
34
|
Space Efficient Hash Tables With Worst Case Constant Access Time
– Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul Spirakis
- 2003
|
|
27
|
Why simple hash functions work: Exploiting the entropy in a data stream
– Michael Mitzenmacher, Salil Vadhan
- 2008
|
|
1185
|
Space/Time Trade-offs in Hash Coding with Allowable Errors
– Burton H. Bloom
- 1970
|
|
61
|
Using Multiple Hash Functions to Improve IP Lookups
– Michael Mitzenmacher, Andrei Broder
- 2000
|
|
5
|
Bipartite random graphs and cuckoo hashing
– R Kutzelnigg
- 2006
|
|
7
|
Hash-Based Techniques for High-Speed Packet Processing
– Adam Kirsch, Michael Mitzenmacher, George Varghese
|
|
210
|
Balanced Allocations
– Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal
- 1994
|
|
4
|
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
– Yuriy Arbitman, Moni Naor, Gil Segev
|
|
70
|
Expected length of the longest probe sequence in hash code searching
– G H Gonnet
- 1981
|
|
257
|
Network Applications of Bloom Filters: A Survey
– Andrei Broder, Michael Mitzenmacher
- 2002
|
|
13
|
Efficient hashing with lookups in two memory accesses, in: 16th
– Rina Panigrahy
|
|
79
|
The Power of Two Random Choices: A Survey of Techniques and Results
– Michael Mitzenmacher, Andréa W. Richa, Ramesh Sitaraman
- 2000
|
|
13
|
Cuckoo hashing: Further analysis
– Luc Devroye, Pat Morin, Communicated F. Dehne
- 2003
|
|
39
|
Multilevel Adaptive Hashing
– A Broder, A Karlin
- 1990
|
