Balancing straight-line programs for strings and trees
From MaRDI portal
Publication:2106614
DOI10.1007/978-3-030-51466-2_26OpenAlexW3037129134MaRDI QIDQ2106614
Publication date: 16 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-51466-2_26
Cites Work
- Approximation of grammar-based compression via recompression
- Compressed subsequence matching and packed tree coloring
- Constant-time tree traversal and subtree equality check for grammar-compressed trees
- A \textit{really} simple approximation of smallest grammar
- The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Compressed range minimum queries
- Tree compression with top trees
- Fingerprints in compressed strings
- Detecting regularities on grammar-compressed strings
- Algorithmics on SLP-compressed strings: A survey
- Grammar-Based Tree Compression
- Access, Rank, and Select in Grammar-compressed Strings
- The Smallest Grammar Problem
- Balancing Straight-line Programs
- Slowing Down Top Trees for Better Worst-Case Compression
- Tight Bounds for Top Tree Compression
- Random Access to Grammar-Compressed Strings and Trees
- Database Programming Languages
- Grammar-based compression of unranked trees
This page was built for publication: Balancing straight-line programs for strings and trees
