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 143<br />
service/series/0558/papers/<br />
2161/21610109.pdf.<br />
Du:1983:SNP<br />
[DHJS83] M. W. Du, T. M. Hsieh, K. F.<br />
Jea, and D. W. Shieh. The<br />
study <str<strong>on</strong>g>of</str<strong>on</strong>g> a new perfect hash<br />
scheme. IEEE Transacti<strong>on</strong>s<br />
<strong>on</strong> S<str<strong>on</strong>g>of</str<strong>on</strong>g>tware Eng<strong>in</strong>eer<strong>in</strong>g, SE-9<br />
(3):305–313, May 1983. CO-<br />
DEN IESEDJ. ISSN 0098-5589<br />
(pr<strong>in</strong>t), 1939-3520 (electr<strong>on</strong>ic).<br />
[DHKP97]<br />
Dietzfelb<strong>in</strong>ger:1997:RRA<br />
Mart<strong>in</strong> Dietzfelb<strong>in</strong>ger, Torben<br />
Hagerup, Jyrki Kataja<strong>in</strong>en, and<br />
Martti Pentt<strong>on</strong>en. A reliable<br />
randomized algorithm for the<br />
closest-pair problem. Journal<br />
<str<strong>on</strong>g>of</str<strong>on</strong>g> <strong>Algorithms</strong>, 25(1):19–51,<br />
???? 1997. CODEN JOALDV.<br />
ISSN 0196-6774 (pr<strong>in</strong>t), 1090-<br />
2678 (electr<strong>on</strong>ic).<br />
Dolev:1994:NPH<br />
[DHL + 94] Danny Dolev, Yuval Harari,<br />
Nathan L<strong>in</strong>ial, Noam Nisan,<br />
and Michal Parnas. Neighborhood<br />
preserv<strong>in</strong>g hash<strong>in</strong>g and<br />
approximate queries. In ACM-<br />
SIAM-SDA’94 [ACM94d], pages<br />
73–85. ISBN 0-89871-329-3.<br />
LCCN QA76.6 .A278 1994.<br />
Dolev:2002:NPH<br />
[DHL + 02] Danny Dolev, Yuval Harari,<br />
Nathan L<strong>in</strong>ial, Noam Nisan,<br />
and Michal Parnas. Neighborhood<br />
preserv<strong>in</strong>g hash<strong>in</strong>g and<br />
approximate queries. SIAM<br />
Journal <strong>on</strong> Discrete Mathematics,<br />
15(1):73–85, 2002.<br />
CODEN SJDMEC. ISSN<br />
[DHW08]<br />
0895-4801 (pr<strong>in</strong>t), 1095-7146<br />
(electr<strong>on</strong>ic). URL http:<br />
//epubs.siam.org/sam-b<strong>in</strong>/<br />
dbq/article/31809.<br />
Dietzfelb<strong>in</strong>ger:2008:DIB<br />
Mart<strong>in</strong> Dietzfelb<strong>in</strong>ger, Mart<strong>in</strong><br />
Hühne, and Christoph Weidl<strong>in</strong>g.<br />
A dicti<strong>on</strong>ary implementati<strong>on</strong><br />
based <strong>on</strong> dynamic perfect<br />
hash<strong>in</strong>g. ACM Journal <str<strong>on</strong>g>of</str<strong>on</strong>g><br />
Experimental Algorithmics, 12:<br />
1.11:1–1.11:??, June 2008. CO-<br />
DEN ???? ISSN 1084-6654.<br />
Dietzfelb<strong>in</strong>ger:1990:HDD<br />
[Die90] Mart<strong>in</strong> Dietzfelb<strong>in</strong>ger. How<br />
to distribute a dicti<strong>on</strong>ary <strong>in</strong> a<br />
complete network. In Proceed<strong>in</strong>gs<br />
<str<strong>on</strong>g>of</str<strong>on</strong>g> the 22nd Annual ACM<br />
Symposium <strong>on</strong> Theory <str<strong>on</strong>g>of</str<strong>on</strong>g> Comput<strong>in</strong>g<br />
(May 14–16 1990: Baltimore,<br />
MD, USA), pages 117–<br />
127. ACM Press, New York, NY<br />
10036, USA, 1990. ISBN 0-<br />
89791-361-2. LCCN QA 76.6<br />
A13 1990.<br />
Dietzfelb<strong>in</strong>ger:1996:UHW<br />
[Die96] M. Dietzfelb<strong>in</strong>ger. Universal<br />
hash<strong>in</strong>g and k-wise <strong>in</strong>dependent<br />
random variables via <strong>in</strong>teger<br />
arithmetic without primes.<br />
Lecture Notes <strong>in</strong> CS, 1046:569–<br />
??, 1996. CODEN LNCSD9.<br />
ISSN 0302-9743 (pr<strong>in</strong>t), 1611-<br />
3349 (electr<strong>on</strong>ic).<br />
Dietzfelb<strong>in</strong>ger:2007:DSM<br />
[Die07] Mart<strong>in</strong> Dietzfelb<strong>in</strong>ger. Design<br />
strategies for m<strong>in</strong>imal perfect<br />
hash functi<strong>on</strong>s. In Hromkovič<br />
et al. [HKNW07], pages 2–17.
Change language