Algorithms and hardness for multidimensional range updates and queries
From MaRDI portal
Cites work
- A (slightly) faster algorithm for klee's measure problem
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- A new algorithm for optimal 2-constraint satisfaction and its implications
- Detecting short directed cycles using rectangular matrix multiplication and dynamic programming
- Dynamic orthogonal range queries in OLAP.
- Equivalences between triangle and range query problems
- Faster Linear-space Orthogonal Range Searching in Arbitrary Dimensions
- Finding four-node subgraphs in triangle time
- Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
- Klee's measure problem made easy
- Matching triangles and basing hardness on an extremely popular conjecture
- Multidimensional binary search trees used for associative searching
- New Upper Bounds in Klee’s Measure Problem
- Orthogonal range reporting and rectangle stabbing for fat rectangles
- Orthogonal Range Reporting in Three and Higher Dimensions
- Orthogonal range reporting, query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
- Orthogonal range searching on the RAM, revisited
- Subcubic equivalences between path, matrix and triangle problems
- Tight hardness results for maximum weight rectangles
- Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture
- Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
This page was built for publication: Algorithms and hardness for multidimensional range updates and queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229321)
