|
5
|
Efficient ordering of hash tables
– G H Gonnet, J I Munro
- 1979
|
|
3
|
Fast lookup in hash tables with direct rehashing
– J A T Maddison
- 1980
|
|
3
|
Scatter storage techniques: a uniform viewpoint and a method for reducing retrieval times
– E G Mallach
- 1977
|
|
10
|
Flemming Friche Rodler. Cuckoo hashing
– Rasmus Pagh
- 2001
|
|
39
|
Multilevel Adaptive Hashing
– A Broder, A Karlin
- 1990
|
|
25
|
Polynomial hash functions are reliable (extended abstract
– M Dietzfelbinger, J Gil, Y Matias, N Pippenger
|
|
15
|
Reducing the retrieval time of scatter storage techniques
– R P Brent
- 1973
|
|
61
|
Membership in constant time and almost-minimum space
– A Brodnik, J I Munro
- 1999
|
|
1
|
D The Destgn and Analysis of Computer Algornhms
– A V AHO, J E HOPCROFT, J ULLMAN
- 1974
|
|
1
|
Multidimensional search problems SIAM J Comput 5
– C Graphs BERGE, Hypergraphs North-Holland, Amsterdam
- 1973
|
|
1
|
628 ANDREW CHI-CHIH YAO 9 KNUTH, D E The Art of Computer Programming, Vol 3 Sorting and Searching
– DE TheArtofComputerProgrammmg KNUTH, Vol
- 1968
|
|
1
|
Geometric complexity Proc 7th Ann ACM Symp. on Theory of Computmg
– M l SHAMOS
- 1975
|
|
2
|
Uniform hashing is
– Andrew C-C Yao
- 1985
|
|
1
|
Dynamic dictionaries and trees in near-minimum space
– R Raman, S Srinivasa Rao
- 2002
|
|
10
|
Uniform hashing is optimal
– A C-C Yao
- 1985
|
|
12
|
Asynchronous scheduling of redundant disk arrays
– Peter Sanders
- 2000
|
|
16
|
Reconciling Simplicity and Realism in Parallel Disk Models
– Peter Sanders
- 2001
|
|
7
|
Simple minimal perfect hashing in less space
– M Dietzfelbinger, T Hagerup
|
|
15
|
Uniform Hashing in Constant Time and Linear Space
– Anna stlin, R Pagh
|
