Results on algorithmic problems on strings that are given in a compressed form via straight-
line programs are surveyed. A straight-line program is a context-free grammar that …

Consider an ordered, static tree T where each node has a label from alphabet Σ. Tree T may
be of arbitrary degree and shape. Our goal is designing a compressed storage scheme of T …

Grammar-based compression, where one replaces a long string by a small context-free
grammar that generates the string, is a simple and powerful paradigm that captures …

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 …

With the growth in popularity of the IFC (Industry Foundation Classes) format used in
construction industry, it often requires effective methods of IFC comparison to keep track of …

We present a new graph compressor that works by recursively detecting repeated
substructures and representing them through grammar rules. We show that for a large …

Web services are the de-facto standard for implementing web-based systems today, and
comprise message-based interactions involving XML and JSON documents. These formats …

Let S be a string of length N compressed into a context-free grammar S of size n. We present
two representations of S achieving O (log N) random access time, and either O (n· α k (n)) …

We introduce a new compression scheme for labeled trees based on top trees. Our
compression scheme is the first to simultaneously take advantage of internal repeats in the …