Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
From MaRDI portal
Publication:3833604
Recommendations
Cited in
(50)- Sorting signed permutations by reversals, revisited
- Testing a simple polygon for monotonicity optimally in parallel
- Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems
- Planar stage graphs: Characterizations and applications
- Parallel computational geometry
- Parallel computational geometry of rectangles
- A data-parallel formulation for divide and conquer algorithms
- A centroid labelling technique and its application to path selection in trees
- The weighted maximum independent set problem in permutation graphs
- Optimal randomized parallel algorithms for computational geometry
- A fast Las Vegas algorithm for triangulating a simple polygon
- Parallel triangulation of a polygon in two calls to the trapezoidal map
- Constructing arrangements optimally in parallel
- Geometric Knapsack problems
- Divide and conquer: a granular concept-cognitive computing system for dynamic classification decision making
- Parallel methods for visibility and shortest-path problems in simple polygons
- On parallel rectilinear obstacle-avoiding paths
- Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors
- OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
- Rectangulating rectilinear polygons in parallel
- A nearly optimal deterministic parallel Voronoi diagram algorithm
- OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS
- Lower bounds for intersection searching and fractional cascading in higher dimension
- On the multisearching problem for hypercubes
- scientific article; zbMATH DE number 1760062 (Why is no real title available?)
- On coding labeled trees
- Parallelization of divide-and-conquer in the Bird-Meertens formalism
- Sweep methods for parallel computational geometry
- Optimal cooperative search in fractional cascaded data structures
- Solutions of two minmax recurrences in parallel processing with variable recombination overhead
- An addendum to parallel methods for visibility and shortest-path problems in simple polygons
- ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS
- AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS
- Applications of a numbering scheme for polygonal obstacles in the plane
- Parallel algorithms for permutation graphs
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
- Parallel solutions to geometric problems in the scan model of computation
- Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy
- Parallel construction of quadtrees and quality triangulations
- Applications of a strategy for designing divide-and-conquer algorithms
- Parallel rectilinear shortest paths with rectangular obstacles
- Optimal parallel algorithms for point-set and polygon problems
- Parallel general prefix computations with geometric, algebraic, and other applications
- Line-segment intersection reporting in parallel
- Recursion and parallel algorithms in geometric modeling problems
- Parallel fractional cascading on hypercube multiprocessors
- Pipelines for Divide-and-Conquer Functions
- Constructing the Voronoi diagram of a set of line segments in parallel
- Massive parallelization of divide-and-conquer algorithms over powerlists
- Parallel algorithms for arrangements
This page was built for publication: Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833604)
