Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy
From MaRDI portal
Publication:760204
DOI10.1016/0020-0255(84)90033-1zbMATH Open0554.68020OpenAlexW2026125670MaRDI QIDQ760204FDOQ760204
Authors: Chuan Yi Tang, R. C. T. Lee 
Publication date: 1984
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(84)90033-1
Recommendations
- scientific article; zbMATH DE number 3894470
- A data-parallel formulation for divide and conquer algorithms
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
- Fast algorithms through divide- and combine-and-conquer strategies
- scientific article; zbMATH DE number 5005293
- Optimizing Givens’ Algorithm for Multiprocessors
- Massive parallelization of divide-and-conquer algorithms over powerlists
- Efficient use of parallelism in algorithmic parameter optimization applications
- Paradigms for Fast Parallel Approximability
Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99) Theory of operating systems (68N25)
Cites Work
- Multidimensional divide-and-conquer
- Applications of a Planar Separator Theorem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two algorithms for constructing a Delaunay triangulation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching
- Divide and conquer for linear expected time
- Optimal Sorting Algorithms for Parallel Computers
- Divide-and-Conquer for Parallel Processing
- Combinatorial solutions of multidimensional divide-and-conquer recurrences
- Title not available (Why is that?)
- A Computing Machine Based on Tree Structures
Cited In (13)
- A data-parallel formulation for divide and conquer algorithms
- Optimizing Givens’ Algorithm for Multiprocessors
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strategy-accurate parallel Buchberger algorithms
- Applications of a strategy for designing divide-and-conquer algorithms
- A divide-and-conquer algorithm for constructing relative neighborhood graph
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
- An O(N log N) minimal spanning tree algorithm for N points in the plane
- Using fewer processors to reduce time complexities of semigroup computations
- Pipelines for Divide-and-Conquer Functions
- How evenly should one divide to conquer quickly?
- Massive parallelization of divide-and-conquer algorithms over powerlists
This page was built for publication: Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q760204)
