Range updates and range sum queries on multidimensional points with monoid weights
From MaRDI portal
Publication:6110077
DOI10.1016/j.comgeo.2023.102030MaRDI QIDQ6110077
Publication date: 31 July 2023
Published in: Computational Geometry (Search for Journal in Brave)
Theory of data (68Pxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposable searching problems
- Intersection joins under updates
- Multidimensional segment trees can do range updates in poly-logarithmic time
- Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
- Upper and Lower Bounds for Dynamic Data Structures on Strings
- On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter
- Counting Triangles under Updates in Worst-Case Optimal Time
- New algorithms and hardness for incremental single-source shortest paths in directed graphs
- Range updates and range sum queries on multidimensional points with monoid weights
- Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
This page was built for publication: Range updates and range sum queries on multidimensional points with monoid weights
