A parallel randomized approximation scheme for shortest paths
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Highly efficient dictionary matching in parallel
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Optimal parallel construction of Hamiltonian cycles and spanning trees in random graphs
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
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
Efficient low-contention parallel algorithms
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
Lower bounds for randomized exclusive write PRAMs
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Parallelism in sequential functional languages
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Finding minimum spanning forests in logarithmic time and linear work using random sampling
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
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
Dynamic generation of discrete random variates
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
The QRQW PRAM: accounting for contention in parallel algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A near optimal scheduler for switch-memory-switch routers
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Randomization helps to perform independent tasks reliably
Random Structures & Algorithms
Lower Bounds for Randomized Exclusive Write PRAMs
Theory of Computing Systems
| Hi-index | 0.00 |
It is demonstrated that randomization is an extremely powerful tool for designing very fast and efficient parallel algorithms. Specifically, a running time of O(lg* n) (nearly-constant), with high probability, is achieved using n/lg* n (optimal speedup) processors for a wide range of fundamental problems. Also given is a constant time algorithm which, using n processors, approximates the sum of n positive numbers to within an error which is smaller than the sum by an order of magnitude. A variety of known and new techniques are used. New techniques, which are of independent interest, include estimation of the size of a set in constant time for several settings, and ways for deriving superfast optimal algorithms from superfast nonoptimal ones.