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 251<br />
[Lie81]<br />
Lien:1981:AIC<br />
Y. Edmund Lien, editor. ACM-<br />
SIGMOD 1981 Internati<strong>on</strong>al<br />
C<strong>on</strong>ference <strong>on</strong> Management <str<strong>on</strong>g>of</str<strong>on</strong>g><br />
Data: April 29–May 1, the University<br />
<str<strong>on</strong>g>of</str<strong>on</strong>g> Michigan, Ann Arbor,<br />
Michigan. ACM Press, New<br />
York, NY 10036, USA, 1981.<br />
ISBN 0-89791-040-0. LCCN<br />
QA76.9.D3 I59 1981.<br />
Luhandjula:1992:FSI<br />
[LII92] M. K. Luhandjula, H. Ichihashi,<br />
and M. Inuiguchi. Fuzzy<br />
and semite-<strong>in</strong>f<strong>in</strong>ite mathematical<br />
programm<strong>in</strong>g. Informati<strong>on</strong><br />
sciences, 61(3):233, 1992. CO-<br />
DEN ISIJBC. ISSN 0020-0255<br />
(pr<strong>in</strong>t), 1872-6291 (electr<strong>on</strong>ic).<br />
[L<strong>in</strong>53]<br />
L<strong>in</strong>:1953:xxx<br />
A. D. L<strong>in</strong>. ??? The year is uncerta<strong>in</strong><br />
(???). Extends [Luh53]<br />
with an alternative overflow<br />
handl<strong>in</strong>g technique us<strong>in</strong>g “degenerative<br />
addresses” [Knu73,<br />
p. 541]., 1953.<br />
L<strong>in</strong>:1963:KAR<br />
[L<strong>in</strong>63] A. D. L<strong>in</strong>. Key address<strong>in</strong>g<br />
<str<strong>on</strong>g>of</str<strong>on</strong>g> random access memories by<br />
radix transformati<strong>on</strong>. In AFIPS<br />
SJCC ’63 [AFI63], pages 355–<br />
366. LCCN TK7885.A1 J6<br />
1963.<br />
L<strong>in</strong>dner:1996:DSH<br />
[L<strong>in</strong>96] M. P. L<strong>in</strong>dner. Design<strong>in</strong>g for<br />
safe hash<strong>in</strong>g. implement<strong>in</strong>g efficient<br />
dynamic search structures.<br />
C++ Report, 8(10):36–<br />
41, November-December 1996.<br />
CODEN CRPTE7. ISSN 1040-<br />
6042.<br />
Lipmaa:2002:OHT<br />
[Lip02] Helger Lipmaa. On optimal<br />
hash tree traversal for <strong>in</strong>terval<br />
time-stamp<strong>in</strong>g. Lecture<br />
Notes <strong>in</strong> CS, 2433:357–??,<br />
2002. 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 />
2433/24330357.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 />
2433/24330357.pdf.<br />
Liskov:2007:CIH<br />
[Lis07] Moses Liskov. C<strong>on</strong>struct<strong>in</strong>g<br />
an ideal hash functi<strong>on</strong> from<br />
weak ideal compressi<strong>on</strong> functi<strong>on</strong>s.<br />
Lecture Notes <strong>in</strong> CS,<br />
4356:358–375, 2007. CO-<br />
DEN LNCSD9. ISSN 0302-<br />
9743 (pr<strong>in</strong>t), 1611-3349 (electr<strong>on</strong>ic).<br />
URL http://l<strong>in</strong>k.<br />
spr<strong>in</strong>ger.com/c<strong>on</strong>tent/pdf/<br />
10.1007/978-3-540-74462-7_<br />
25.<br />
[Lit77a]<br />
Litw<strong>in</strong>:1977:ASD<br />
W. Litw<strong>in</strong>. Auto-structurati<strong>on</strong><br />
du fichier: Methodologie, organisati<strong>on</strong><br />
d’acces, extensi<strong>on</strong> du<br />
hash-coder<strong>in</strong>g. Technical report,<br />
????, Paris, France, 1977.<br />
?? pp.<br />
Litw<strong>in</strong>:1977:MDP<br />
[Lit77b] Witold Litw<strong>in</strong>. Méthodes<br />
d’acces par hash-cod<strong>in</strong>g virtuel<br />
(VHAM): Modelisati<strong>on</strong>, applicati<strong>on</strong><br />
àlagesti<strong>on</strong>deMémoires.
Change language