Compact dictionaries for variable-length keys and data with applications

DOI10.1145/1361192.1361194zbMath1445.68064OpenAlexW2057529271MaRDI QIDQ4962710

Guy E. Blelloch, Daniel K. Blandford

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1361192.1361194

zbMATH Keywords

compression

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)

Related Items (5)

Dynamic dictionaries for multisets and counting filters with constant time operations ⋮ Fast and simple compact hashing via bucketing ⋮ Dynamic dictionaries for multisets and counting filters with constant time operations ⋮ Fast Compressed Tries through Path Decompositions ⋮ Adaptive succinctness

This page was built for publication: Compact dictionaries for variable-length keys and data with applications