Fast and simple compact hashing via bucketing

DOI10.1007/s00453-022-00996-yOpenAlexW4291295300MaRDI QIDQ2165038

Simon J. Puglisi, Dominik Köppl, Rajeev Raman

Publication date: 18 August 2022

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-022-00996-y

zbMATH Keywords

compact hashingdynamic dictionaryclosed addressingword-packing

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maintaining dynamic sequences under equality tests in polylogarithmic time
• Space efficient hash tables with worst case constant access time
• Dynamic space efficient hashing
• Low Redundancy in Static Dictionaries with Constant Query Time
• CRAM: Compressed Random Access Memory
• Compact Hash Tables Using Bidirectional Linear Probing
• De Dictionariis Dynamicis Pauco Spatio Utentibus
• Membership in Constant Time and Almost-Minimum Space
• Efficient Storage and Retrieval by Content and Address of Static Files
• Compact dictionaries for variable-length keys and data with applications
• Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries
• Compact Dynamic Rewritable (CDRW) Arrays
• m-Bonsai: A Practical Compact Dynamic Trie
• Dynamic Path-decomposed Tries

This page was built for publication: Fast and simple compact hashing via bucketing