THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE
From MaRDI portal
Recommendations
- On the Complexity of Maintaining Partial Sums
- Tight bounds for the partial-sums problem
- The computational complexity of asymptotic problems. I: Partial orders
- Complexity of nonuniform computations for certain discrete problems
- The parallel complexity of integer prefix summation
- Some results on computational complexity
- Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors
- On the complexity of some Euclidean optimal summing problems
- Estimation of certain exponential sums arising in complexity theory
- Partial derivatives in arithmetic complexity and beyond
Cited in
(13)- Improved algorithms for the multicut and multiflow problems in rooted trees
- Can visibility graphs be represented compactly?
- Multidimensional segment trees can do range updates in poly-logarithmic time
- Succinct indices for path minimum, with applications
- Orthogonal range searching for text indexing
- Array range queries
- Range minimum query indexes in higher dimensions
- Path Minima in Incremental Unrooted Trees
- The optimal all-partial-sums algorithm in commutative semigroups and its applications for image thresholding segmentation
- How hard is half-space range searching?
- Complexity of linear operators
- High girth augmented trees are huge
- Low-light trees, and tight lower bounds for Euclidean spanners
This page was built for publication: THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3212290)
