A Fast Algorithm for Three-Dimensional Layers of Maxima Problem

  • Yakov Nekrich
Conference paper

DOI: 10.1007/978-3-642-22300-6_51

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6844)
Cite this paper as:
Nekrich Y. (2011) A Fast Algorithm for Three-Dimensional Layers of Maxima Problem. In: Dehne F., Iacono J., Sack JR. (eds) Algorithms and Data Structures. WADS 2011. Lecture Notes in Computer Science, vol 6844. Springer, Berlin, Heidelberg

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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Yakov Nekrich
    • 1
  1. 1.Department of Computer ScienceUniversity of BonnGermany

Personalised recommendations