Dynamic Compressed Strings with Random Access
From MaRDI portal
Recommendations
- Simple Compression Code Supporting Random Access and Fast String Matching
- Random access to grammar-compressed strings
- Dynamic relative compression, dynamic partial sums, and substring concatenation
- Dynamic relative compression, dynamic partial sums, and substring concatenation
- scientific article; zbMATH DE number 1490000
- Compressed Data Structures for Dynamic Sequences
- Data compression with long repeated strings
- scientific article; zbMATH DE number 1794209
- scientific article; zbMATH DE number 1773096
Cited in
(17)- Dynamic relative compression, dynamic partial sums, and substring concatenation
- CRAM: compressed random access memory
- Random access to high-order entropy compressed text
- Access, rank, and select in grammar-compressed strings
- Compressed Data Structures for Dynamic Sequences
- Optimal trade-offs for succinct string indexes
- scientific article; zbMATH DE number 1490000 (Why is no real title available?)
- A framework of dynamic data structures for string processing
- scientific article; zbMATH DE number 6850408 (Why is no real title available?)
- Dynamic relative compression, dynamic partial sums, and substring concatenation
- Optimal rank and select queries on dictionary-compressed text
- Entropy lower bounds for dictionary compression
- Succinct dynamic one-dimensional point reporting
- Succinct color searching in one dimension
- CONCUR 2003 - Concurrency Theory
- scientific article; zbMATH DE number 7765406 (Why is no real title available?)
- Random access in persistent strings and segment selection
This page was built for publication: Dynamic Compressed Strings with Random Access
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326587)