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

REFERENCES 372
in CS, 2010:563–??, 2001.
CODEN LNCSD9. ISSN
0302-9743 (print), 1611-3349
(electronic). URL http://
link.springer-ny.com/link/
service/series/0558/bibs/
2010/20100563.htm; http:
//link.springer-ny.com/link/
service/series/0558/papers/
2010/20100563.pdf.
Woelfel:2006:CMO
[Woe06a] Philipp Woelfel. A construction
method for optimally universal
hash families and its
consequences for the existence
<strong>of</strong> RBIBDs. Theoret. Comput.
Sci., 363(1):76–84, October
25, 2006. CODEN TC-
SCDI. ISSN 0304-3975 (print),
1879-2294 (electronic).
Woelfel:2006:MEM
[Woe06b] Philipp Woelfel. Maintaining
external memory efficient
hash tables. In Díaz et al.
[DJRZ06], pages 508–519. CO-
DEN LNCSD9. ISBN 3-540-
38044-2 (paperback). ISSN
0302-9743 (print), 1611-3349
(electronic). LCCN QA75.5
.I643 2006. URL http://www.
springerlink.com/content/
w40104p9224657rk/.
Wogulis:1989:SAS
[Wog89] James Wogulis. Self-adjusting
and split sequence hash tables.
Information Processing
Letters, 30(4):185–188, February
27, 1989. CODEN IFPLAT.
ISSN 0020-0190 (print), 1872-
6119 (electronic).
Wolverton:1984:PHF
[Wol84] David Alan Wolverton. A
perfect hash function for
Ada reserved words. ACM
SIGADA Ada Letters, 4(1):40–
[Wol93]
[Woo89]
44, July/August 1984. CODEN
AALEE5. ISSN 0736-721X.
Wolfowicz:1993:SPR
W. Wolfowicz, editor. State and
progress <strong>of</strong> research in cryptography:
3rd Symposium —
February 1993, Rome, PRO-
CEEDINGS OF THE SYM-
POSIUM ON STATE AND
PROGRESS OF RESEARCH
IN CRYPTOGRAPHY 1993;
3rd. [], Rome; Fondazione Ugo
Bordoni, 1993.
Wood:1989:PQP
D. Wood. Parallel queues and
pools, an evaluation. Master’s
thesis, Courant Institute, New
York University, New York,
NY, USA, January 1989. ??
pp. Revised version available
as NYU Ultracomputer Note
#150.
Weng:2010:IHV
[WP10] Li Weng and Bart Preneel.
From image hashing to video
hashing. Lecture Notes in
CS, 5916:662–668, 2010. CO-
DEN LNCSD9. ISSN 0302-
9743 (print), 1611-3349 (electronic).
URL http://link.
springer.com/content/pdf/
10.1007/978-3-642-11301-7_
66.