Dominance made simple
From MaRDI portal
Publication:987777
DOI10.1016/J.IPL.2008.12.006zbMATH Open1209.68590OpenAlexW2021430640MaRDI QIDQ987777FDOQ987777
Authors: 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
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Cites Work
- Parallel Merge Sort
- Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
- Fractional cascading. I: A data structuring technique
- Algorithms for three-dimensional dominance searching in linear space.
- Optimal cooperative search in fractional cascaded data structures
- FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING
- Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains
Cited In (10)
- Point enclosure problem for homothetic polygons
- On finding fundamental cut sets
- An improved algorithm for static 3D dominance reporting in the pointer machine
- Partial dominated schedules and minimizing the total completion time of deteriorating jobs
- Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
- On space efficient two dimensional range minimum data structures
- Blockbusting and domineering
- FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING
- On succinct representations of binary trees
- Algorithms for testing occurrences of length 4 patterns in permutations
This page was built for publication: Dominance made simple
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987777)