Load balancing, selection sorting on the hypercube
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Deterministic sorting in nearly logarithmic time on the hypercube and related computers
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Parallel algorithms for channel routing in the knock-knee model
SIAM Journal on Computing
An introduction to parallel algorithms
An introduction to parallel algorithms
The Parallel Evaluation of General Arithmetic Expressions
Journal of the ACM (JACM)
Parallel permutation and sorting algorithms and a new generalized connection network
Journal of the ACM (JACM)
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Graph separator theorems and sparse gaussian elimination
Graph separator theorems and sparse gaussian elimination
Computational Aspects of VLSI
All Nearest Smaller Values on the Hypercube
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Parallel algorithms for several important combinatorial problems such as the all nearest smaller values problem, triangulating a monotone polygon, and line packing are presented. These algorithms achieve linear speedups on the pipelined hypercube, and provably optimal speedups on the shuffle-exchange and the cube-connected-cycles for any number p of processors satisfying 1or=por=n/((log/sup 3/n)(loglog n)/sup 2/), where n is the input size. The lower bound results are established under no restriction on how the input is mapped into the local memories of the different processors.