On the Complexity of Maintaining Partial Sums
From MaRDI portal
Recommendations
Cited in
(31)- The effect of corners on the complexity of approximate range searching
- On estimating the complexity of logarithmic decomposition
- Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems
- Dynamic orthogonal range queries in OLAP.
- Lower bounds on zero-one matrices.
- An efficient algorithm for solving the partial sum query problem
- Quasi-optimal range searching in spaces of finite VC-dimension
- Lower bounds for dynamic algebraic problems
- An algorithm for handling many relational calculus queries efficiently.
- Lower bounds for set intersection queries
- Linear-space data structures for range mode query in arrays
- Lower bounds for off-line range searching
- Biased range trees
- Array range queries
- THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE
- Orbital model for a class of algorithms solving the partial sums problem
- Lower Bounds on the Complexity of Polytope Range Searching
- Range Medians
- Tight lower bounds for halfspace range searching
- Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums
- Simplex Range Searching and Its Variants: A Review
- Placing resources in a tree: dynamic and static algorithms
- Succinct partial sums and Fenwick trees
- Towards optimal range medians
- Tight bounds for the partial-sums problem
- Partial sums on the ultra-wide word RAM
- The optimal all-partial-sums algorithm in commutative semigroups and its applications for image thresholding segmentation
- Dynamic and static algorithms for optimal placement of resources in a tree
- How hard is half-space range searching?
- Query time versus redundancy trade-offs for range queries
- On the time-space complexity of reachability queries for preprocessed graphs
This page was built for publication: On the Complexity of Maintaining Partial Sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3678702)
