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

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

REFERENCES 158<br />

[Eug90]<br />

[EVF06]<br />

ISSN 0002-3264. Rediscovery<br />

and first publicati<strong>on</strong> <str<strong>on</strong>g>of</str<strong>on</strong>g> l<strong>in</strong>ear<br />

open address<strong>in</strong>g. See [ABRS53,<br />

Dum56]. English translati<strong>on</strong> <strong>in</strong><br />

[Ers58a].<br />

Eugenides:1990:ESM<br />

J. G. Eugenides. Easier str<strong>in</strong>gs<br />

for the Mac. Get a handle <strong>on</strong><br />

Mac str<strong>in</strong>gs with this C++<br />

class. Byte Magaz<strong>in</strong>e, 15(13):<br />

349–350, 352, December 1990.<br />

CODEN BYTEDJ. ISSN 0360-<br />

5280 (pr<strong>in</strong>t), 1082-7838 (electr<strong>on</strong>ic).<br />

Estan:2006:BAC<br />

Cristian Estan, George Varghese,<br />

and Michael Fisk. Bitmap<br />

algorithms for count<strong>in</strong>g active<br />

flows <strong>on</strong> high-speed l<strong>in</strong>ks.<br />

IEEE/ACM Transacti<strong>on</strong>s <strong>on</strong><br />

Network<strong>in</strong>g, 14(5):925–937, October<br />

2006. CODEN IEANEP.<br />

ISSN 1063-6692 (pr<strong>in</strong>t), 1558-<br />

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

Fotakis:2003:SEH<br />

[F + 03] D. Fotakis et al. Space efficient<br />

hash tables with worst case c<strong>on</strong>stant<br />

access time. In Alt and<br />

Habib [AH03], pages 271–283.<br />

CODEN LNCSD9. ISBN 3-<br />

540-00623-0 (s<str<strong>on</strong>g>of</str<strong>on</strong>g>tcover). ISSN<br />

0302-9743 (pr<strong>in</strong>t), 1611-3349<br />

(electr<strong>on</strong>ic). LCCN QA75.5<br />

.S956 2003. URL http://<br />

l<strong>in</strong>k.spr<strong>in</strong>ger-ny.com/l<strong>in</strong>k/<br />

service/series/0558/tocs/<br />

t2607.htm; http://www.<br />

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

asp?genre=issue&issn=0302-<br />

9743&volume=2607. Also available<br />

via the World Wide Web.<br />

Fabry:1974:CBA<br />

[Fab74] Robert S. Fabry. Capabilitybased<br />

address<strong>in</strong>g. Communicati<strong>on</strong>s<br />

<str<strong>on</strong>g>of</str<strong>on</strong>g> the Associati<strong>on</strong> for<br />

Comput<strong>in</strong>g Mach<strong>in</strong>ery, 17(7):<br />

403–412, July 1974. CODEN<br />

CACMA2. ISSN 0001-0782<br />

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

Fahlman:1980:HIS<br />

[Fah80] S. E. Fahlman. The hashnet<br />

<strong>in</strong>terc<strong>on</strong>necti<strong>on</strong> scheme. Technical<br />

Report CMU-CS-80-125,<br />

Department <str<strong>on</strong>g>of</str<strong>on</strong>g> Computer Science,<br />

Carnegie Mell<strong>on</strong> University,<br />

Pittsburgh, PA, 1980. ??<br />

pp.<br />

Faloutsos:1985:MHU<br />

[Fal85a] C. Faloutsos. Multiattribute<br />

hash<strong>in</strong>g us<strong>in</strong>g gray codes.<br />

ACM Comput<strong>in</strong>g Surveys, 17<br />

(1):??, March 1985. CODEN<br />

CMSVAN. ISSN 0360-0300<br />

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

Also published <strong>in</strong>/as: ACM<br />

SIGMOD, 1986.<br />

Faloutsos:1985:AMT<br />

[Fal85b] Christos Faloutsos. Access<br />

methods for text. ACM<br />

Comput<strong>in</strong>g Surveys, 17(1):49–<br />

74, March 1985. CODEN<br />

CMSVAN. ISSN 0360-0300<br />

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

Also published <strong>in</strong>/as: “Multiattribute<br />

<strong>Hash<strong>in</strong>g</strong> Us<strong>in</strong>g Gray<br />

Codes”, ACM SIGMOD, 1986.

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

Saved successfully!

Ooh no, something went wrong!