Storing a Compressed Function with Constant Time Access

DOI10.1007/978-3-642-04128-0_65MaRDI QIDQ3639287zbMATH OpenOpenAlexFDO

Authors Jóhannes B. Hreinsson, Morten Krøyer, Rasmus Pagh

Publication date 29 October 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04128-0_65

Mathematics Subject Classification ID

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

Recommendations

• Compressed static functions with applications
• Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
• scientific article; zbMATH DE number 1688373
• scientific article; zbMATH DE number 1779566
• Fast scalable construction of ([compressed] static | minimal perfect hash) functions

Cited in

(4)

• Efficient fully-compressed sequence representations
• Compressed static functions with applications
• Ribbon: fast succinct static retrieval and approximate membership
• Fast scalable construction of ([compressed] static | minimal perfect hash) functions

This page was built for publication: Storing a Compressed Function with Constant Time Access

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