Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums

SIAM Journal on Computing

Volumn 28, Issue 1, 1998, Pages 1-9

  Hampapuram, Haripriyan ^a   Fredman, Michael L ^b  

^a Intrinsa Corporation   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Data structures; Lower bounds; Partial sums

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA REDUCTION; MATHEMATICAL MODELS; PROBLEM SOLVING;

BIWEIGHTED BINARY TREES; PARTIAL SUM PROBLEMS;

DATA STRUCTURES;

EID: 0032057886     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795291598     Document Type: Article

References (8)

1. W. A. BURKHARD, M. L. FREDMAN, AND D. J. KLEITMAN, Inherent complexity trade-offs for range query problems, Theoret. Comput. Sci., 16 (1981), pp. 279-290.
2. P. DIETZ, Optimal algorithms for list indexing and subset rank, Algorithms and Data Structures: Workshop WADS '89, Ottawa, Canada, 1989.
3. M. L. FREDMAN, A lower bound on the complexity of orthogonal range queries, J. Assoc. Comput. Mach., 28 (1981), pp. 696-705.
4. M. L. FREDMAN, The complexity of maintaining an array and computing its partial sums, J. Assoc. Comput. Mach., 29 (1982), pp. 250-260.
5. M. L. FREDMAN AND M. E. SAKS, The cell probe, complexity of dynamic data structures, in Proceedings of 21st ACM Symposium on Theory of Computing, Seattle, WA, 1989, pp. 345-354.
6. H. HAMPAPURAM, The Partial Sum Problem: Tight Upper and Lower Bounds, Ph.D. thesis, Department of Computer Science, Rutgers - The State University of New Jersey, New Brunswick, 1994.
7. R. WILBER, Lower bounds for accessing binary trees with rotations, SIAM J. Comput., 18 (1989), pp. 56-67.
8. A. C. YAO, On the complexity of maintaining partial sums, SIAM J. Comput., 14 (1985), pp. 277-288.