13 search results - page 2 / 3 » Cell-Probe Lower Bounds for Succinct Partial Sums |
111
Voted
SWAT
1994
Springer
15 years 5 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...
119
click to vote
KDID
2004
15 years 3 months ago
2004
Abstract. Recent studies demonstrate the usefulness of condensed representations as a semantic compression technique for the frequent itemsets. Especially in inductive databases, c...
152
click to vote
COCO
2005
Springer
15 years 7 months ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
140
Voted
COLT
2008
Springer
15 years 3 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
101
click to vote
ICALP
2005
Springer
15 years 7 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...