Pages that link to "Item:Q5406248"
From MaRDI portal
The following pages link to Theory and practice of monotone minimal perfect hashing (Q5406248):
Displaying 12 items.
- The self-indexed search algorithm: a bit-level approach to minimal perfect hashing (Q294669) (← links)
- Fast scalable construction of ([compressed] static | minimal perfect hash) functions (Q776836) (← links)
- An ordered minimal perfect hashing scheme based upon Euler's theorem (Q1060014) (← links)
- Path queries on functions (Q1740690) (← links)
- Range majorities and minorities in arrays (Q2032347) (← links)
- Minimal indices for predecessor search (Q2514143) (← links)
- Fast compressed tries through path decompositions (Q2828185) (← links)
- Minimal and Monotone Minimal Perfect Hash Functions (Q2946321) (← links)
- A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata (Q3653096) (← links)
- (Q4633891) (← links)
- An Encoding for Order-Preserving Matching. (Q5111725) (← links)
- Real-Time Streaming Multi-Pattern Search for Constant Alphabet (Q5111729) (← links)