scientific article; zbMATH DE number 7051248
From MaRDI portal
Publication:4633891
Recommendations
- Theory and practice of monotone minimal perfect hashing
- Theory and practice of monotone minimal perfect hashing
- scientific article; zbMATH DE number 1688373
- Minimal perfect hashing in polynomial time
- On the optimal time/space tradeoff for hash tables
- scientific article; zbMATH DE number 1962820
- Space efficient hash tables with worst case constant access time
- Minimal and monotone minimal perfect hash functions
- A scheme for constructing ordered minimal perfect hashing functions
Cited in
(19)- Streaming dictionary matching with mismatches
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches
- Minimal indices for predecessor search
- Fast compressed tries through path decompositions
- General document retrieval in compact space
- Minimal and monotone minimal perfect hash functions
- Less space: indexing for queries with wildcards
- Kings, name days, lazy servants and magic
- Tables should be sorted (on random access machines)
- Optimal rank and select queries on dictionary-compressed text
- Streaming Dictionary Matching with Mismatches
- Theory and practice of monotone minimal perfect hashing
- Theory and practice of monotone minimal perfect hashing
- Predecessor on the Ultra-Wide Word RAM
- Simplified tight bounds for monotone minimal perfect hashing
- Tight bounds for monotone minimal perfect hashing
- Optimal static fully indexable dictionaries
- Suffixient arrays: a new efficient suffix array compression technique
- Fast scalable construction of ([compressed] static | minimal perfect hash) functions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633891)
