Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy

DOI10.1016/0020-0255(84)90033-1zbMath0554.68020OpenAlexW2026125670MaRDI QIDQ760204

Chuan Yi Tang, Richard Chia-Tung 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

zbMATH Keywords

design of parallel algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25) Algorithms in computer science (68W99)

Related Items

An O(N log N) minimal spanning tree algorithm for N points in the plane, A divide-and-conquer algorithm for constructing relative neighborhood graph, Using fewer processors to reduce time complexities of semigroup computations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multidimensional divide-and-conquer
• Divide and conquer for linear expected time
• Divide-and-Conquer for Parallel Processing
• Combinatorial solutions of multidimensional divide-and-conquer recurrences
• Two algorithms for constructing a Delaunay triangulation
• Applications of a Planar Separator Theorem
• Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching
• Optimal Sorting Algorithms for Parallel Computers
• A Computing Machine Based on Tree Structures