Article

Free access

Computing partial sums in multidimensional arrays

Authors:

B. Chazelle,

B. RosenbergAuthors Info & Claims

SCG '89: Proceedings of the fifth annual symposium on Computational geometry

Pages 131 - 139

https://doi.org/10.1145/73833.73848

Published: 05 June 1989 Publication History

PDF eReader

References

[1]

Agarwal, P., Sharir, M., Shor, P. Sharp upper and louter bounds on the length of geneml Davenport-Schintel sequences, manuscript, 1988.

Google Scholar

[2]

Alon, N., Schieber, B. Optimal preprocessing for answering on-line product queries, TR 71/87, The Moise and Frida Eskenasy Institute of Computer Science, Tel Aviv University, 1987.

Google Scholar

[3]

Bentley, J.L. Decomposable searching problems, Info. Proc. Lett. 8 (1979), 244-251.

Crossref

Google Scholar

[4]

Bentley, J.L. Multidimensional divide and conquer, Comm. ACM, 23 (1980), 214-229.

Digital Library

Google Scholar

[5]

Bentley, J.L., Maurer, H.A. Deficient worst-case data structures for range searching, Acta Informatica 13 (1980), 155-168.

Digital Library

Google Scholar

[6]

Chazelle, B. Filtering search: a new approach to queryanswering, SIAM J. Comput. 15 (1986), 703-724.

Digital Library

Google Scholar

[7]

Chazelle, B. A functional approach to data structures and its use in multidimensional searching, SIAM J. Comput. 17 (1987), 1988, 427462.

Digital Library

Google Scholar

[8]

Chazelle, B. Lower bounds on the complexity of multidimensional searching, Tech. Rep. CS-TR-055-86, Dept. Computer Science, Princeton University. Abridged version in Proc. 27th Annu. IEEE Symp. on Foundat. of Comput. Sci. (1986), 87-96.

Google Scholar

[9]

Chazelle, B., Guibas, L.J. Fractional cascading: IJ. Applications, Algorithmica 1 (1986), 163-191.

Crossref

Google Scholar

[10]

Fredman, M.L. A lower bound on the complexity of orthogonal range queries, J. ACM 28 (1981), 696-705.

Digital Library

Google Scholar

[11]

Hart, S., Sharir, M. Nonlinearity of Davenport-Schintel sequences and of generalized path compression schemes, Combinatorics 6 (1986), 151-177.

Digital Library

Google Scholar

[12]

Lueker, G.S. A data structure for orthogonal range queries, Proc. 19th Annu. IEEE Symp. on Foundat. of Comput. Sci. (1978), 28-34.

Digital Library

Google Scholar

[13]

Mehlhorn, K. Data structures and algorithms 3: multidimensional searching and computational geometry, Springer-Verlag (1984).

Digital Library

Google Scholar

[14]

Overmars, M.H. The design of dynamic data structures, LNCS, Vol. 156, Springer-Verlag, 1983.

Digital Library

Google Scholar

[15]

Tarjan, R.E. Eficiency of a good but not linear set union algorithm, J. ACM, 22 (1975), 215-225.

Digital Library

Google Scholar

[16]

Tarjan, R.E. Complexity of monotone networks for computing conjunctions, Annals Discrete Math. 2 (1978), 121-133.

Crossref

Google Scholar

[17]

Vaidya, P.M., Space-time tradeofls for orthogonal range queries, Proc. 17th Annu. ACM Symp. on Theory of Comput. (1985), 169-174.

Digital Library

Google Scholar

[18]

Willard, D.E. New data structures for orthogonal range queries, SIAM J. Comput. 14 (1985), 232-253.

Digital Library

Google Scholar

[19]

Willard, D.E. Lower bounds for dynamic range query problems that permit subtraction, Proc. 13th Internat. Coti. on Autom., Langu. and Program. (1986)

Digital Library

Google Scholar

[20]

Willard, D.E., Lueker, G.S. Adding range restriction capability to dynamic data structures, J. ACM 32 (1985), 597-617.

Digital Library

Google Scholar

[21]

Yao, A.C. Space-time tradeoff for answering range queries, Proc. 14th Annu. ACM Symp. on Theory of Comput. (1982), 128-136.

Digital Library

Google Scholar

[22]

Yao, A.C. On the complexity of maintaining partial sums, SIAM J. Comput. 14 (1985), 277-288.

Digital Library

Google Scholar

Cited By

View all

Zhao HFan AOuyang XKoutris P(2024)Conjunctive Queries with Negation and Aggregation: A Linear Time CharacterizationProceedings of the ACM on Management of Data10.1145/36511382:2(1-19)Online publication date: 14-May-2024
https://dl.acm.org/doi/10.1145/3651138
Ramkumar VRaviv NTamo I(2023)Access-Redundancy Tradeoffs in Quantized Linear Computations2023 IEEE International Symposium on Information Theory (ISIT)10.1109/ISIT54713.2023.10206571(1967-1972)Online publication date: 25-Jun-2023
https://doi.org/10.1109/ISIT54713.2023.10206571
Elimelech DFirer MSchwartz M(2021)The Generalized Covering Radii of Linear CodesIEEE Transactions on Information Theory10.1109/TIT.2021.311543367:12(8070-8085)Online publication date: Dec-2021
https://doi.org/10.1109/TIT.2021.3115433
Show More Cited By

Index Terms

Computing partial sums in multidimensional arrays

Recommendations

Model Predictive Control for Partial Differential Equations
Selecting Sums in Arrays
ISAAC '08: Proceedings of the 19th International Symposium on Algorithms and Computation

In an array of n numbers each of the $\binom{n}{2}+n$ contiguous subarrays define a sum. In this paper we focus on algorithms for selecting and reporting maximal sums from an array of numbers. First, we consider the problem of reporting k subarrays inducing ...
Multidimensional systolic arrays for multidimensional DFTs
ICASSP '96: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06

One of the most challenging problems for VLSI implementation of the discrete Fourier transform (DFT) is to efficiently implement multidimensional discrete Fourier transforms with systolic architectures. This paper presents a multidimensional systolic ...

Comments

Information & Contributors

Information

Published In

SCG '89: Proceedings of the fifth annual symposium on Computational geometry

June 1989

401 pages

ISBN:0897913183

DOI:10.1145/73833

Chairman:
Kurt Mehlhorn

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 June 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 625 of 1,685 submissions, 37%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

36
Total Citations
View Citations
548
Total Downloads

Downloads (Last 12 months)59
Downloads (Last 6 weeks)4

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhao HFan AOuyang XKoutris P(2024)Conjunctive Queries with Negation and Aggregation: A Linear Time CharacterizationProceedings of the ACM on Management of Data10.1145/36511382:2(1-19)Online publication date: 14-May-2024
https://dl.acm.org/doi/10.1145/3651138
Ramkumar VRaviv NTamo I(2023)Access-Redundancy Tradeoffs in Quantized Linear Computations2023 IEEE International Symposium on Information Theory (ISIT)10.1109/ISIT54713.2023.10206571(1967-1972)Online publication date: 25-Jun-2023
https://doi.org/10.1109/ISIT54713.2023.10206571
Elimelech DFirer MSchwartz M(2021)The Generalized Covering Radii of Linear CodesIEEE Transactions on Information Theory10.1109/TIT.2021.311543367:12(8070-8085)Online publication date: Dec-2021
https://doi.org/10.1109/TIT.2021.3115433
Elimelech DFirer MSchwartz M(2021)The Generalized Covering Radii of Linear Codes2021 IEEE International Symposium on Information Theory (ISIT)10.1109/ISIT45174.2021.9518233(302-307)Online publication date: 12-Jul-2021
https://dl.acm.org/doi/10.1109/ISIT45174.2021.9518233
Shih ABroeck GBeame PAmarilli AWallach HLarochelle HBeygelzimer Ad'Alché-Buc FFox E(2019)Smoothing structured decomposable circuitsProceedings of the 33rd International Conference on Neural Information Processing Systems10.5555/3454287.3455311(11416-11426)Online publication date: 8-Dec-2019
https://dl.acm.org/doi/10.5555/3454287.3455311
Tang YKan H(2018)Non-orthogonal Homothetic Range Partial-Sum Query on Integer GridsFrontiers in Algorithmics10.1007/978-3-319-78455-7_21(273-285)Online publication date: 21-Mar-2018
https://doi.org/10.1007/978-3-319-78455-7_21
Stølting Brodal GDavoodi PLewenstein MRaman RSatti S(2016)Two dimensional range minimum queries and Fibonacci latticesTheoretical Computer Science10.1016/j.tcs.2016.02.016638:C(33-43)Online publication date: 25-Jul-2016
https://dl.acm.org/doi/10.1016/j.tcs.2016.02.016
Gawrychowski PMozes SWeimann O(2015)Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor SearchAutomata, Languages, and Programming10.1007/978-3-662-47672-7_47(580-592)Online publication date: 20-Jun-2015
https://doi.org/10.1007/978-3-662-47672-7_47
Chan TDurocher SLarsen KMorrison JWilkinson B(2014)Linear-Space Data Structures for Range Mode Query in ArraysTheory of Computing Systems10.1007/s00224-013-9455-255:4(719-741)Online publication date: 1-Nov-2014
https://dl.acm.org/doi/10.1007/s00224-013-9455-2
Gawrychowski PMozes SWeimann O(2014)Improved Submatrix Maximum Queries in Monge MatricesAutomata, Languages, and Programming10.1007/978-3-662-43948-7_44(525-537)Online publication date: 2014
https://doi.org/10.1007/978-3-662-43948-7_44
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Model Predictive Control for Partial Differential Equations

Selecting Sums in Arrays

Multidimensional systolic arrays for multidimensional DFTs