A Bibliography of Publications on Hashing Algorithms - Index of files in

REFERENCES 216
N are considered. Though the
existence <strong>of</strong> h is guaranteed, the
scheme suffers from many practical
problems because <strong>of</strong> exhaustive
nature <strong>of</strong> the search for
h.
Jagannathan:1991:OPM
[Jag91] Raj Jagannathan. Optimal
partial-match hashing design.
ORSA Journal on Computing,
3(2):86–??, Spring 1991. CO-
DEN OJCOE3. ISSN 0899-
1499.
Jain:1989:CHS
[Jai89] Raj Jain. A comparison <strong>of</strong>
hashing schemes for address
lookup in computer networks.
Technical Report DEC-TR-593,
Digital Equipment Corporation,
February 1989. ?? pp.
Jain:1992:CHSa
[Jai92a] R. Jain. A comparison <strong>of</strong>
hashing schemes for address
lookup in computer networks.
Technical report, DEC, 1992.
17 pp. URL http://www.
cis.ohio-state.edu/~jain/
papers/hash_ps.htm.
Jain:1992:CHSb
Jain:19xx:CHS
[Jaixx] Raj Jain. A comparison <strong>of</strong>
hashing schemes for address
lookup in computer networks.
Technical Report DEC-TR-566,
Digital Equipment Corporation,
19xx. ?? pp. URL jain%
erlang.dec@decwrl.dec.com.
Jaja:1990:SFM
[Jáj90] Joseph Jájá, editor. The 3rd
Symposium on the Frontiers
<strong>of</strong> Massively Parallel Computation:
Proceedings, Held at the
University <strong>of</strong> Maryland, College
Park, Maryland, October 8–10,
1990. IEEE Computer Society
Press, 1109 Spring Street, Suite
300, Silver Spring, MD 20910,
USA, 1990. ISBN 0-8186-9053-
4. LCCN QA76.58 .S95 1990.
Jakobsson:1985:SRL
[Jak85] Matti Jakobsson. Sampling
without replacement in linear
time. The Computer Journal,
28(4):412–413, August 1985.
CODEN CMPJA6. ISSN 0010-
4620 (print), 1460-2067 (electronic).
[Jai92b]
R. Jain. A comparison <strong>of</strong> hashing
schemes for address lookup
in computer networks. IEEE
Trans. Comm., 40(10):1570–
1573, October 1, 1992. CO-
DEN IECMBT. ISSN 0090-
6778 (print), 1558-0857 (electronic).
URL http://www.
cis.ohio-state.edu/~jain/
papers/hash_ieee_2col.htm.
[Jan05]
Janson:2005:IDL
Svante Janson. Individual displacements
for linear probing
hashing with different insertion
policies. ACM Transactions
on Algorithms, 1(2):177–
213, October 2005. CODEN
???? ISSN 1549-6325 (print),
1549-6333 (electronic).