Abstract
We show that the three-dimensional layers-of-maxima problem can be solved in o(n logn) time in the word RAM model. Our algorithm runs in O(n(loglogn) 3) deterministic time or O(n(loglogn)2) expected time and uses O(n) space. We also describe a deterministic algorithm that uses optimal O(n) space and solves the three-dimensional layers-of-maxima problem in O(n logn) time in the pointer machine model. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Nekrich, Y. (2011). A fast algorithm for three-dimensional layers of maxima problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6844 LNCS, pp. 607–618). https://doi.org/10.1007/978-3-642-22300-6_51
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
