Tight bounds for the partial-sums problem. Patrascu, M. & Demaine, E. D. In Proceedings of Symposium on Discrete Algorithms (SODA), pages 20-29, 2004.
Tight bounds for the partial-sums problem [link]Paper  bibtex   
@inproceedings{ dblp3720276,
  title = {Tight bounds for the partial-sums problem},
  author = {Mihai Patrascu and Erik D. Demaine},
  author_short = {Patrascu, M. and Demaine, E. D.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {2004},
  key = {dblp3720276},
  id = {dblp3720276},
  biburl = {http://www.dblp.org/rec/bibtex/conf/soda/PaatrascuD04},
  url = {http://dl.acm.org/citation.cfm?id=982792.982796},
  conference = {SODA},
  pages = {20-29},
  text = {SODA 2004:20-29},
  booktitle = {Proceedings of Symposium on Discrete Algorithms (SODA)}
}

Downloads: 0