Optimal arrangement of keys in a hash table (1978)

by Ronald L. Rivest
Venue:J. Assoc. Comput. Mach
Citations:3 - 0 self

Documents Related by Co-Citation

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
16 Flemming Friche Rodler. Cuckoo hashing – Rasmus Pagh - 2001
63 Membership in constant time and almost-minimum space – A BRODNIK, J MUNRO - 1999
16 Reducing the retrieval time of scatter storage techniques – R P Brent - 1973
47 Multilevel Adaptive Hashing – A Broder, A Karlin - 1990
27 Polynomial hash functions are reliable (extended abstract – M Dietzfelbinger, J Gil, Y Matias, N Pippenger
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
16 Reconciling Simplicity and Realism in Parallel Disk Models – Peter Sanders - 2001
17 Uniform hashing in constant time and linear space – Anna Pagh, Rasmus Pagh
8 Simple minimal perfect hashing in less space – M Dietzfelbinger, T Hagerup - 2001
24 Balls and Bins: A Study in Negative Dependence – Devdatt Dubhashi, Desh Ranjan - 1996