Pages that link to "Item:Q870846"
From MaRDI portal
The following pages link to A simple storage scheme for strings achieving entropy bounds (Q870846):
Displaying 14 items.
- Compressed string dictionary search with edit distance one (Q270017) (← links)
- Colored range queries and document retrieval (Q390874) (← links)
- Ultra-succinct representation of ordered trees with applications (Q414928) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- Optimal indexes for sparse bit vectors (Q472491) (← links)
- A framework for succinct labeled ordinal trees over large alphabets (Q487027) (← links)
- Dynamic rank/select structures with applications to run-length encoded texts (Q732034) (← links)
- Rank/select on dynamic compressed sequences and applications (Q732036) (← links)
- On compact representations of all-pairs-shortest-path-distance matrices (Q986563) (← links)
- Wee LCP (Q991794) (← links)
- Succinct data structures for nearest colored node in a tree (Q1705642) (← links)
- Path queries on functions (Q1740690) (← links)
- Dynamic relative compression, dynamic partial sums, and substring concatenation (Q1755738) (← links)
- Accelerated partial decoding in wavelet trees (Q2295619) (← links)
