453 search results - page 1 / 91 » Tight bounds for the partial-sums problem |
108
click to vote
SODA
2010
ACM
14 years 9 months ago
2010
ACM
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 ...
ICALP
2005
Springer
15 years 4 months ago
2005
Springer
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...
104
click to vote
STOC
2012
ACM
13 years 1 months ago
2012
ACM
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 ≥...
PODS
2011
ACM
14 years 1 months ago
2011
ACM
SWAT
1994
Springer
15 years 3 months ago
1994
Springer
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...