Pages that link to "Item:Q3833604"
From MaRDI portal
The following pages link to Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms (Q3833604):
Displaying 49 items.
- Testing a simple polygon for monotonicity optimally in parallel (Q688449) (← links)
- Geometric Knapsack problems (Q689105) (← links)
- Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy (Q760204) (← links)
- Parallel general prefix computations with geometric, algebraic, and other applications (Q916378) (← links)
- Parallel triangulation of a polygon in two calls to the trapezoidal map (Q1104087) (← links)
- Parallel computational geometry (Q1115600) (← links)
- Optimal parallel algorithms for point-set and polygon problems (Q1187196) (← links)
- Parallel computational geometry of rectangles (Q1187198) (← links)
- Optimal randomized parallel algorithms for computational geometry (Q1187202) (← links)
- Parallel rectilinear shortest paths with rectangular obstacles (Q1190293) (← links)
- Line-segment intersection reporting in parallel (Q1193518) (← links)
- The weighted maximum independent set problem in permutation graphs (Q1195927) (← links)
- Parallel fractional cascading on hypercube multiprocessors (Q1196294) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
- Constructing the Voronoi diagram of a set of line segments in parallel (Q1206435) (← links)
- On parallel rectilinear obstacle-avoiding paths (Q1314529) (← links)
- Parallel algorithms for permutation graphs (Q1314630) (← links)
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488) (← links)
- Parallel solutions to geometric problems in the scan model of computation (Q1318471) (← links)
- Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors (Q1343464) (← links)
- Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems (Q1389649) (← links)
- Planar stage graphs: Characterizations and applications (Q1392202) (← links)
- Sorting signed permutations by reversals, revisited (Q1775771) (← links)
- Constructing arrangements optimally in parallel (Q1802221) (← links)
- A nearly optimal deterministic parallel Voronoi diagram algorithm (Q1817002) (← links)
- Applications of a strategy for designing divide-and-conquer algorithms (Q1821558) (← links)
- A fast Las Vegas algorithm for triangulating a simple polygon (Q1823686) (← links)
- Lower bounds for intersection searching and fractional cascading in higher dimension (Q1887711) (← links)
- Parallelization of divide-and-conquer in the Bird-Meertens formalism (Q1906040) (← links)
- Parallel algorithms for arrangements (Q1907232) (← links)
- Sweep methods for parallel computational geometry (Q1907233) (← links)
- Optimal cooperative search in fractional cascaded data structures (Q1907234) (← links)
- Solutions of two minmax recurrences in parallel processing with variable recombination overhead (Q1914668) (← links)
- Massive parallelization of divide-and-conquer algorithms over powerlists (Q1916359) (← links)
- On the multisearching problem for hypercubes (Q1917039) (← links)
- Recursion and parallel algorithms in geometric modeling problems (Q1956990) (← links)
- An addendum to parallel methods for visibility and shortest-path problems in simple polygons (Q2366233) (← links)
- On coding labeled trees (Q2381521) (← links)
- A data-parallel formulation for divide and conquer algorithms (Q2765229) (← links)
- Pipelines for Divide-and-Conquer Functions (Q4039036) (← links)
- AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS (Q4513236) (← links)
- ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS (Q4682161) (← links)
- OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS (Q4762912) (← links)
- OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS (Q4819957) (← links)
- Parallel construction of quadtrees and quality triangulations (Q5060112) (← links)
- A centroid labelling technique and its application to path selection in trees (Q5096953) (← links)
- Rectangulating rectilinear polygons in parallel (Q6064015) (← links)
- Divide and conquer: a granular concept-cognitive computing system for dynamic classification decision making (Q6167411) (← links)
- Applications of a numbering scheme for polygonal obstacles in the plane (Q6487421) (← links)