Balancing Straight-line Programs

DOI10.1145/3457389zbMath1499.68162arXiv1902.03568OpenAlexW3176983239MaRDI QIDQ5056417

Moses Ganardi, Markus Lohrey, Artur Jeż

Publication date: 8 December 2022

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.03568

zbMATH Keywords

balancingstraight-line programsgrammar-based compressionrandom access problem

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42)

Related Items (6)

Balancing run-length straight-line programs ⋮ Random access in persistent strings and segment selection ⋮ Grammar-based compression of unranked trees ⋮ Compressed range minimum queries ⋮ Constant delay traversal of grammar-compressed graphs with bounded rank ⋮ Balancing straight-line programs for strings and trees

This page was built for publication: Balancing Straight-line Programs