We show that a context-free grammar of size that produces a single string of length (such a
grammar is also called a string straight-line program) can be transformed in linear time into a …

XML tree structures can conveniently be represented using ordered unranked trees. Due to
the repetitiveness of XML markup these trees can be compressed effectively using dictionary …

We revisit tree compression with top trees (Bille et al.[2]), and present several improvements
to the compressor and its analysis. By significantly reducing the amount of information stored …

A simple linear-time algorithm for constructing a linear context-free tree grammar of size O (r
g+ rg log⁡(n/rg)) for a given input tree T of size n is presented, where g is the size of a …

Several election districts in the US have recently moved to ranked-choice voting (RCV) to
decide the results of local elections. RCV allows voters to rank their choices, and the results …

It is shown that every tree of size n over a fixed set of σ different ranked symbols can be
produced by a so called straight-line linear context-free tree grammar of size O (n log σ⁡ n) …

The quartet distance is a measure of similarity used to compare two unrooted phylogenetic
trees on the same set of n leaves, defined as the number of subsets of four leaves related by …

Given a string S of n integers in [0, σ), a range minimum query RMQ (i, j) asks for the index of
the smallest integer in S [i… j]. It is well known that the problem can be solved with a succinct …

We consider the top tree compression scheme introduced by Bille et al.[ICALP 2013] and
construct an infinite family of trees on n nodes labeled from an alphabet of size sigma, for …

We present a general framework for balancing expressions (terms) in the form of so-called
tree straight-line programs. The latter can be seen as circuits over the free term algebra …