Balancing straight-line programs for strings and trees
type: Item
instance of: scholarly article
title: Balancing straight-line programs for strings and trees
DOI: 10.1007/978-3-030-51466-2_26
author: Markus Lohrey
publication date: 2022-12-16T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7633517
MaRDI profile type: Publication
full work available at URL: 978-3-030-51466-2 26
OpenAlex ID: W3037129134
cites work: Access, Rank, and Select in Grammar-compressed Strings
cites work: Compressed subsequence matching and packed tree coloring
cites work: Tight Bounds for Top Tree Compression
cites work: Fingerprints in compressed strings
cites work: Tree compression with top trees
cites work: Random Access to Grammar-Compressed Strings and Trees
cites work: Database Programming Languages
cites work: The Smallest Grammar Problem
cites work: The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
cites work: Slowing Down Top Trees for Better Worst-Case Compression
cites work: Balancing Straight-line Programs
cites work: Grammar-based compression of unranked trees
cites work: Compressed range minimum queries
cites work: Detecting regularities on grammar-compressed strings
cites work: Approximation of grammar-based compression via recompression
cites work: A \textit{really} simple approximation of smallest grammar
cites work: Algorithmics on SLP-compressed strings: a survey
cites work: Grammar-Based Tree Compression
cites work: Constant-time tree traversal and subtree equality check for grammar-compressed trees
cites work: Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
description: scientific article; zbMATH DE number 7633517