Rank/select on dynamic compressed sequences and applications
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2038723 (Why is no real title available?)
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- A Framework for Dynamizing Succinct Data Structures
- A simple storage scheme for strings achieving entropy bounds
- A space and time efficient algorithm for constructing compressed suffix arrays
- Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents
- Algorithms and Computation
- An analysis of the Burrows-Wheeler transform
- Combinatorial Pattern Matching
- Compact representations of ordered sets
- Compressed indexes for dynamic text collections
- Compressed representations of sequences and full-text indexes
- Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts
- Dynamic entropy-compressed sequences and full-text indexes
- Introduction to algorithms
- Logarithmic Lower Bounds in the Cell-Probe Model
- Rank/select operations on large alphabets
- Squeezing succinct data structures into entropy bounds
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- Succinct indexes for strings, binary relations and multi-labeled trees
- Suffix Arrays: A New Method for On-Line String Searches
- When indexing equals compression
Cited in
(23)- Dynamic rank/select structures with applications to run-length encoded texts
- Space-efficient B trees via load-balancing
- Faster practical block compression for rank/select dictionaries
- Space-efficient construction of Lempel-Ziv compressed text indexes
- Improved Dynamic Rank-Select Entropy-Bound Structures
- Compressed persistent index for efficient rank/select queries
- Practical entropy-compressed rank/select dictionary
- Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts
- Counting Colours in Compressed Strings
- Rank and select revisited and extended
- A Learned Approach to Design Compressed Rank/Select Data Structures
- A practical alphabet-partitioning rank/select data structure
- Experimental and Efficient Algorithms
- Space-efficient data-analysis queries on grids
- Adaptive succinctness
- Succinct and Implicit Data Structures for Computational Geometry
- Fully functional static and dynamic succinct trees
- Space efficient data structures for dynamic orthogonal range counting
- Dynamic Entropy-Compressed Sequences and Full-Text Indexes
- Dynamic entropy-compressed sequences and full-text indexes
- Fast construction of wavelet trees
- Alphabet partitioning for compressed rank/select and applications
- A Framework for Dynamizing Succinct Data Structures
This page was built for publication: Rank/select on dynamic compressed sequences and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732036)
