On the Complexity of Maintaining Partial Sums

descriptionPublicationkeyboard_double_arrow_right Article 01 May 1985 English Publisher:Society for Industrial & Applied Mathematics (SIAM)Journal:SIAM Journal on Computing, volume 14, pages 277-288 (issn: 0097-5397, eissn: 1095-7111,

Copyright policy )

Authors: Andrew Chi-Chih Yao;

doi: 10.1137/0214022

On the Complexity of Maintaining Partial Sums

- Summary
- Subjects
- Metrics

Abstract

Let \(F=\{(r_ i,s_ i)|\) \(0\leq i

Keywords

Data structures, Information storage and retrieval of data, Analysis of algorithms and problem complexity, partial sum problem, space-time tradeoff, lower bound, range query, database

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	58
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%