Efficient Parallel Convex Hull Algorithms
IEEE Transactions on Computers
IEEE Transactions on Computers
Sorting and computing convex hulls on processor arrays with reconfigurable bus systems
Information Sciences: an International Journal
Constant Time Sorting on Reconfigurable Meshes
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
On the Parallel Computation of the Algebraic Path Problem
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
An Optimal Sorting Algorithm on Reconfigurable Mesh
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
Efficient List Ranking on the Reconfigurable Mesh, with Applications
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
| Hi-index | 0.00 |
List ranking is one of the fundamental techniques in parallel algorithm design. Hayashi, Nakano, and Olariu proposed a deterministic list ranking algorithm that runs in O(log* n) time and a randomized one that runs in O(1) expected time, both on a reconfigurable mesh of size n×n. In this paper we show that the same deterministic and randomized time complexities can be achieved using only O(n1+Ɛ) processors, where Ɛ is an arbitrary positive constant