Tight bounds for the partial-sums problem

@inproceedings{Patrascu2004TightBF,
  title={Tight bounds for the partial-sums problem},
  author={Mihai Patrascu and Erik D. Demaine},
  booktitle={SODA},
  year={2004}
}
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract group, we prove an Ω(lg <i>n</i>) lower bound on the number of algebraic operations that must be performed, matching a well-known upper bound. In the RAM model with <i>b</i>-bit memory registers, we consider the well-studied case when the elements of the array can be changed additively by Δ-bit integers. We give a RAM… CONTINUE READING
Highly Cited
This paper has 65 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

65 Citations

0510'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 65 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…