A Bibliography of Publications on Hashing Algorithms - Index of files in
A Bibliography of Publications on Hashing Algorithms - Index of files in
A Bibliography of Publications on Hashing Algorithms - Index of files in
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
REFERENCES 100<br />
[Bob75]<br />
[Bol79]<br />
Bobrow:1975:NHL<br />
Daniel G. Bobrow. A note <strong>on</strong><br />
hash l<strong>in</strong>k<strong>in</strong>g. Communicati<strong>on</strong>s<br />
<str<strong>on</strong>g>of</str<strong>on</strong>g> the Associati<strong>on</strong> for Comput<strong>in</strong>g<br />
Mach<strong>in</strong>ery, 18(7):413–415,<br />
July 1975. CODEN CACMA2.<br />
ISSN 0001-0782 (pr<strong>in</strong>t), 1557-<br />
7317 (electr<strong>on</strong>ic).<br />
Bolour:1979:OPM<br />
Azad Bolour. Optimality properties<br />
<str<strong>on</strong>g>of</str<strong>on</strong>g> multiple-key hash<strong>in</strong>g<br />
functi<strong>on</strong>s. Journal <str<strong>on</strong>g>of</str<strong>on</strong>g> the Associati<strong>on</strong><br />
for Comput<strong>in</strong>g Mach<strong>in</strong>ery,<br />
26(2):196–210, April 1979.<br />
CODEN JACOAH. ISSN 0004-<br />
5411 (pr<strong>in</strong>t), 1557-735X (electr<strong>on</strong>ic).<br />
Bookste<strong>in</strong>:1973:HST<br />
[Boo73] Abraham Bookste<strong>in</strong>. On Harris<strong>on</strong>’s<br />
substr<strong>in</strong>g test<strong>in</strong>g technique.<br />
Communicati<strong>on</strong>s <str<strong>on</strong>g>of</str<strong>on</strong>g> the<br />
Associati<strong>on</strong> for Comput<strong>in</strong>g Mach<strong>in</strong>ery,<br />
16(3):180–181, March<br />
1973. CODEN CACMA2. ISSN<br />
0001-0782 (pr<strong>in</strong>t), 1557-7317<br />
(electr<strong>on</strong>ic).<br />
[Boo74]<br />
[Bor81]<br />
Bookste<strong>in</strong>:1974:HCN<br />
Abraham Bookste<strong>in</strong>. Hash cod<strong>in</strong>g<br />
with a n<strong>on</strong>-unique search<br />
key. Journal <str<strong>on</strong>g>of</str<strong>on</strong>g> the American<br />
Society for Informati<strong>on</strong><br />
Science, 25(4):232–236, July–<br />
August 1974. CODEN AISJB6.<br />
ISSN 0002-8231 (pr<strong>in</strong>t), 1097-<br />
4571 (electr<strong>on</strong>ic).<br />
Borman:1981:PSP<br />
Lorra<strong>in</strong>e Borman, editor. Proceed<strong>in</strong>gs:<br />
selected papers from<br />
the C<strong>on</strong>ference <strong>on</strong> Easier and<br />
More Productive Use <str<strong>on</strong>g>of</str<strong>on</strong>g> Computer<br />
Systems, May 20–22,<br />
1981, Ann Arbor, Michigan.<br />
Part 2. Human <strong>in</strong>teracti<strong>on</strong><br />
and the user <strong>in</strong>terface, volume<br />
12(4), 13(1–3) <str<strong>on</strong>g>of</str<strong>on</strong>g> SIGSOC Bullet<strong>in</strong>.<br />
ACM Press, New York,<br />
NY 10036, USA, 1981. CODEN<br />
SGBLDB. ISBN 0-89791-056-7<br />
(pt. 1), 0-89791-064-8 (pt. 2).<br />
ISSN 0163-5794. LCCN H61<br />
.S53 v.12 no.4-v.13 no.1-3.<br />
Borgwardt:1984:PPU<br />
[Bor84] P. Borgwardt. Parallel Prolog<br />
us<strong>in</strong>g stack segments <strong>on</strong><br />
shared-memory multiprocessors.<br />
In IEEE-ISLP’84 [IEE84],<br />
page ?? ISBN 0-8186-<br />
0522-7 (paperback), 0-8186-<br />
8522-0 (hardcover), 0-8186-<br />
4522-9 (micr<str<strong>on</strong>g>of</str<strong>on</strong>g>iche). LCCN<br />
QA76.6 .I5735 1984. CH2007-<br />
3/84/0002$01.00.<br />
Bosselaers:19xx:EFH<br />
[Bosxx] A. Bosselaers. Even faster<br />
hash<strong>in</strong>g <strong>on</strong> the Pentium. In<br />
????, page ???? ????, ????,<br />
19xx. URL ftp://ftp.esat.<br />
kuleuven.ac.be/pub/COSIC/<br />
bosselae/pentiumplus.ps.<br />
gz. Presented at the rump sessi<strong>on</strong><br />
<str<strong>on</strong>g>of</str<strong>on</strong>g> Eurocrypt’97, K<strong>on</strong>stanz,<br />
Germany, May 12-15, 1997, and<br />
updated <strong>on</strong> November 13, 1997.<br />
Bos:2011:EHU<br />
[BÖS11] Joppe W. Bos, Onur Özen,<br />
and Martijn Stam. Efficient<br />
hash<strong>in</strong>g us<strong>in</strong>g the AES <strong>in</strong>structi<strong>on</strong><br />
set. Lecture Notes <strong>in</strong>