Computing the depth distribution of a set of boxes
type: Item
instance of: scholarly article
title: Computing the depth distribution of a set of boxes
author: Jérémy Barbay
author: P. Pérez-Lantero
author: Javiel Rojas-Ledesma
published in: Theoretical Computer Science
publication date: 2021-08-27T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7387693
zbMATH Keywords: depth distribution
zbMATH Keywords: Klee's measure
zbMATH Keywords: matrix multiplication
zbMATH Keywords: maximum depth
zbMATH Keywords: sets of boxes
zbMATH Keywords: high dimensional data
MaRDI profile type: Publication
full work available at URL: j.tcs.2021.06.007
OpenAlex ID: W3171513820
cites work: If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser
cites work: Fast Computation of Output-Sensitive Maxima in a Word RAM
cites work: Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model
cites work: Instance-Optimal Geometric Algorithms
cites work: An improved algorithm for computing the volume of the union of cubes
cites work: An improved algorithm for Klee's measure problem on fat boxes
cites work: Bringing Order to Special Cases of Klee’s Measure Problem
cites work: A (slightly) faster algorithm for klee's measure problem
cites work: Tight lower bounds for certain parameterized NP-hard problems
cites work: Strong computational lower bounds via parameterized complexity
cites work: Q3651735
cites work: On optimal cuts of hyperrectangles
cites work: A new approach to rectangle intersections part I
cites work: On the complexity of computing the measure of ∪[a i ,b i ]
cites work: Faster Integer Multiplication
cites work: Powers of tensors and fast matrix multiplication
cites work: Even faster integer multiplication
cites work: Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps?
cites work: Q4349924
cites work: k-Degenerate Graphs
cites work: Smallest-last ordering and clustering and graph coloring algorithms
cites work: New Upper Bounds in Klee’s Measure Problem
cites work: Q3221403
cites work: Q5743440
cites work: Fast multiplication of large numbers
cites work: Gaussian elimination is not optimal
cites work: Efficient algorithms for clique problems
cites work: On Klee's measure problem for grounded boxes
cites work: An improved combinatorial algorithm for Boolean matrix multiplication
DOI: 10.1016/J.TCS.2021.06.007
Recommended article: Depth distribution in high dimensions
Recommended article: Computing Klee's measure of grounded boxes
Recommended article: On Combinatorial Depth Measures
Recommended article: Computing projection depth and its associated estimators
Recommended article: Computing the Stanley depth
Recommended article: Computing depth orders and related problems
Recommended article: Q3614241
Recommended article: Lower bounds for computing statistical depth.
description: scientific article; zbMATH DE number 7387693