On the Redundancy of Succinct Data Structures

DOI10.1007/978-3-540-69903-3_15MaRDI QIDQ3512455zbMATH OpenOpenAlexFDO

Authors Alexander Golynski, Rajeev Raman, S. Srinivasa Rao

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

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• The cell probe complexity of succinct data structures
• Adaptive succinctness
• On the Size of Succinct Indices
• Bit-probe lower bounds for succinct data structures
• Bit-probe lower bounds for succinct data structures

Cited in

(18)

• Succinct navigational oracles for families of intersection graphs on a circle
• Adaptive succinctness
• The cell probe complexity of succinct data structures
• Space-Efficient Informational Redundancy
• 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
• On the intricacy of avoiding multiple-entry arrays
• Efficient fully-compressed sequence representations
• A self-index on block trees
• Encoding data structures
• Optimal succinct rank data structure via approximate nonnegative tensor decomposition
• Sampling lower bounds: Boolean average-case and permutations
• scientific article; zbMATH DE number 7765406 (Why is no real title available?)
• Random access in persistent strings and segment selection
• A practical alphabet-partitioning rank/select data structure
• Adaptive succinctness

This page was built for publication: On the Redundancy of Succinct Data Structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512455)