Removing randomness in parallel computation without a processor penalty
- 1 October 1993
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 47 (2) , 250-286
- https://doi.org/10.1016/0022-0000(93)90033-s
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Probabilistic construction of deterministic algorithms: Approximating packing integer programsJournal of Computer and System Sciences, 1988
- Parallel Merge SortSIAM Journal on Computing, 1988
- An improved parallel algorithm that computes the BFS numbering of a directed graphInformation Processing Letters, 1988
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- An improved parallel algorithm for maximal matchingInformation Processing Letters, 1986
- Parallel Prefix ComputationJournal of the ACM, 1980