Computing the depth distribution of a set of boxes

DOI10.1016/J.TCS.2021.06.007MaRDI QIDQ2049979zbMATH OpenOpenAlexFDO

Authors Jérémy Barbay, P. Pérez-Lantero, Javiel Rojas-Ledesma

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

zbMATH Keywords

depth distributionhigh dimensional dataKlee's measurematrix multiplicationmaximum depthsets of boxes

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Depth distribution in high dimensions
• Computing Klee's measure of grounded boxes
• On Combinatorial Depth Measures
• Computing projection depth and its associated estimators
• Computing the Stanley depth
• Computing depth orders and related problems
• scientific article; zbMATH DE number 5526052
• Lower bounds for computing statistical depth.

Cites work

• k-Degenerate Graphs
• A (slightly) faster algorithm for klee's measure problem
• A new approach to rectangle intersections part I
• An improved algorithm for computing the volume of the union of cubes
• An improved algorithm for Klee's measure problem on fat boxes
• Bringing order to special cases of Klee's measure problem
• Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps?
• Efficient algorithms for clique problems
• Even faster integer multiplication
• Fast computation of output-sensitive maxima in a word RAM
• Fast multiplication of large numbers
• Faster integer multiplication
• Gaussian elimination is not optimal
• Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model
• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• scientific article; zbMATH DE number 7053319 (Why is no real title available?)
• If the current clique algorithms are optimal, so is Valiant's parser
• Instance-optimal geometric algorithms
• Introduction to algorithms.
• New Upper Bounds in Klee’s Measure Problem
• On Klee's measure problem for grounded boxes
• On optimal cuts of hyperrectangles
• On the complexity of computing the measure of ∪[a _i ,b _i ]
• Powers of tensors and fast matrix multiplication
• Smallest-last ordering and clustering and graph coloring algorithms
• Strong computational lower bounds via parameterized complexity
• Tight lower bounds for certain parameterized NP-hard problems

Cited in

(1)

• scientific article; zbMATH DE number 5526052 (Why is no real title available?)

This page was built for publication: Computing the depth distribution of a set of boxes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2049979)