Theory and practice of monotone minimal perfect hashing

DOI10.1137/1.9781611972894.13MaRDI QIDQ5233572zbMATH OpenOpenAlexFDO

Authors Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna

Publication date 11 September 2019

Published in 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• Theory and practice of monotone minimal perfect hashing
• Minimal and monotone minimal perfect hash functions
• scientific article; zbMATH DE number 7051248
• Experimental and Efficient Algorithms
• Simple and Space-Efficient Minimal Perfect Hash Functions

Cited in

(7)

• An ordered minimal perfect hashing scheme based upon Euler's theorem
• General document retrieval in compact space
• Minimal and monotone minimal perfect hash functions
• The self-indexed search algorithm: a bit-level approach to minimal perfect hashing
• A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
• scientific article; zbMATH DE number 7051248 (Why is no real title available?)
• Theory and practice of monotone minimal perfect hashing

This page was built for publication: Theory and practice of monotone minimal perfect hashing

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