The Parallel Evaluation of General Arithmetic Expressions
Journal of the ACM (JACM)
Bounds to Complexities of Networks for Sorting and for Switching
Journal of the ACM (JACM)
An optimal routing algorithm for mesh-connected Parallel computers
Journal of the ACM (JACM)
Parallel permutation and sorting algorithms and a new generalized connection network
Journal of the ACM (JACM)
Sorting on a mesh-connected parallel computer
Communications of the ACM
Fast parallel sorting algorithms
Communications of the ACM
Fundamentals of Computer Alori
Fundamentals of Computer Alori
Parallel algorithms for the transitive closure and the connected component problems
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Parallel graph processing using depth-first search and breadth-first search.
Parallel graph processing using depth-first search and breadth-first search.
A study of parallelism in graph theory.
A study of parallelism in graph theory.
Bitonic Sort on a Mesh-Connected Parallel Computer
IEEE Transactions on Computers
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
Interconnections Between Processors and Memory Modules Using the Shuffle-Exchange Network
IEEE Transactions on Computers
IEEE Transactions on Computers
A Model of SIMD Machines and a Comparison of Various Interconnection Networks
IEEE Transactions on Computers
Generalized Connection Networks for Parallel Processor Intercommunication
IEEE Transactions on Computers
Fast parallel matrix inversion algorithms
SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
A Shuffle-Exchange Network with Simplified Control
IEEE Transactions on Computers
Optimal algorithms for parallel polynomial evaluation
Journal of Computer and System Sciences
| Hi-index | 14.98 |
This paper examines the use of binary trees in the design of efficient parallel algorithms. Using binary trees, we develop efficient algorithms for several scheduling problems. The shared memory model for parallel computation is used. Our success in using binary trees for parallel computations, indicates that the binary tree is an important and useful design tool for parallel algorithms.