ATTENTION: The software behind KU ScholarWorks is being upgraded to a new version. Starting July 15th, users will not be able to log in to the system, add items, nor make any changes until the new version is in place at the end of July. Searching for articles and opening files will continue to work while the system is being updated. If you have any questions, please contact Marianne Reed at mreed@ku.edu .

Show simple item record

Analysis of Early-Insertion Standard Coalesced Hashing

dc.contributor.authorChen, Wen-Chin
dc.contributor.authorVitter, Jeffrey Scott
dc.date.accessioned2011-03-16T15:23:50Z
dc.date.available2011-03-16T15:23:50Z
dc.date.issued1983
dc.identifier.citationJ. S. Vitter and W.-C. Chen. “Analysis of Early-Insertion Standard Coalesced Hashing,” SIAM Journal on Computing, 12(4), November 1983, 667–676. http://dx.doi.org/10.1137/0212046
dc.identifier.urihttp://hdl.handle.net/1808/7169
dc.description.abstractThis paper analyzes the early-insertion standard coalesced hashing method (EISCH), which is a variant of the standard coalesced hashing algorithm (SCH) described in [Knu73], [Vit80] and [Vit82b]. The analysis answers the open problem posed in [Vit80]. The number of probes per successful search in full tables is 5% better with EISCH than with SCH.
dc.language.isoen_US
dc.publisherSociety for Industrial and Applied Mathematics
dc.subjectAlgorithm analysis
dc.subjectHashing
dc.subjectCoalesced hashing
dc.subjectEarly-insertion
dc.subjectData structures
dc.subjectAverage-case
dc.titleAnalysis of Early-Insertion Standard Coalesced Hashing
dc.typeArticle
kusw.kuauthorVitter, Jeffrey Scott
kusw.oastatusfullparticipation
dc.identifier.doi10.1137/0212046
kusw.oaversionScholarly/refereed, publisher version
kusw.oapolicyThis item meets KU Open Access policy criteria.
dc.rights.accessrightsopenAccess


Files in this item

Thumbnail
Name:
Vitter_1983.pdf
Size:
1.016Mb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record