Deletion Algorithms for Coalesced Hashing
From MaRDI portal
Publication:3746900
DOI10.1093/COMJNL/29.5.436zbMATH Open0607.68049OpenAlexW2119158116MaRDI QIDQ3746900FDOQ3746900
Authors: Wen-Chin Chen, Jeffrey Scott Vitter
Publication date: 1986
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/29.5.436
Recommendations
dynamic searchingcoalesced chainingearly insertionefficient deletion algorithmslate insertionvaried insertion
Cited In (6)
- On Search Times for Early-Insertion Coalesced Hashing
- The effect of deletions on different insertion disciplines for hash tables
- On deletions in open addressing hashing
- Optimum Algorithms for a Model of Direct Chaining
- A Queueing Analysis of Hashing with Lazy Deletion
- Analysis of new variants of coalesced hashing
This page was built for publication: Deletion Algorithms for Coalesced Hashing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3746900)