Search performance of double-linked coalesced hashing can not exceed bucketing

DOI10.1016/0020-0255(92)90080-RzbMath0800.68357OpenAlexW2021820569MaRDI QIDQ1193849

Srimanta Pal

Publication date: 27 September 1992

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(92)90080-r

zbMATH Keywords

Bucket Chainingcoalesced hashingdynamic information storagehashing technique

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis of Early-Insertion Standard Coalesced Hashing
• Analysis of new variants of coalesced hashing
• Limiting Distributions in Some Occupancy Problems
• Direct-chaining with coalescing lists
• Analysis of the Search Performance of Coalesced Hashing
• The expected length of the longest probe sequence for bucket searching when the distribution is not uniform
• Optimum Algorithms for a Model of Direct Chaining
• On the average-case complexity of “bucketing” algorithms
• Deletion algorithms for hashing that preserve randomness
• Deletions That Preserve Randomness
• A Class of Projective Planes
• Handling identifies as internal symbols in language processors

This page was built for publication: Search performance of double-linked coalesced hashing can not exceed bucketing