Succinct Dynamic Data Structures

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 consisting of a sequence of elements which supports insertion, deletion and access of an element at any given index. For the partial sums problem on n non-negative integers of k bits each, we support update operations in O(b) time and sum in O(logb n) time,

• Type: Conference
• Year: 2001
• Where: WADS
• Authors: Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
• Keywords: Algorithms, Partial Sums, Select Queries, Succinct Data Structures, WADS 2001