Translator Disclaimer
February, 1993 Randomization in Parallel Algorithms
Vijaya Ramachandran
Statist. Sci. 8(1): 65-69 (February, 1993). DOI: 10.1214/ss/1177011085

Abstract

A randomized algorithm is one that uses random numbers or bits during the runtime of the algorithm. Such algorithms, when properly designed, can ensure a correct solution on every input with high probability. For many problems, randomized algorithms have been designed that are simpler or more efficient than the best deterministic algorithms known for the problems. In this article, we define a natural randomized parallel complexity class, RNC, and give a survey of randomized algorithms for problems in this class.

Citation

Download Citation

Vijaya Ramachandran. "Randomization in Parallel Algorithms." Statist. Sci. 8 (1) 65 - 69, February, 1993. https://doi.org/10.1214/ss/1177011085

Information

Published: February, 1993
First available in Project Euclid: 19 April 2007

zbMATH: 0766.68044
MathSciNet: MR1194445
Digital Object Identifier: 10.1214/ss/1177011085

Rights: Copyright © 1993 Institute of Mathematical Statistics

JOURNAL ARTICLE
5 PAGES


SHARE
Vol.8 • No. 1 • February, 1993
Back to Top