Dynamic layers of maxima with applications to dominating queries
From MaRDI portal
Publication:827327
DOI10.1016/j.comgeo.2020.101699zbMath1468.68081OpenAlexW3048809448MaRDI QIDQ827327
A. N. Papadopoulos, A. Kosmatopoulos, Kostas Tsichlas, Evangelos Kipouridis
Publication date: 7 January 2021
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2020.101699
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Space efficient data structures for dynamic orthogonal range counting
- A new approach to the dynamic maintenance of maximal points in a plane
- The design of dynamic data structures
- In-place algorithms for computing (Layers of) maxima
- Worst-case optimal insertion and deletion methods for decomposable searching problems
- Maintenance of configurations in the plane
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- On the dynamic maintenance of maximal points in the plane
- Surpassing the information theoretic bound with fusion trees
- Time bounds for selection
- Three-dimensional layers of maxima
- Probabilistic top-\(k\) dominating queries in uncertain databases
- Dynamic Planar Range Maxima Queries
- Tight(er) worst-case bounds on dynamic searching and priority queues
- Dynamic ordered sets with exponential search trees
- Decomposable searching problems I. Static-to-dynamic transformation
- On Finding the Maxima of a Set of Vectors
- Dynamic Maintenance of Maxima of 2-d Point Sets
- On RAM Priority Queues
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree
- Processing Top-k Dominating Queries in Metric Spaces
- Strict fibonacci heaps
This page was built for publication: Dynamic layers of maxima with applications to dominating queries
