Dominance made simple

DOI10.1016/j.ipl.2008.12.006zbMath1209.68590OpenAlexW2021430640MaRDI QIDQ987777

Sanjeev Saxena

Publication date: 16 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.12.006

zbMATH Keywords

algorithmsparallel algorithmscomputational geometryrange querydominance queryorthogonal range query

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items (6)

On succinct representations of binary trees ⋮ Algorithms for testing occurrences of length 4 patterns in permutations ⋮ Point enclosure problem for homothetic polygons ⋮ On space efficient two dimensional range minimum data structures ⋮ Partial dominated schedules and minimizing the total completion time of deteriorating jobs ⋮ On finding fundamental cut sets

Cites Work

• Fractional cascading. I: A data structuring technique
• Optimal cooperative search in fractional cascaded data structures
• Algorithms for three-dimensional dominance searching in linear space.
• FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING
• Parallel Merge Sort
• Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains
• Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values

This page was built for publication: Dominance made simple