Given an array of size n from a total order, we consider the problem of
...
We design succinct encodings of series-parallel, block-cactus and 3-leaf...
We consider the problem of designing succinct navigational oracles, i.e....
We consider the problem of designing succinct data structures for interv...
Given a string S of n integers in [0,σ), a range minimum query
RMQ(i, j)...
We consider the problem of encoding two-dimensional arrays, whose elemen...
Indexing of static and dynamic sets is fundamental to a large set of
app...
This short note provides space-efficient linear time algorithms for comp...