Java Reference
In-Depth Information
7.
G. Lueker and M. Molodowitch, “More Analysis of Double Hashing,”
Combinatorica
13
(1993), 83-96.
8.
W. D. Maurer and T. G. Lewis, “Hash Table Methods,”
Computing Sur-
veys
7
(1975), 5-20.
9.
B. J. McKenzie, R. Harries, and T. Bell, “Selecting a Hashing Algo-
rithm,”
Software-Practice and Experience
20
(1990), 209-224.
10.
R. Morris, “Scatter Storage Techniques,”
Communications of the ACM
11
(1968), 38-44.
W. W. Peterson, “Addressing for Random Access Storage,”
IBM Journal
of Research and Development
1
(1957), 130-146.
11.
J. S. Vitter, “Implementations for Coalesced Hashing,”
Information Pro-
cessing Letters
11
(1980), 84-86.
12.
A. C. Yao, “Uniform Hashing Is Optimal,”
Journal of the ACM
32
(1985), 687-693.
13.
Search WWH ::
Custom Search