The following pages link to On the Size of Succinct Indices (Q3527227):
Displaying 16 items.
- Entropy-bounded representation of point grids (Q390358) (← links)
- Space-efficient data-analysis queries on grids (Q390915) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- Optimal indexes for sparse bit vectors (Q472491) (← links)
- Succinct representation of dynamic trees (Q541673) (← links)
- Dynamic rank/select structures with applications to run-length encoded texts (Q732034) (← links)
- Adaptive succinctness (Q2118203) (← links)
- Practical space-efficient index for structural pattern matching (Q2169971) (← links)
- Succinct data structure for dynamic trees with faster queries (Q2420610) (← links)
- Wavelet trees for all (Q2442812) (← links)
- Representation of ordered trees with a given degree distribution (Q2656174) (← links)
- Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
- Succinct Representations of Ordinal Trees (Q2848982) (← links)
- Succinct Representations of Arbitrary Graphs (Q3541102) (← links)
- Structural Pattern Matching - Succinctly. (Q5136254) (← links)
- Sampling Lower Bounds: Boolean Average-Case and Permutations (Q5216796) (← links)
