The Complexity of Maintaining an Array and Computing Its Partial Sums-Reference-Cited by-同舟云学术

The Complexity of Maintaining an Array and Computing Its Partial Sums

Published:1982-01 Issue:1 Volume:29 Page:250-260
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Fredman Michael L.¹

Affiliation:

1. Department of Electrical Engineering and Computer Sciences, University of California at San Diego, La Jolla, CA

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference4 articles.

1. AHO A V HOPCROFT J E AND ULLMAN J D The Design and Analysis of Computer Algorithms Addison-Wesley Reading Mass. 1974 AHO A V HOPCROFT J E AND ULLMAN J D The Design and Analysis of Computer Algorithms Addison-Wesley Reading Mass. 1974

2. BURKHARD W A Fg~I~MAN M L ANO KLEIXMAN D J Inherent complexny trade-offs for range query problems Theor. Comput. Sat. (to appear) BURKHARD W A Fg~I~MAN M L ANO KLEIXMAN D J Inherent complexny trade-offs for range query problems Theor. Comput. Sat. (to appear)

3. A Lower Bound on the Complexity of Orthogonal Range Queries

Cited by 53 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Access-Redundancy Tradeoffs in Quantized Linear Computations;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25

2. Surreal Birthdays and Their Arithmetic;Mathematics Magazine;2023-05-27

3. Partial sums on the ultra-wide word RAM;Theoretical Computer Science;2022-02

4. Lower Bounds for Matrix Factorization;computational complexity;2021-04-02

5. Multidimensional segment trees can do range updates in poly-logarithmic time;Theoretical Computer Science;2021-01