The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...