Optimal parallel algorithms for computing convex hulls and for sorting
- 1 March 1984
- journal article
- Published by Springer Nature in Computing
- Vol. 33 (1) , 1-11
- https://doi.org/10.1007/bf02243071
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- A complexity theory for unbounded fan-in parallelismPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Parallel permutation and sorting algorithms and a new generalized connection networkJournal of the ACM, 1982
- A Lower Bound to Finding Convex HullsJournal of the ACM, 1981
- A fast convex hull algorithmInformation Processing Letters, 1978
- New Parallel-Sorting SchemesIEEE Transactions on Computers, 1978
- Convex hulls of finite sets of points in two and three dimensionsCommunications of the ACM, 1977
- Geometric complexityPublished by Association for Computing Machinery (ACM) ,1975
- Parallel Processing with the Perfect ShuffleIEEE Transactions on Computers, 1971
- Very high-speed computing systemsProceedings of the IEEE, 1966