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 311<br />

Reviews: “This short communicati<strong>on</strong><br />

deals with a special k<strong>in</strong>d<br />

<str<strong>on</strong>g>of</str<strong>on</strong>g> hash functi<strong>on</strong> called ‘Bloom<br />

filters.’ These filters are used,<br />

for example, to search a differential<br />

file c<strong>on</strong>ta<strong>in</strong><strong>in</strong>g updates to<br />

a ma<strong>in</strong> file.”.<br />

Ramakrishna:1992:SPH<br />

[Ram92] M. V. Ramakrishna. A simple<br />

perfect hash<strong>in</strong>g method<br />

for static sets. In Koczkodaj<br />

et al. [KLT92], pages 401–<br />

404. ISBN 0-8186-2812-X<br />

(hardcover), 0-8186-2811-1 (micr<str<strong>on</strong>g>of</str<strong>on</strong>g>iche).<br />

LCCN QA75.5 .I587<br />

1992.<br />

Raman:1997:KFM<br />

[Ram97] Anand V. Raman. The Katapayadi<br />

formula and the modern<br />

hash<strong>in</strong>g technique. IEEE<br />

Annals <str<strong>on</strong>g>of</str<strong>on</strong>g> the History <str<strong>on</strong>g>of</str<strong>on</strong>g> Comput<strong>in</strong>g,<br />

19(4):49–52, 1997. CO-<br />

DEN IAHCEX. ISSN 1058-<br />

6180 (pr<strong>in</strong>t), 1934-1547 (electr<strong>on</strong>ic).<br />

Ramakrishna:1991:DPH<br />

[RB91] M. V. Ramakrishna and<br />

Y. Bannai. Direct perfect hash<strong>in</strong>g<br />

functi<strong>on</strong>s for external <strong>files</strong>.<br />

J. Database Adm., 2(1):19–29,<br />

1991. CODEN JDADEX. ISSN<br />

1047-9430.<br />

Rijmen:2001:WHF<br />

[RB01] V<strong>in</strong>cent Rijmen and Paulo<br />

S. L. M. Barreto. The<br />

WHIRLPOOL hash functi<strong>on</strong>.<br />

World-Wide Web document,<br />

2001. URL http://pag<strong>in</strong>as.<br />

terra.com.br/<strong>in</strong>formatica/<br />

paulobarreto/WhirlpoolPage.<br />

[RC94]<br />

[RCF11]<br />

html; http://planeta.terra.<br />

com.br/<strong>in</strong>formatica/paulobarreto/<br />

whirlpool.zip.<br />

Rigoutsos:1994:SPS<br />

Isidore Rigoutsos and Andrea<br />

Califano. Search<strong>in</strong>g <strong>in</strong> parallel<br />

for similar str<strong>in</strong>gs. IEEE Computati<strong>on</strong>al<br />

Science & Eng<strong>in</strong>eer<strong>in</strong>g,<br />

1(2):60–75, Summer 1994.<br />

CODEN ISCEE4. ISSN 1070-<br />

9924 (pr<strong>in</strong>t), 1558-190X (electr<strong>on</strong>ic).<br />

Rao:2011:STE<br />

Weixi<strong>on</strong>g Rao, Lei Chen, and<br />

Ada Wai-Chee Fu. STAIRS:<br />

Towards efficient full-text filter<strong>in</strong>g<br />

and dissem<strong>in</strong>ati<strong>on</strong> <strong>in</strong> DHT<br />

envir<strong>on</strong>ments. VLDB Journal:<br />

Very Large Data Bases, 20(6):<br />

793–817, December 2011. CO-<br />

DEN VLDBFR. ISSN 1066-<br />

8888 (pr<strong>in</strong>t), 0949-877X (electr<strong>on</strong>ic).<br />

Regnier:1981:AHT<br />

[Reg81] Mireille Regnier. On the average<br />

height <str<strong>on</strong>g>of</str<strong>on</strong>g> trees <strong>in</strong> digital<br />

search and dynamic hash<strong>in</strong>g.<br />

Informati<strong>on</strong> Process<strong>in</strong>g Letters,<br />

13(2):64–66, November 1981.<br />

CODEN IFPLAT. ISSN 0020-<br />

0190 (pr<strong>in</strong>t), 1872-6119 (electr<strong>on</strong>ic).<br />

[Reg82]<br />

Regnier:1982:LHG<br />

Mireille Regnier. L<strong>in</strong>ear hash<strong>in</strong>g<br />

with groups <str<strong>on</strong>g>of</str<strong>on</strong>g> reorganizati<strong>on</strong>:<br />

an algorithm for <strong>files</strong><br />

without history. In Scheuermann<br />

[Sch82a], pages 257–<br />

272. ISBN 0-12-624080-9.

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

Saved successfully!

Ooh no, something went wrong!