The use of quadratic residue research
Communications of the ACM
The quadratic quotient method: a hash code eliminating secondary clustering
Communications of the ACM
Communications of the ACM
Programming Technique: An improved hash code for scatter storage
Communications of the ACM
Communications of the ACM
An indirect chaining method for addressing on secondary keys
Communications of the ACM
Implementation aids for optimization algorithms that solve sequences of linear programs
ACM Transactions on Mathematical Software (TOMS)
A Kernel for High-Performance Multicast Communications
IEEE Transactions on Computers
The cost distribution of clustering in random probing
Journal of the ACM (JACM)
A compendium of key search references
ACM SIGIR Forum
Optimal Arrangement of Keys in a Hash Table
Journal of the ACM (JACM)
Expected Length of the Longest Probe Sequence in Hash Code Searching
Journal of the ACM (JACM)
Techniques for collision resolution in hash tables with open addressing
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
ACM Computing Surveys (CSUR)
Communications of the ACM
Communications of the ACM
Comment on Brent's scatter storage algorithm
Communications of the ACM
Anti-presistence: history independent data structures
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
MPACT: microprocessor application to control-firmware translator
ACM SIGDA Newsletter
Space Efficient Hash Tables with Worst Case Constant Access Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
The analysis of an improved hashing technique
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The analysis of double hashing(Extended Abstract)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Minimizing the retrieval time of scatter storage techniques
ACM '78 Proceedings of the 1978 annual conference - Volume 2
On the implementation of parsing tables
ACM SIGPLAN Notices
Journal of Algorithms
Exact distribution of individual displacements in linear probing hashing
ACM Transactions on Algorithms (TALG)
Variable-length hash area entries
AFIPS '77 Proceedings of the June 13-16, 1977, national computer conference
An introduction to computed chaining
AFIPS '80 Proceedings of the May 19-22, 1980, national computer conference
Fast and compact hash tables for integer keys
ACSC '09 Proceedings of the Thirty-Second Australasian Conference on Computer Science - Volume 91
Algorithms and theory of computation handbook
| Hi-index | 48.27 |
A new method for entering and retrieving information in a hash table is described. The method is intended to be efficient if most entries are looked up several times. The expected number of probes to look up an entry, predicted theoretically and verified by Monte Carlo experiments, is considerably less than for other comparable methods if the table is nearly full. An example of a possible Fortran implementation is given.