Abstract. We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array ...
The rank and select operations over a string of length n from an alphabet of size σ have been used widely in the design of succinct data structures. In many applications, the stri...
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...