An optimal speedup algorithm for the measure problem
From MaRDI portal
Recommendations
- A faster optimal algorithm for the measure problem
- A (slightly) faster algorithm for Klee's measure problem
- A (slightly) faster algorithm for klee's measure problem
- A measure \& conquer approach for the analysis of exact algorithms
- Faster algorithms via approximation theory
- An algorithmic determination of optimal measure from data and some applications
- scientific article; zbMATH DE number 4024619
- Optimal algorithms for linear problems with Gaussian measures
- Optimal measuring problem: the computation solution, the program algorithm
- scientific article; zbMATH DE number 992001
Cited in
(8)- A faster optimal algorithm for the measure problem
- Parallel computational geometry of rectangles
- Constant time BSR solutions to \(L_ 1\) metric and digital geometry problems
- Area and perimeter computation of the union of a set of iso-rectangles in parallel
- scientific article; zbMATH DE number 4037198 (Why is no real title available?)
- A speed-up theorem without tape compression
- A parallel algorithm to construct a dominance graph on nonoverlapping rectangles
- An in-place algorithm for Klee's measure problem in two dimensions
This page was built for publication: An optimal speedup algorithm for the measure problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1262771)