Applications of parametric searching in geometric optimization
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM (extended abstract)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Provably efficient scheduling for languages with fine-grained parallelism
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Construction of 1-d lower envelopes and applications
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Efficiently approximating polygonal paths in three and higher dimensions
Proceedings of the fourteenth annual symposium on Computational geometry
Provably efficient scheduling for languages with fine-grained parallelism
Journal of the ACM (JACM)
Fast deterministic processor allocation
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Optimal parallel approximation for prefix sums and integer sorting
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On Computing the Upper Envelope of Segments in Parallel
IEEE Transactions on Parallel and Distributed Systems
Randomization helps to perform independent tasks reliably
Random Structures & Algorithms
| Hi-index | 0.00 |
A framework is presented for designing parallel algorithms that may ignore processor allocation. A number of fast approximation algorithms are developed, and it is shown how to use these algorithms to simulate any algorithm that fits this framework in a work-preserving fashion on a randomized CRCW PRAM. Several applications of the approach to parallel computational geometry are given.