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

March 11, 1996. CODEN TC-<br />

SCDI. ISSN 0304-3975 (pr<strong>in</strong>t),<br />

1879-2294 (electr<strong>on</strong>ic).<br />

Kennedy:1973:RSU<br />

[Ken73] Ken Kennedy. Reducti<strong>on</strong> <strong>in</strong><br />

strength us<strong>in</strong>g hashed temporaries.<br />

Technical Report SETL<br />

Newsletter #102, Courant Inst.<br />

<str<strong>on</strong>g>of</str<strong>on</strong>g> Math. Sciences, New York<br />

University, New York, March<br />

1973. ?? pp.<br />

Kerr:1975:PIC<br />

[Ker75] Douglas S. Kerr, editor. Proceed<strong>in</strong>gs<br />

<str<strong>on</strong>g>of</str<strong>on</strong>g> the Internati<strong>on</strong>al<br />

C<strong>on</strong>ference <strong>on</strong> Very Large Data<br />

Bases, Fram<strong>in</strong>gham, MA, USA,<br />

September 22–24, 1975. ACM<br />

Press, New York, NY 10036,<br />

USA, 1975. ISBN ???? ISSN<br />

0278-2596. LCCN QA76.9.D3<br />

I55 1975. US$15.00.<br />

Kak:1995:ILM<br />

[KG95] Av<strong>in</strong>ash C. Kak and Lynne<br />

Grewe. Interactive learn<strong>in</strong>g <str<strong>on</strong>g>of</str<strong>on</strong>g><br />

a multiple-attribute hash table<br />

classifier for fast object recogniti<strong>on</strong>.<br />

Computer visi<strong>on</strong> and image<br />

understand<strong>in</strong>g: CVIU, 61<br />

(3):387–??, May 1, 1995. CO-<br />

DEN CVIUF4. ISSN 1077-3142<br />

(pr<strong>in</strong>t), 1090-235X (electr<strong>on</strong>ic).<br />

Kaushik:2012:MGH<br />

[KGJG12] Vandana Dixit Kaushik, Amit K.<br />

Gupta, Umarani Jayaraman,<br />

and Phalguni Gupta. Modified<br />

geometric hash<strong>in</strong>g for<br />

face database <strong>in</strong>dex<strong>in</strong>g. Lecture<br />

Notes <strong>in</strong> CS, 6839:608–<br />

613, 2012. CODEN LNCSD9.<br />

[KH84]<br />

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

3349 (electr<strong>on</strong>ic). URL<br />

http://l<strong>in</strong>k.spr<strong>in</strong>ger.com/<br />

c<strong>on</strong>tent/pdf/10.1007/978-3-<br />

642-25944-9_79.<br />

Karplus:1984:FMP<br />

K. Karplus and G. Haggard.<br />

F<strong>in</strong>d<strong>in</strong>g m<strong>in</strong>imal perfect hash<br />

functi<strong>on</strong>s. Technical Report<br />

84-637, Cornell University,<br />

September 1984. ?? pp. (email<br />

lmc@cs.cornell.edu).<br />

Khan:1995:PDH<br />

[KHH89]<br />

[KHK12]<br />

[Kha95] Zahira S. Khan. Performance<br />

<str<strong>on</strong>g>of</str<strong>on</strong>g> the distributed hash jo<strong>in</strong> algorithms<br />

<strong>in</strong> a distributed heterogeneous<br />

supercomput<strong>in</strong>g envir<strong>on</strong>ment.<br />

Thesis (ph.d.), Temple<br />

University, Philadelphia, PA,<br />

USA, 1995. xxii + 220 pp.<br />

Kuo:1989:DSF<br />

Y. S. Kuo, S.-Y. Hwang, and<br />

H. F. Hu. Data structure for<br />

fast regi<strong>on</strong> searches. IEEE Design<br />

& Test <str<strong>on</strong>g>of</str<strong>on</strong>g> Computers, 6<br />

(5):20–28, October 1989. CO-<br />

DEN IDTCEC. ISSN 0740-<br />

7475 (pr<strong>in</strong>t), 1558-1918 (electr<strong>on</strong>ic).<br />

Kanizo:2012:HTF<br />

Yossi Kanizo, David Hay, and<br />

Isaac Keslassy. Hash tables<br />

with f<strong>in</strong>ite buckets are less resistant<br />

to deleti<strong>on</strong>s. Computer<br />

Networks (Amsterdam, Netherlands:<br />

1999), 56(4):1376–1389,<br />

March 16, 2012. CODEN<br />

???? ISSN 1389-1286 (pr<strong>in</strong>t),<br />

1872-7069 (electr<strong>on</strong>ic). URL

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

Saved successfully!

Ooh no, something went wrong!