The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The complexity of problems on probabilistic, nondeterministic, and alternating decision trees
Journal of the ACM (JACM)
Applications of Ramsey's theorem to decision tree complexity
Journal of the ACM (JACM)
Quadratic bounds for hidden line elimination
SCG '86 Proceedings of the second annual symposium on Computational geometry
Two-Dimensional Voronoi Diagrams in the Lp-Metric
Journal of the ACM (JACM)
Multidimensional divide-and-conquer
Communications of the ACM
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
On the Klee`s Measure Problem in Small Dimensions
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Probabilistic, nondeterministic, and alternating decision trees (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Generalized selection and ranking (Preliminary Version)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Lower bounds for algebraic computation trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
IEEE/ACM Transactions on Networking (TON)
An in-place algorithm for Klee's measure problem in two dimensions
Information Processing Letters
Computing the volume of the union of cubes
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
IEEE Transactions on Computers
Visibility maps of segments and triangles in 3D
Computational Geometry: Theory and Applications
A (slightly) faster algorithm for klee's measure problem
Proceedings of the twenty-fourth annual symposium on Computational geometry
A (slightly) faster algorithm for Klee's measure problem
Computational Geometry: Theory and Applications
S-metric calculation by considering dominated hypervolume as klee's measure problem
Evolutionary Computation
Minimum node disjoint path covering for circular-arc graphs
Information Processing Letters
On the complexity of computing the hypervolume indicator
IEEE Transactions on Evolutionary Computation
Short Communication: A faster optimal algorithm for the measure problem
Parallel Computing
Approximating the volume of unions and intersections of high-dimensional geometric objects
Computational Geometry: Theory and Applications
Klee's measure problem on fat boxes in time ∂(n(d+2)/3)
Proceedings of the twenty-sixth annual symposium on Computational geometry
An improved algorithm for computing the volume of the union of cubes
Proceedings of the twenty-sixth annual symposium on Computational geometry
An improved algorithm for Klee's measure problem on fat boxes
Computational Geometry: Theory and Applications
Rectangle-efficient aggregation in spatial data streams
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
The inequality-satisfiability problem
Operations Research Letters
An O(log N) parallel time exact hidden-line algorithm
EGGH'87 Proceedings of the Second Eurographics conference on Advances in Computer Graphics Hardware
| Hi-index | 48.24 |
The decision tree complexity of computing the measure of the union of n (possibly overlapping) intervals is shown to be &OHgr;(n log n), even if comparisons between linear functions of the interval endpoints are allowed. The existence of an &OHgr;(n log n) lower bound to determine whether any two of n real numbers are within ∈ of each other is also demonstrated. These problems provide an excellent opportunity for discussing the effects of the computational model on the ease of analysis and on the results produced.