Deletion algorithms for hashing that preserve randomness

DOI10.1016/0196-6774(82)90024-4zbMath0493.68059OpenAlexW1986060912MaRDI QIDQ3956410

Jeffrey Scott Vitter

Publication date: 1982

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(82)90024-4

zbMATH Keywords

search timesefficient deletion algorithmsaddress regioncellarcoalesced hashing method

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (1)

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

This page was built for publication: Deletion algorithms for hashing that preserve randomness