15.02.2014 Views

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

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

REFERENCES 186<br />

[GS78]<br />

Guibas:1978:ADH<br />

L. J. Guibas and E. Szemerédi.<br />

The analysis <str<strong>on</strong>g>of</str<strong>on</strong>g> double hash<strong>in</strong>g.<br />

Journal <str<strong>on</strong>g>of</str<strong>on</strong>g> Computer and System<br />

Sciences, 16(2):226–274,<br />

April 1978. CODEN JCSSBM.<br />

ISSN 0022-0000 (pr<strong>in</strong>t), 1090-<br />

2724 (electr<strong>on</strong>ic).<br />

Gori:1989:AAC<br />

[GS89] M. Gori and G. Soda. An<br />

algebraic approach to Cichelli’s<br />

perfect hash<strong>in</strong>g. BIT<br />

(Nordisk tidskrift for <strong>in</strong>formati<strong>on</strong>sbehandl<strong>in</strong>g),<br />

29(1):2–13,<br />

March 1989. CODEN BIT-<br />

TEL, NBITAB. ISSN 0006-<br />

3835 (pr<strong>in</strong>t), 1572-9125 (electr<strong>on</strong>ic).<br />

URL http://www.<br />

spr<strong>in</strong>gerl<strong>in</strong>k.com/openurl.<br />

asp?genre=article&issn=0006-<br />

3835&volume=29&issue=1&spage=<br />

2.<br />

[GS94]<br />

[GSB94]<br />

Girault:1994:LCH<br />

M. Girault and J. Stern. On the<br />

length <str<strong>on</strong>g>of</str<strong>on</strong>g> cryptographic hashvalues<br />

used <strong>in</strong> identificati<strong>on</strong><br />

schemes. Lecture Notes <strong>in</strong><br />

CS, 839:202–215, 1994. CO-<br />

DEN LNCSD9. ISSN 0302-9743<br />

(pr<strong>in</strong>t), 1611-3349 (electr<strong>on</strong>ic).<br />

Goi:2001:IHF<br />

[GSC01] B.-M. Goi, M. U. Siddiqi,<br />

and H.-T. Chuah. Incremental<br />

hash functi<strong>on</strong> based<br />

<strong>on</strong> pair cha<strong>in</strong><strong>in</strong>g & modular<br />

arithmetic comb<strong>in</strong><strong>in</strong>g. Lecture<br />

Notes <strong>in</strong> CS, 2247:50–??,<br />

2001. 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 />

2247/22470050.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 />

2247/22470050.pdf.<br />

Goto:1982:DLM<br />

[GSI + 82] E. Goto, T. Soma, N. Inada,<br />

M. Idesawa, K. Hiraki,<br />

M. Suzuki, K. Shimizu, and<br />

B. Philipov. Design <str<strong>on</strong>g>of</str<strong>on</strong>g> a<br />

Lisp mach<strong>in</strong>e – FLATS. In<br />

LFP82 [LFP82], pages 208–<br />

215. ISBN 0-89791-082-6.<br />

LCCN QA76.73.L23 A26 1982.<br />

US$26.00. The papers were not<br />

formally refereed but were accepted<br />

<strong>on</strong> the bases <str<strong>on</strong>g>of</str<strong>on</strong>g> extended<br />

abstracts.<br />

Galli:2001:THO<br />

[GSS01] N. Galli, B. Seybold, and K. Sim<strong>on</strong>.<br />

Gupta:1994:RSD<br />

Tetris-hash<strong>in</strong>g or opti-<br />

mal table compressi<strong>on</strong>. Discrete<br />

Rajiv Gupta, Scott A. Smolka,<br />

Applied Mathematics, 110<br />

and Shaji Bhaskar. On randomizati<strong>on</strong><br />

<strong>in</strong> sequential and<br />

DEN DAMADU. ISSN 0166-<br />

(1):41–58, June 1, 2001. COdistributed<br />

algorithms. ACM<br />

218X (pr<strong>in</strong>t), 1872-6771 (electr<strong>on</strong>ic).<br />

Comput<strong>in</strong>g Surveys, 26(1):7–<br />

86, March 1994. CODEN<br />

CMSVAN. ISSN 0360-0300<br />

Ganguly:1990:FPP<br />

(pr<strong>in</strong>t), 1557-7341 (electr<strong>on</strong>ic). [GST90] Sumit Ganguly, Avi Silber-

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!