|
13
|
Linear probing with constant independence
– Anna Pagh, Rasmus Pagh
- 2007
|
|
18
|
On Universal Classes of Extremely Random Constant Time Hash Functions and Their Time-Space Tradeoff
– Alan Siegel
|
|
41
|
Tabulation based 4-universal hashing with applications to second moment estimation
– M Thorup, Y Zhang
- 2004
|
|
55
|
A reliable randomized algorithm for the closest-pair problem
– M Dietzfelbinger, T Hagerup, J Katajainen, M Penttonen
- 1993
|
|
4
|
Notes On "Open" Addressing
– Don Knuth
- 1963
|
|
2
|
On the k-independence required by linear probing and minwise independence
– Mikkel Thorup
- 2010
|
|
590
|
Universal classes of hash functions
– J L Carter, M N Wegman
- 1979
|
|
284
|
New Hash Functions and their Use in Authentication and Set Equality
– M N Wegman, J L Carter
- 1981
|
|
7
|
How caching affects hashing
– G L AND LUO HEILEMAN, W
|
|
12
|
strongly universal hashing is pretty fast
– Even
- 2000
|
|
2
|
On risks of using cuckoo hashing with simple universal hash classes
– Martin Dietzfelbinger, Ulf Schellbach
- 2009
|
|
2
|
Tabulation Based 5-Universal Hashing and Linear Probing
– Mikkel Thorup, Yin Zhang
|
|
1
|
AMS without 4-wise independence on product domains
– M Kane
- 2010
|
|
22
|
Randomized algorithms and pseudorandom numbers
– H Karloff, P Raghavan
- 1993
|
|
35
|
Universal hashing and k-wise independent random variables via integer arithmetic without primes
– M Dietzfelbinger
- 1996
|
|
13
|
Even strongly universal hashing is pretty fast
– M Thorup
- 2000
|
|
5
|
Notes on “open” addressing. Unpublished memorandum
– D E Knuth
- 1963
|
|
15
|
Almost Random Graphs with Simple Hash Functions
– Martin Dietzfelbinger, Philipp Woelfel
- 2003
|
|
3
|
An extension of Bernoulli’s inequality
– L Gerber
- 1968
|
