Optimal randomized parallel algorithms for computational geometry
- 1 June 1992
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 7 (1-6) , 91-117
- https://doi.org/10.1007/bf01758753
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Cascading divide-and-conquer: A technique for designing parallel algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- New applications of random sampling in computational geometryDiscrete & Computational Geometry, 1987
- A logarithmic time sort for linear size networksJournal of the ACM, 1987
- Efficient plane sweeping in parallelPublished by Association for Computing Machinery (ACM) ,1986
- Routing, merging, and sorting on parallel models of computationJournal of Computer and System Sciences, 1985
- Computational GeometryPublished by Springer Nature ,1985
- A probabilistic algorithm for the post office problemPublished by Association for Computing Machinery (ACM) ,1985
- Parallel computational geometryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Sorting inc logn parallel stepsCombinatorica, 1983
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952