New Lower Bound Techniques for Dynamic Partial Sums and Related Problems
From MaRDI portal
Recommendations
Cited in
(18)- Dynamic relative compression, dynamic partial sums, and substring concatenation
- Dynamic nested brackets
- Compressed dynamic range majority and minority data structures
- On dynamic bit-probe complexity
- Upper and lower bounds on the power of advice
- Dynamic range majority data structures
- scientific article; zbMATH DE number 1002202 (Why is no real title available?)
- Orbital model for a class of algorithms solving the partial sums problem
- Lower bounds for dynamic connectivity
- On the Complexity of Maintaining Partial Sums
- scientific article; zbMATH DE number 1476488 (Why is no real title available?)
- Lower bounds for dynamic transitive closure, planar point location, and parentheses matching
- Logarithmic Lower Bounds in the Cell-Probe Model
- Tight bounds for the partial-sums problem
- A little advice can be very helpful
- Partial sums on the ultra-wide word RAM
- A generalization of a lower bound technique due to Fredman and Saks
- Internal masked prefix sums and its connection to fully internal measurement queries
This page was built for publication: New Lower Bound Techniques for Dynamic Partial Sums and Related Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4706229)