Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

Given a sequence S= s 1 s 2… sn of integers smaller than r= O (polylog (n)), we show how S
can be represented using nH 0 (S)+ o (n) bits, so that we can know any sq, as well as …

Indexing highly repetitive texts—such as genomic databases, software repositories and
versioned text collections—has become an important problem since the turn of the …

We can represent an array of n values from {0, 1, 2} using ceil (n log_2 3) bits (arithmetic
coding), but then we cannot retrieve a single element efficiently. Instead, we can encode …

We introduce LZ-End, a new member of the Lempel–Ziv family of text compressors, which
achieves compression ratios close to those of LZ77 but is much faster at extracting arbitrary …

We consider a generalization of the problem of sup-porting rank and select queries on
binary strings. Given a string of length n from an alphabet of size σ, we give the first …

A compressed full-text self-index represents a text in a compressed form and still answers
queries efficiently. This represents a significant advancement over the (full-) text indexing …

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 …

We present a practical study on the compact representation of sequences supporting rank,
select, and access queries. While there are several theoretical solutions to the problem, only …

We introduce an alternative Lempel-Ziv text parsing, LZ-End, that converges to the entropy
and in practice gets very close to LZ77. LZ-End forces sources to finish at the end of a …