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
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
REFERENCES 333<br />
[She78]<br />
ti<strong>on</strong>. ACM Journal <str<strong>on</strong>g>of</str<strong>on</strong>g> Experimental<br />
Algorithmics, 2:3:1–<br />
3:??, ???? 1997. ISSN 1084-<br />
6654.<br />
Sheil:1978:MST<br />
B. A. Sheil. Median split trees:<br />
a fast lookup technique for frequently<br />
occurr<strong>in</strong>g keys. Communicati<strong>on</strong>s<br />
<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, 21<br />
(11):947–958, November 1978.<br />
CODEN CACMA2. ISSN 0001-<br />
0782 (pr<strong>in</strong>t), 1557-7317 (electr<strong>on</strong>ic).<br />
Early work <strong>on</strong> m<strong>in</strong>imal<br />
perfect hash functi<strong>on</strong>s.<br />
Shekita:1991:HPF<br />
[She91] Eugene Shekita. High-performance<br />
implementati<strong>on</strong> techniques<br />
for next-generati<strong>on</strong><br />
database systems. Technical<br />
Report TR 1026, Computer Sciences<br />
Department, University<br />
<str<strong>on</strong>g>of</str<strong>on</strong>g> Wisc<strong>on</strong>s<strong>in</strong>–Madis<strong>on</strong>, May<br />
1991. ?? pp.<br />
Sher:2006:MDS<br />
[She06] David B. Sher. Motivat<strong>in</strong>g<br />
data structures with cach<strong>in</strong>g Internet<br />
stock data. SIGCSE<br />
Bullet<strong>in</strong> (ACM Special Interest<br />
Group <strong>on</strong> Computer Science<br />
Educati<strong>on</strong>), 38(3):344, September<br />
2006. CODEN SIGSD3.<br />
ISSN 0097-8418.<br />
Shmoys:2000:PAA<br />
[Shm00] David Editor Shmoys, editor.<br />
Proceed<strong>in</strong>gs <str<strong>on</strong>g>of</str<strong>on</strong>g> the 11th<br />
Annual ACM–SIAM Symposium<br />
<strong>on</strong> Discrete <strong>Algorithms</strong>,<br />
San Francisco, California, January<br />
9–11, 2000, volume<br />
101 <str<strong>on</strong>g>of</str<strong>on</strong>g> Proceed<strong>in</strong>gs <strong>in</strong> Applied<br />
Mathematics Ser. Society<br />
for Industrial and Applied<br />
Mathematics, Philadelphia,<br />
PA, USA, 2000. ISBN<br />
0-89871-453-2. LCCN QA76.6<br />
.A278 2000. URL http://<br />
encompass.library.cornell.<br />
edu/cgi-b<strong>in</strong>/checkIP.cgi?<br />
access=gateway\_standard\<br />
%26url=http://dl.acm.org/<br />
citati<strong>on</strong>.cfm?id=338219.<br />
Shoup:1996:FPS<br />
[Sho96] V. Shoup. On fast and provably<br />
secure message authenticati<strong>on</strong><br />
based <strong>on</strong> universal hash<strong>in</strong>g.<br />
Lecture Notes <strong>in</strong> CS,<br />
1109:313–??, ???? 1996. CO-<br />
DEN LNCSD9. ISSN 0302-9743<br />
(pr<strong>in</strong>t), 1611-3349 (electr<strong>on</strong>ic).<br />
Shoup:2000:CTU<br />
[Sho00a] Victor Shoup. A compositi<strong>on</strong><br />
theorem for universal <strong>on</strong>eway<br />
hash functi<strong>on</strong>s. Lecture<br />
Notes <strong>in</strong> CS, 1807:445–??,<br />
2000. CODEN LNCSD9. ISSN<br />
0302-9743 (pr<strong>in</strong>t), 1611-3349<br />
(electr<strong>on</strong>ic). URL http://<br />
l<strong>in</strong>k.spr<strong>in</strong>ger-ny.com/l<strong>in</strong>k/<br />
service/series/0558/bibs/<br />
[Sho00b]<br />
1807/18070445.htm; http:<br />
//l<strong>in</strong>k.spr<strong>in</strong>ger-ny.com/l<strong>in</strong>k/<br />
service/series/0558/papers/<br />
1807/18070445.pdf.<br />
Shoup:2000:UHF<br />
Victor Shoup. Us<strong>in</strong>g hash functi<strong>on</strong>s<br />
as a hedge aga<strong>in</strong>st chosen<br />
ciphertext attack. Lecture<br />
Notes <strong>in</strong> CS, 1807:275–??,<br />
2000. CODEN LNCSD9. ISSN
Change language