Optimal Lower Bounds for Rank and Select Indexes
From MaRDI portal
Publication:3613774
DOI10.1007/11786986_33zbMath1223.68030OpenAlexW1524202346MaRDI QIDQ3613774
Publication date: 12 March 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11786986_33
Related Items (5)
A simple storage scheme for strings achieving entropy bounds ⋮ Wavelet trees for all ⋮ Succinct representation of dynamic trees ⋮ Faster entropy-bounded compressed suffix trees ⋮ From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures
This page was built for publication: Optimal Lower Bounds for Rank and Select Indexes
