Pages that link to "Item:Q2912840"
From MaRDI portal
The following pages link to New Lower and Upper Bounds for Representing Sequences (Q2912840):
Displaying 15 items.
- Space-efficient substring occurrence estimation (Q261345) (← links)
- Linear-space data structures for range frequency queries on arrays and trees (Q261369) (← links)
- Compressed string dictionary search with edit distance one (Q270017) (← links)
- Colored range queries and document retrieval (Q390874) (← links)
- Succinct encoding of arbitrary graphs (Q391972) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- Succinct representation of labeled trees (Q476876) (← links)
- A framework for succinct labeled ordinal trees over large alphabets (Q487027) (← links)
- New space/time tradeoffs for top-\(k\) document retrieval on sequences (Q2015136) (← links)
- Engineering a lightweight external memory suffix array construction algorithm (Q2363989) (← links)
- Wavelet trees for all (Q2442812) (← links)
- GLOUDS: representing tree-like graphs (Q2634715) (← links)
- Compressed Data Structures for Dynamic Sequences (Q3452849) (← links)
- Fast Compressed Self-Indexes with Deterministic Linear-Time Construction (Q5136278) (← links)
- Spaces, Trees, and Colors (Q5176183) (← links)