Tight Lower Bound for the Partial-Sums Problem

This is perhaps one of the most fundamental data structure problems. When the values of A[1, . . . , n] are drawn from a semigroup, its static version (where updates are not allowed) has the famous inverse-Ackermann Θ(α(n)) query bound with linear storage [4]; the dynamic version can be easily solved by a binary tree in O(log n) time per operation, and a… CONTINUE READING