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.
"Randomization in Parallel Algorithms." Statist. Sci. 8 (1) 65 - 69, February, 1993. https://doi.org/10.1214/ss/1177011085