On the Size of Succinct Indices

DOI10.1007/978-3-540-75520-3_34zbMath1151.68385OpenAlexW1646212714MaRDI QIDQ3527227

Rajeev Raman, Roberto Grossi, Alexander Golynski, S. Srinivasa Rao, Ankur Gupta

Publication date: 25 September 2008

Published in: Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_34

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (16)

Representation of ordered trees with a given degree distribution ⋮ Practical space-efficient index for structural pattern matching ⋮ Entropy-bounded representation of point grids ⋮ Space-efficient data-analysis queries on grids ⋮ Succinct data structure for dynamic trees with faster queries ⋮ Wavelet trees for all ⋮ Succinct Representations of Arbitrary Graphs ⋮ Efficient fully-compressed sequence representations ⋮ Optimal indexes for sparse bit vectors ⋮ Succinct representation of dynamic trees ⋮ Fully Functional Static and Dynamic Succinct Trees ⋮ Dynamic rank/select structures with applications to run-length encoded texts ⋮ Sampling Lower Bounds: Boolean Average-Case and Permutations ⋮ Succinct Representations of Ordinal Trees ⋮ Structural Pattern Matching - Succinctly. ⋮ Adaptive succinctness

This page was built for publication: On the Size of Succinct Indices