Abstract
Randomized algorithms, once viewed as a tool in computational number theory, have by now found widespread application. Growth has been fueled by the two major benefits of randomization: simplicity and speed. For many applications a randomized algorithm is the fastest algorithm available, or the simplest, or both. A randomized algorithm is an algorithm that uses random numbers to influence the choices it makes in the course of its computation. Thus its behavior (typically quantified as running time or quality of output) varies from
Keywords
Randomized algorithmComputer scienceProbabilistic analysis of algorithmsProbabilistic logicAlgorithmSelection (genetic algorithm)Theoretical computer scienceArtificial intelligence
Affiliated Institutions
Related Publications
The theory of signal detectability
The problem of signal detectability treated in this paper is the following: Suppose an observer is given a voltage varying with time during a prescribed observation interval and...
Reentrant polygon clipping
A new family of clipping algorithms is described. These algorithms are able to clip polygons against irregular convex plane-faced volumes in three dimensions, removing the parts...
Terrace Aware Data Structure for Phylogenomic Inference from Supermatrices
In phylogenomics the analysis of concatenated gene alignments, the so-called supermatrix, is commonly accompanied by the assumption of partition models. Under such models each g...
BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data
We propose an improved version of the neighbor-joining (NJ) algorithm of Saitou and Nei. This new algorithm, BIONJ, follows the same agglomerative scheme as NJ, which consists o...
Random Allocation in Observational Data
Conventional observational epidemiology has an unenviable reputation for generating false-positive findings,1,2 or "scares," as others call them.3 In 1993, for example, the New ...
Publication Info
- Year
- 1995
- Type
- book
- Volume
- 28
- Issue
- 1
- Pages
- 33-37
- Citations
- 4069
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
4069
OpenAlex
Cite This
Rajeev Motwani,
Prabhakar Raghavan
(1995).
Randomized Algorithms.
Cambridge University Press eBooks
, 28
(1)
, 33-37.
https://doi.org/10.1017/cbo9780511814075
Identifiers
- DOI
- 10.1017/cbo9780511814075