Pages that link to "Item:Q3586483"
From MaRDI portal
The following pages link to Fast Prefix Search in Little Space, with Applications (Q3586483):
Displaying 17 items.
- Space-efficient substring occurrence estimation (Q261345) (← links)
- On the weak prefix-search problem (Q390882) (← links)
- Improved space-time tradeoffs for approximate full-text indexing with one edit error (Q494804) (← links)
- Fast scalable construction of ([compressed] static | minimal perfect hash) functions (Q776836) (← links)
- Time-space trade-offs for Lempel-Ziv compressed indexing (Q1694685) (← links)
- Universal compressed text indexing (Q1729689) (← links)
- Dynamic relative compression, dynamic partial sums, and substring concatenation (Q1755738) (← links)
- Fast compressed self-indexes with deterministic linear-time construction (Q1986963) (← links)
- Minimal indices for predecessor search (Q2514143) (← links)
- Minimal and Monotone Minimal Perfect Hash Functions (Q2946321) (← links)
- Time-Optimal Top-$k$ Document Retrieval (Q2963583) (← links)
- On the Weak Prefix-Search Problem (Q3011860) (← links)
- Streaming Dictionary Matching with Mismatches (Q5088912) (← links)
- An Encoding for Order-Preserving Matching. (Q5111725) (← links)
- Fast Compressed Self-Indexes with Deterministic Linear-Time Construction (Q5136278) (← links)
- (Q5743422) (← links)
- Space-efficient conversions from SLPs (Q6547925) (← links)
