Tight bounds for the partial-sums problem

Mihai Patrascu, Erik D. Demaine. Tight bounds for the partial-sums problem. In J. Ian Munro, editor, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004. pages 20-29, SIAM, 2004. [doi]

@inproceedings{PaatrascuD04,
  title = {Tight bounds for the partial-sums problem},
  author = {Mihai Patrascu and Erik D. Demaine},
  year = {2004},
  doi = {10.1145/982792.982796},
  url = {http://doi.acm.org/10.1145/982792.982796},
  researchr = {https://researchr.org/publication/PaatrascuD04},
  cites = {0},
  citedby = {0},
  pages = {20-29},
  booktitle = {Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004},
  editor = {J. Ian Munro},
  publisher = {SIAM},
}