Year: 1994
Type: article
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.
Source: ACM Computing Surveys
Authors: Rajiv Gupta, Scott A. Smolka, Shaji Bhaskar
Institutions: General Electric (United States), Stony Brook University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
Awards: G177218894, The Concurrency Factory- Practical Tools for the Design and Verification of Concurrent Systems, Algebraic Reasoning for Probabilistic and Real-Time Concurrent Systems, Integrated Environments for Formally Based Design and Simulation of Concurrent Systems: A Non-Procedural Approach
OpenAlex ID: W2035721896
