Theory and practice of monotone minimal perfect hashing
From MaRDI portal
Publication:5406248
DOI10.1145/1963190.2025378zbMath1284.68631OpenAlexW1969884330WikidataQ56021020 ScholiaQ56021020MaRDI QIDQ5406248
Sebastiano Vigna, Paolo Boldi, Rasmus Pagh, Djamal Belazzougui
Publication date: 1 April 2014
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1963190.2025378
Searching and sorting (68P10) Nonnumerical algorithms (68W05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)
Related Items
Minimal and Monotone Minimal Perfect Hash Functions ⋮ On representing the degree sequences of sublogarithmic-degree Wheeler graphs ⋮ Path queries on functions ⋮ Range majorities and minorities in arrays ⋮ Minimal indices for predecessor search ⋮ Fast Compressed Tries through Path Decompositions ⋮ Fast scalable construction of ([compressed static | minimal perfect hash) functions] ⋮ An Encoding for Order-Preserving Matching. ⋮ Real-Time Streaming Multi-Pattern Search for Constant Alphabet
Uses Software