Show simple item record

dc.contributor.authorAskitis, N
dc.contributor.authorZobel, J
dc.contributor.editorConsens, M
dc.contributor.editorNavarro, G
dc.date.available2014-05-22T04:38:25Z
dc.date.issued2005-01-01
dc.identifierhttp://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000244887600011&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=d4d813f4571fa7d6246bdc0dfeca3a1c
dc.identifier.citationAskitis, N. & Zobel, J. (2005). Cache-conscious collision resolution in string hash tables. Consens, M (Ed.) Navarro, G (Ed.) STRING PROCESSING AND INFORMATION RETRIEVAL, PROCEEDINGS, 3772, pp.91-102. SPRINGER-VERLAG BERLIN. https://doi.org/10.1007/11575832_11.
dc.identifier.isbn3540297405
dc.identifier.isbn978-3-540-29740-6
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/11343/31932
dc.descriptionString Processing and Information Retrieval (SPIRE) International Conference
dc.languageEnglish
dc.publisherSPRINGER-VERLAG BERLIN
dc.source12th International Conference on String Processing and Information Retrieval
dc.subjectArtificial Intelligence and Image Processing
dc.titleCache-conscious collision resolution in string hash tables
dc.typeConference Paper
dc.identifier.doi10.1007/11575832_11
melbourne.peerreviewPeer Reviewed
melbourne.affiliationThe University of Melbourne
melbourne.affiliation.departmentChancellery Research
melbourne.affiliation.facultyChancellery
melbourne.source.titleLecture Notes in Computer Science
melbourne.source.volume3772
melbourne.source.pages91-102
melbourne.publicationid137152
melbourne.elementsid317866
melbourne.contributor.authorZobel, Justin
dc.identifier.eissn1611-3349
melbourne.event.locationBuenos Aires, ARGENTINA
melbourne.accessrightsThis item is currently not available from this repository


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record