RecSplit: Minimal Perfect Hashing via Recursive Splitting

DOI10.1137/1.9781611976007.14MaRDI QIDQ5147509zbMATH OpenOpenAlexFDO

Authors Emmanuel Esposito, Thomas Mueller Graf, Sebastiano Vigna

Publication date 27 January 2021

Published in 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1910.06416

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(6)

• Fingerprinting-based minimal perfect hashing revisited
• ShockHash: near optimal-space minimal perfect hashing beyond brute-force
• PHOBIC: Perfect hashing with optimized bucket sizes and interleaved coding
• MorphisHash: improving space efficiency of ShockHash for minimal perfect hashing
• Engineering minimal \(k\)-perfect hash functions
• Combined search and encoding for seeds, with an application to minimal perfect hashing

This page was built for publication: RecSplit: Minimal Perfect Hashing via Recursive Splitting

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