The following pages link to (Q2934653):
Displayed 20 items.
- Fast construction of wavelet trees (Q294942) (← links)
- Succinct posets (Q329288) (← links)
- Colored range queries and document retrieval (Q390874) (← links)
- Succinct encoding of arbitrary graphs (Q391972) (← links)
- Dynamic rank/select structures with applications to run-length encoded texts (Q732034) (← links)
- Rank/select on dynamic compressed sequences and applications (Q732036) (← links)
- A simple storage scheme for strings achieving entropy bounds (Q870846) (← links)
- On compact representations of all-pairs-shortest-path-distance matrices (Q986563) (← links)
- The range 1 query (R1Q) problem (Q1659997) (← links)
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations (Q1758161) (← links)
- Stronger Lempel-Ziv based compressed text indexing (Q2428663) (← links)
- Succinct representation of labeled graphs (Q2428673) (← links)
- LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations (Q3011862) (← links)
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing (Q3183444) (← links)
- A Uniform Approach Towards Succinct Representation of Trees (Q3512457) (← links)
- Succinct Representations of Arbitrary Graphs (Q3541102) (← links)
- Recent Developments in Floorplan Representations (Q5135264) (← links)
- Succinct Representation of Labeled Graphs (Q5387767) (← links)
- (Q6065455) (← links)
- Random access in persistent strings and segment selection (Q6174650) (← links)