The following pages link to (Q5417611):
Displaying 13 items.
- Entropy-bounded representation of point grids (Q390358) (← links)
- Succinct representations of permutations and functions (Q441860) (← links)
- Optimal indexes for sparse bit vectors (Q472491) (← links)
- A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs (Q2019478) (← links)
- Adaptive succinctness (Q2118203) (← links)
- Wavelet trees for all (Q2442812) (← links)
- Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
- Random Access to High-Order Entropy Compressed Text (Q2848976) (← links)
- Everywhere-Tight Information Cost Tradeoffs for Augmented Index (Q3088117) (← links)
- Adjacency Labeling Schemes and Induced-Universal Graphs (Q4610450) (← links)
- Improved Time and Space Bounds for Dynamic Range Mode (Q5009582) (← links)
- Nearly Optimal Static Las Vegas Succinct Dictionary (Q5080480) (← links)
- Sampling Lower Bounds: Boolean Average-Case and Permutations (Q5216796) (← links)
