|
34
|
Space Efficient Hash Tables With Worst Case Constant Access Time
– Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul Spirakis
- 2003
|
|
123
|
Dynamic Perfect Hashing: Upper and Lower Bounds
– Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert E. Tarjan
- 1990
|
|
1185
|
Space/Time Trade-offs in Hash Coding with Allowable Errors
– Burton H. Bloom
- 1970
|
|
207
|
Storing a sparse table with O(1) worst case access time
– M Fredman, J Komlós, E Szemerédi
- 1984
|
|
15
|
Uniform Hashing in Constant Time and Linear Space
– Anna stlin, R Pagh
|
|
210
|
Balanced Allocations
– Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal
- 1994
|
|
18
|
On Universal Classes of Extremely Random Constant Time Hash Functions and Their Time-Space Tradeoff
– Alan Siegel
|
|
590
|
Universal classes of hash functions
– J L Carter, M N Wegman
- 1979
|
|
257
|
Network Applications of Bloom Filters: A Survey
– Andrei Broder, Michael Mitzenmacher
- 2002
|
|
15
|
Almost Random Graphs with Simple Hash Functions
– Martin Dietzfelbinger, Philipp Woelfel
- 2003
|
|
24
|
Balanced allocation and dictionaries with tightly packed constant size bins
– Martin Dietzfelbinger, et al.
- 2007
|
|
61
|
Using Multiple Hash Functions to Improve IP Lookups
– Michael Mitzenmacher, Andrei Broder
- 2000
|
|
123
|
Deep Packet Inspection Using Parallel Bloom Filters
– Sarang Dharmapurikar, Praveen Krishnamurthy, Todd Sproull, John Lockwood, Line Speeds
- 2004
|
|
39
|
On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications
– A Siegel
- 1989
|
|
17
|
The analysis of closed hashing under limited randomness (extended abstract
– J P Schmidt, A Siegel
- 1990
|
|
203
|
Probability and computing: Randomized algorithms and probabilistic analysis
– M Mitzenmacher, E Upfal
- 2005
|
|
194
|
Dynamo: amazon’s highly available key-value store
– Giuseppe DeCandia, Deniz Hastorun, Madan Jampani, Gunavardhan Kakulapati, Avinash Lakshman, Alex Pilchin, Swaminathan Sivasubramanian, Peter Vosshall, Werner Vogels
- 2007
|
|
13
|
Efficient hashing with lookups in two memory accesses, in: 16th
– Rina Panigrahy
|
|
71
|
How Asymmetry Helps Load Balancing
– Berthold Vöcking
- 1999
|
