Computing the depth distribution of a set of boxes
From MaRDI portal
Publication:2049979
DOI10.1016/j.tcs.2021.06.007OpenAlexW3171513820MaRDI QIDQ2049979
Jérémy Barbay, Javiel Rojas-Ledesma, Pablo Pérez-Lantero
Publication date: 27 August 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.06.007
high dimensional datamatrix multiplicationdepth distributionKlee's measuremaximum depthsets of boxes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Even faster integer multiplication
- An improved algorithm for Klee's measure problem on fat boxes
- Strong computational lower bounds via parameterized complexity
- Efficient algorithms for clique problems
- An improved combinatorial algorithm for Boolean matrix multiplication
- On optimal cuts of hyperrectangles
- Gaussian elimination is not optimal
- Fast multiplication of large numbers
- Tight lower bounds for certain parameterized NP-hard problems
- Bringing Order to Special Cases of Klee’s Measure Problem
- On Klee's measure problem for grounded boxes
- Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model
- Instance-Optimal Geometric Algorithms
- Can the Measure of ∪ n 1 [ a i , b i be Computed in Less Than O(n logn) Steps?]
- Powers of tensors and fast matrix multiplication
- Faster Integer Multiplication
- A (slightly) faster algorithm for klee's measure problem
- A new approach to rectangle intersections part I
- Smallest-last ordering and clustering and graph coloring algorithms
- New Upper Bounds in Klee’s Measure Problem
- On the complexity of computing the measure of ∪[a i ,b i ]
- If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser
- Fast Computation of Output-Sensitive Maxima in a Word RAM
- An improved algorithm for computing the volume of the union of cubes
- k-Degenerate Graphs
