Compact Hash Tables Using Bidirectional Linear Probing

DOI10.1109/TC.1984.1676499zbMath0545.68089WikidataQ60451318 ScholiaQ60451318MaRDI QIDQ3335023

John G. Cleary

Publication date: 1984

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

zbMATH Keywords

algorithmperformance analysissearchinghash tablesopen addressingmemory compactionaddress calculationbidirectional linear probingscatter storage

Mathematics Subject Classification ID

Searching and sorting (68P10) Information storage and retrieval of data (68P20)

Related Items (6)

Fast and simple compact hashing via bucketing ⋮ c-trie++: a dynamic trie tailored for fast prefix searches ⋮ Dynamic Path-decomposed Tries ⋮ Engineering Practical Lempel-Ziv Tries ⋮ m-Bonsai: A Practical Compact Dynamic Trie ⋮ Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries

This page was built for publication: Compact Hash Tables Using Bidirectional Linear Probing