On randomization in sequential and distributed algorithms

Publisher Website
Google Scholar
Abstract
Probabilistic, or randomized, algorithms are fast becoming as commonplace as conventional deterministic algorithms. This survey presents five techniques that have been widely used in the design of randomized algorithms. These techniques are illustrated using 12 randomized algorithms—both sequential and distributed— that span a wide range of applications, including:primality testing(a classical problem in number theory),interactive probabilistic proof systems(a new method of program testing),dining philosophers(a classical problem in distributed computing), andByzantine agreement(reaching agreement in the presence of malicious processors). Included with each algorithm is a discussion of its correctness and its computational complexity. Several related topics of interest are also addressed, including the theory of probabilistic automata, probabilistic analysis of conventional algorithms, deterministic amplification, and derandomization of randomized algorithms. Finally, a comprehensive annotated bibliography is given.

This publication has 216 references indexed in Scilit: