Various graphs such as web or social networks may contain up to trillions of edges.
Compressing such datasets can accelerate graph processing by reducing the amount of I/O …

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 define and design succinct indexes for several abstract data types (ADTs). The concept
is to design auxiliary data structures that ideally occupy asymptotically less space than the …

The wavelet tree is a flexible data structure that permits representing sequences S [1, n] of
symbols over an alphabet of size σ, within compressed space and supporting a wide range …

We describe a data structure that supports access, rank, and select queries, as well as
symbol insertions and deletions, on a string S 1, n over alphabet 1..σ in time …

We present a succinct representation of a set of n points on an n× n grid using n\lgn+o(n\lgn)
bits to support orthogonal range counting in O(\lgn/\lg\lgn) time, and range reporting in …

We present a data structure that stores a string s 1.. n over the alphabet 1.. σ in nH 0 (s)+ o
(n)(H 0 (s)+ 1) bits, where H 0 (s) is the zero-order entropy of s. This data structure supports …

We present a data structure that stores a sequence s 1.. n over alphabet 1.. σ in
nH_0(s)+o(n)(H_0(s)+1) bits, where H_0(s) is the zero-order entropy of s. This structure …

The topic of this paper is the exploration of the various characteristics of the wavelet tree
data structure, a data structure that was initially proposed for text compression applications …

We explore various techniques to compress a permutation $\pi $ over n integers, taking
advantage of ordered subsequences in $\pi $, while supporting its application $\pi $(i) and …