Compressed static functions with applications

DOI10.1137/1.9781611973105.17MaRDI QIDQ5741725zbMATH OpenOpenAlexFDO

Authors Djamal Belazzougui, Rossano Venturini

Publication date 15 May 2019

Published in Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973105.17

Mathematics Subject Classification ID

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

Recommendations

• A simple, fast, and compact static dictionary
• Storing a Compressed Function with Constant Time Access
• Low redundancy in static dictionaries with constant query time
• scientific article; zbMATH DE number 1779566
• Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)

Cited in

(8)

• Average-case analysis for a simple compression algorithm
• A resource-frugal probabilistic dictionary and applications in bioinformatics
• Compressed string dictionary search with edit distance one
• Storing a Compressed Function with Constant Time Access
• Compressed Dictionaries: Space Measures, Data Sets, and Experiments
• Ribbon: fast succinct static retrieval and approximate membership
• Combined search and encoding for seeds, with an application to minimal perfect hashing
• Fast scalable construction of ([compressed] static | minimal perfect hash) functions

This page was built for publication: Compressed static functions with applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741725)