1 citations · 1 across the 2 of their papers we have counts for
4 papers
The smallest grammar problem revisited
Hideo Bannai, Momoko Hirayama, Danny Hucke +4
In a seminal paper of Charikar et al. on the smallest grammar problem, the authors derive upper and lower bounds on the approximation ratios for several grammar-based compressors,…
Grammar-based Compression of Unranked Trees
Adrià Gascón, Markus Lohrey, Sebastian Maneth +2
We introduce forest straight-line programs (FSLPs) as a compressed representation of unranked ordered node-labelled trees. FSLPs are based on the operations of forest algebra and g…
Optimal top dag compression
Markus Lohrey, Carl Philipp Reh, Kurt Sieber
It is shown that for a given ordered node-labelled tree of size and with many different node labels, one can construct in linear time a top dag of height and si…
Traversing Grammar-Compressed Trees with Constant Delay
Markus Lohrey, Sebastian Maneth, Carl Philipp Reh
A grammar-compressed ranked tree is represented with a linear space overhead so that a single traversal step, i.e., the move to the parent or the i-th child, can be carried out in…