Optimal speeding up of parallel algorithms based upon the divide-and-conquer strategy
- 1 June 1984
- journal article
- Published by Elsevier in Information Sciences
- Vol. 32 (3) , 173-186
- https://doi.org/10.1016/0020-0255(84)90033-1
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Divide-and-Conquer for Parallel ProcessingIEEE Transactions on Computers, 1983
- Divide and Conquer Heuristics for Minimum Weighted Euclidean MatchingSIAM Journal on Computing, 1983
- The Binary Tree as an Interconnection Network: Applications to Multiprocessor Systems and VLSIIEEE Transactions on Computers, 1981
- A general method for solving divide-and-conquer recurrencesACM SIGACT News, 1980
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- Two algorithms for constructing a Delaunay triangulationInternational Journal of Parallel Programming, 1980
- Combinatorial solutions of multidimensional divide-and-conquer recurrencesJournal of Algorithms, 1980
- Divide and conquer for linear expected timeInformation Processing Letters, 1978
- Optimal Sorting Algorithms for Parallel ComputersIEEE Transactions on Computers, 1978
- A Computing Machine Based on Tree StructuresIEEE Transactions on Computers, 1971