MorphisHash: improving space efficiency of ShockHash for minimal perfect hashing

DOI10.4230/LIPICS.ESA.2025.9MaRDI QIDQ7322395zbMATH OpenFDO

Authors Stefan Hermann

Publication date 31 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2025.9

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Alphabet-independent compressed text indexing
• Cuckoo hashing
• Fast prefix search in little space, with applications
• High performance construction of recsplit based minimal perfect hash functions
• Network Applications of Bloom Filters: A Survey
• Networks. An introduction.
• On Cayley's formula for counting forests
• On the singularity probability of discrete random matrices
• PHOBIC: Perfect hashing with optimized bucket sizes and interleaved coding
• RecSplit: Minimal Perfect Hashing via Recursive Splitting
• ShockHash: towards optimal-space minimal perfect hashing beyond brute-force
• Uniform Hashing in Constant Time and Optimal Space

This page was built for publication: MorphisHash: improving space efficiency of ShockHash for minimal perfect hashing

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