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

[Mar75]<br />

[Mar77]<br />

<strong>in</strong>g. Journal <str<strong>on</strong>g>of</str<strong>on</strong>g> the Associati<strong>on</strong><br />

for Comput<strong>in</strong>g Mach<strong>in</strong>ery,<br />

18(4):549–558, October 1971.<br />

CODEN JACOAH. ISSN 0004-<br />

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

Mart<strong>in</strong>:1975:CDB<br />

James Mart<strong>in</strong>. Computer Database<br />

Organizati<strong>on</strong>. Prentice-<br />

Hall, Englewood Cliffs, NJ<br />

07632, USA, 1975. ISBN 0-<br />

13-165506-X. xviii + 558 pp.<br />

LCCN QA76 .M324.<br />

Mart<strong>in</strong>:1977:CDB<br />

James Mart<strong>in</strong>. Computer Database<br />

Organizati<strong>on</strong>. Prentice-<br />

Hall, Englewood Cliffs, NJ<br />

07632, USA, 2 editi<strong>on</strong>, 1977.<br />

ISBN 0-13-165423-3. xviii +<br />

713 pp. LCCN QA76.9.D3 M36<br />

1977.<br />

Matias:1993:HPR<br />

[Mat93] Yossi Matias. Highly parallel<br />

randomized algorithmics. In<br />

Proceed<strong>in</strong>gs <str<strong>on</strong>g>of</str<strong>on</strong>g> the 3rd Workshop<br />

<strong>on</strong> Parallel <strong>Algorithms</strong><br />

(WOPA), page ?? ????, ????,<br />

May 1993.<br />

[Mat09]<br />

Mathieu:2009:PTA<br />

Claire Mathieu, editor. Proceed<strong>in</strong>gs<br />

<str<strong>on</strong>g>of</str<strong>on</strong>g> the Twentieth Annual<br />

ACM–SIAM Symposium <strong>on</strong><br />

Discrete <strong>Algorithms</strong>, New York,<br />

NY, January 4–6, 2009, Proceed<strong>in</strong>gs<br />

<str<strong>on</strong>g>of</str<strong>on</strong>g> the annual ACM-<br />

SIAM Symposium <strong>on</strong> Discrete<br />

<strong>Algorithms</strong>, 1071-9040. ACM<br />

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

USA, 2009. ISBN 0-89871-<br />

680-2. LCCN QA76.6 A849<br />

2009. URL http://www.siam.<br />

org/proceed<strong>in</strong>gs/soda/2009/<br />

soda09.php.<br />

Maurer:1968:PTI<br />

[Mau68] Ward Douglas Maurer. Programm<strong>in</strong>g<br />

technique: An improved<br />

hash code for scatter<br />

storage. Communicati<strong>on</strong>s <str<strong>on</strong>g>of</str<strong>on</strong>g><br />

the Associati<strong>on</strong> for Comput<strong>in</strong>g<br />

Mach<strong>in</strong>ery, 11(1):35–38, January<br />

1968. CODEN CACMA2.<br />

ISSN 0001-0782 (pr<strong>in</strong>t), 1557-<br />

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

Maurer:1983:IHC<br />

[Mau83] W. D. Maurer. An improved<br />

hash code for scatter storage.<br />

Communicati<strong>on</strong>s <str<strong>on</strong>g>of</str<strong>on</strong>g> the Associati<strong>on</strong><br />

for Comput<strong>in</strong>g Mach<strong>in</strong>ery,<br />

26(1):36–38, January 1983.<br />

CODEN CACMA2. ISSN 0001-<br />

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

Mart<strong>in</strong>i:2003:DHM<br />

[MB03] Paul M. Mart<strong>in</strong>i and Walter A.<br />

Burkhard. Double hash<strong>in</strong>g with<br />

multiple passbits. Internati<strong>on</strong>al<br />

Journal <str<strong>on</strong>g>of</str<strong>on</strong>g> Foundati<strong>on</strong>s<br />

<str<strong>on</strong>g>of</str<strong>on</strong>g> Computer Science, 14(6):<br />

1165–??, December 2003. CO-<br />

DEN IFCSEN. ISSN 0129-0541<br />

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

Mart<strong>on</strong>:2012:OCC<br />

[MBBS12] Zoltan-Csaba Mart<strong>on</strong>, Ferenc<br />

Bal<strong>in</strong>t-Benczedi, and Florian<br />

Seidel. Object categorizati<strong>on</strong><br />

<strong>in</strong> clutter us<strong>in</strong>g additive features<br />

and hash<strong>in</strong>g <str<strong>on</strong>g>of</str<strong>on</strong>g> part-graph<br />

descriptors. Lecture Notes <strong>in</strong>

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

Saved successfully!

Ooh no, something went wrong!