Recommendations
Cites work
- Algorithms for three-dimensional dominance searching in linear space.
- FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING
- Fractional cascading. I: A data structuring technique
- Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
- Optimal cooperative search in fractional cascaded data structures
- Parallel Merge Sort
- Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains
Cited in
(10)- Blockbusting and domineering
- Partial dominated schedules and minimizing the total completion time of deteriorating jobs
- On succinct representations of binary trees
- Algorithms for testing occurrences of length 4 patterns in permutations
- An improved algorithm for static 3D dominance reporting in the pointer machine
- FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING
- Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
- Point enclosure problem for homothetic polygons
- On space efficient two dimensional range minimum data structures
- On finding fundamental cut sets
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)