New trie data structures which support very fast search operations
Journal of Computer and System Sciences
Bounded ordered dictionaries in O(loglogN) time and O(n) space
Information Processing Letters
Persistence, amortization and randomization
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Eliminating amortization: on data structures with guaranteed response time
Eliminating amortization: on data structures with guaranteed response time
Dynamic maintenance of maximas of 2-d point sets
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Biased finger trees and three-dimensional layers of maxima: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh
IEEE Transactions on Parallel and Distributed Systems
On Finding the Maxima of a Set of Vectors
Journal of the ACM (JACM)
A dichromatic framework for balanced trees
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We present an O(n log n)-time algorithm to solve the three-dimensional layers-of-maxima problem, an improvement over the prior O(n log n log log n)-time solution. A previous claimed O(n log n)-time solution due to Atallah, Goodrich, and Ramaiyer [SCG'94] has technical flaws. Our algorithm is based on a common framework underlying previous work, but to implement it we devise a new data structure to solve a special case of dynamic planar point location in a staircase subdivision. Our data structure itself relies on a new extension to dynamic fractional cascading that allows vertices of high degree in the control graph.