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

REFERENCES 307
SEO. ISSN 1045-9219 (print),
1558-2183 (electronic).
Patrascu:2012:PST
[PT12a] Mihai Pătrascu and Mikkel
Thorup. The power <strong>of</strong> simple
tabulation hashing. Journal
<strong>of</strong> the Association for Computing
Machinery, 59(3):14:1–
14:??, June 2012. CODEN
JACOAH. ISSN 0004-5411
(print), 1557-735X (electronic).
Pong:2012:CLT
[PT12b] Fong Pong and Nian-Feng
Tzeng. Concise lookup tables
for IPv4 and IPv6 longest
prefix matching in scalable
routers. IEEE/ACM Transactions
on Networking, 20(3):
729–741, June 2012. CO-
DEN IEANEP. ISSN 1063-6692
(print), 1558-2566 (electronic).
[PV85]
[PV92]
Pirotte:1985:VLD
A. Pirotte and Y. Vassiliou,
editors. Very Large Data
Bases: Stockholm, 1985/11th
International Conference on
Very Large Data Bases, Stockholm,
August 21–23, 1985.
Morgan Kaufmann Publishers,
San Francisco, CA, 1985. ISBN
0-934613-17-6. LCCN QA 76.9
D3 I61 1985.
Panti:1992:MOH
Maurizio Panti and Salvatore
Valenti. A modulus oriented
hash function for the construction
<strong>of</strong> minimal perfect tables.
SIGPLAN Notices, 27(11):33–
38, November 1992. CO-
DEN SINODQ. ISSN 0362-
1340 (print), 1523-2867 (print),
1558-1160 (electronic).
Preneel:1995:MBF
[PV95] B. Preneel and P. C. Van
Oorschot. MDx-MAC and
building fast MACs from
hash functions. In Coppersmith
[Cop95a], pages 1–14.
ISBN 3-540-60221-6. LCCN
QA76.9.A25 C79 1995.
[PV07]
[PVM94]
[PVM97]
Pasini:2007:HSW
Sylvain Pasini and Serge Vaudenay.
Hash-and-sign with
weak hashing made secure. Lecture
Notes in CS, 4586:338–
354, 2007. CODEN LNCSD9.
ISSN 0302-9743 (print), 1611-
3349 (electronic). URL
http://link.springer.com/
content/pdf/10.1007/978-3-
540-73458-1_25.
Poblete:1994:AHS
P. V. Poblete, A. Viola, and
J. I. Munro. The analysis <strong>of</strong>
a hashing scheme by the diagonal
Poisson transform. Lecture
Notes in CS, 855:94–??, 1994.
CODEN LNCSD9. ISSN 0302-
9743 (print), 1611-3349 (electronic).
Poblete:1997:ALL
Patricio V. Poblete, Alfredo Viola,
and J. Ian Munro. Analyzing
the LCFS linear probing
hashing algorithm with the
help <strong>of</strong> maple. Maple Technical
Newsletter, 4(1):8–13, Winter
1997. ISSN 1061-5733.