On the Redundancy of Succinct Data Structures
From MaRDI portal
Publication:3512455
DOI10.1007/978-3-540-69903-3_15zbMath1155.68374MaRDI QIDQ3512455
Rajeev Raman, S. Srinivasa Rao, Alexander Golynski
Publication date: 15 July 2008
Published in: Algorithm Theory – SWAT 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69903-3_15
68P05: Data structures
Related Items
A Self-index on Block Trees, Sampling Lower Bounds: Boolean Average-Case and Permutations, Unnamed Item, Random access in persistent strings and segment selection, Compact binary relation representations with rich functionality, Entropy-bounded representation of point grids, Colored range queries and document retrieval, On compressing permutations and adaptive sorting, Efficient fully-compressed sequence representations, Succinct navigational oracles for families of intersection graphs on a circle, Adaptive succinctness