The following pages link to (Q4633891):
Displaying 14 items.
- Less space: indexing for queries with wildcards (Q300263) (← links)
- Fast scalable construction of ([compressed] static | minimal perfect hash) functions (Q776836) (← links)
- Streaming dictionary matching with mismatches (Q2118382) (← links)
- Space-time trade-offs for finding shortest unique substrings and maximal unique matches (Q2410365) (← links)
- Minimal indices for predecessor search (Q2514143) (← links)
- Fast compressed tries through path decompositions (Q2828185) (← links)
- General document retrieval in compact space (Q2828189) (← links)
- Minimal and Monotone Minimal Perfect Hash Functions (Q2946321) (← links)
- Kings, Name Days, Lazy Servants and Magic (Q3305728) (← links)
- Tables should be sorted (on random access machines) (Q5057459) (← links)
- Optimal rank and select queries on dictionary-compressed text (Q5088891) (← links)
- Streaming Dictionary Matching with Mismatches (Q5088912) (← links)
- Theory and practice of monotone minimal perfect hashing (Q5406248) (← links)
- Predecessor on the Ultra-Wide Word RAM (Q6492089) (← links)
