Fingerprinting-based minimal perfect hashing revisited

DOI10.1145/3596453MaRDI QIDQ6579768FDOQ6579768

Authors: Piotr Beling 

Publication date: 26 July 2024

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

zbMATH Keywords

algorithmsdata structuresminimal perfect hashing

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• On the Size of Separating Systems and Families of Perfect Hash Functions
• Hash, Displace, and Compress
• Fast and scalable minimal perfect hashing for massive key sets
• Experimental and Efficient Algorithms
• Simple and Space-Efficient Minimal Perfect Hash Functions
• Improved bounds for covering complete uniform hypergraphs
• Fast scalable construction of ([compressed] static | minimal perfect hash) functions
• RecSplit: Minimal Perfect Hashing via Recursive Splitting

This page was built for publication: Fingerprinting-based minimal perfect hashing revisited

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