| dc.contributor.author | Chen, Wen-Chin | |
| dc.contributor.author | Vitter, Jeffrey Scott | |
| dc.date.accessioned | 2011-03-16T15:23:50Z | |
| dc.date.available | 2011-03-16T15:23:50Z | |
| dc.date.issued | 1983 | |
| dc.identifier.citation | J. 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.uri | http://hdl.handle.net/1808/7169 | |
| dc.description.abstract | This 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.iso | en_US | |
| dc.publisher | Society for Industrial and Applied Mathematics | |
| dc.subject | Algorithm analysis | |
| dc.subject | Hashing | |
| dc.subject | Coalesced hashing | |
| dc.subject | Early-insertion | |
| dc.subject | Data structures | |
| dc.subject | Average-case | |
| dc.title | Analysis of Early-Insertion Standard Coalesced Hashing | |
| dc.type | Article | |
| kusw.kuauthor | Vitter, Jeffrey Scott | |
| kusw.oastatus | fullparticipation | |
| dc.identifier.doi | 10.1137/0212046 | |
| kusw.oaversion | Scholarly/refereed, publisher version | |
| kusw.oapolicy | This item meets KU Open Access policy criteria. | |
| dc.rights.accessrights | openAccess | |
