We consider the problem of designing a succinct data structure for path
...
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 range mode problem where given a sequence and a query ra...
We present linear time in-place algorithms for several basic and
fundam...
Deterministic finite automata are one of the simplest and most practical...
Continuing the recent trend, in this article we design several
space-eff...
We consider the problem of compactly representing the Depth First Search...
We consider the problem of designing succinct data structures for interv...
This short note provides space-efficient linear time algorithms for comp...
Read-only memory model is a classical model of computation to study
time...