Computing the depth distribution of a set of boxes (Q2049979): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2021.06.007 / rank
Normal rank
 
Property / cites work
 
Property / cites work: If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Computation of Output-Sensitive Maxima in a Word RAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Instance-Optimal Geometric Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for computing the volume of the union of cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for Klee's measure problem on fat boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bringing Order to Special Cases of Klee’s Measure Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A (slightly) faster algorithm for klee's measure problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds for certain parameterized NP-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong computational lower bounds via parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimal cuts of hyperrectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to rectangle intersections part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of computing the measure of ∪[a <sub>i</sub> ,b <sub>i</sub> ] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Integer Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of tensors and fast matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even faster integer multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>k</i>-Degenerate Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest-last ordering and clustering and graph coloring algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Upper Bounds in Klee’s Measure Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of large numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for clique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Klee's measure problem for grounded boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved combinatorial algorithm for Boolean matrix multiplication / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2021.06.007 / rank
 
Normal rank

Latest revision as of 21:32, 16 December 2024

scientific article
Language Label Description Also known as
English
Computing the depth distribution of a set of boxes
scientific article

    Statements

    Computing the depth distribution of a set of boxes (English)
    0 references
    0 references
    0 references
    0 references
    27 August 2021
    0 references
    depth distribution
    0 references
    Klee's measure
    0 references
    matrix multiplication
    0 references
    maximum depth
    0 references
    sets of boxes
    0 references
    high dimensional data
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers