# Category:Randomized algorithms

Computing portal |

Here is a list of articles in the Randomized algorithms category of the Computing portal that unifies foundations of mathematics and computations using computers.

## Subcategories

This category has the following 2 subcategories, out of 2 total.

## Pages in category "Randomized algorithms"

The following 47 pages are in this category, out of 47 total.

- Randomized algorithm
*(computing)*

### A

- Algorithmic information theory
*(computing)* - Approximate counting algorithm
*(computing)* - Arthur–Merlin protocol
*(computing)* - Atlantic City algorithm
*(computing)* - Average performance
*(computing)* - Average-case complexity
*(computing)* - Averaging argument
*(computing)*

### B

- Basin-hopping
*(computing)* - Baum–Welch algorithm
*(computing)* - Biology Monte Carlo method
*(biology)*

### D

- Derandomization
*(computing)*

### E

- Entropy compression
*(computing)* - Expected linear time MST algorithm
*(computing)*

### F

- First-order second-moment method
*(computing)* - Fisher–Yates shuffle
*(computing)* - Freivalds' algorithm
*(computing)*

### I

- Russell Impagliazzo
*(biography)*

### K

- Karloff–Zwick algorithm
*(computing)*

### L

- Las Vegas algorithm
*(computing)* - Linear partial information
*(computing)* - List update problem
*(computing)*

### M

- Mean field particle methods
*(computing)* - Monte Carlo algorithm
*(computing)* - Monte Carlo method
*(computing)* - Morris method
*(computing)* - Multilevel Monte Carlo method
*(computing)* - Multiplicative weight update method
*(computing)*

### N

- Nested sampling algorithm
*(computing)*

### P

- PCP theorem
*(computing)* - Principle of deferred decision
*(computing)* - Probabilistic analysis of algorithms
*(computing)* - Probabilistic complexity theory
*(computing)* - Probabilistic Turing machine
*(computing)* - Probabilistically checkable proof
*(computing)* - Property testing
*(computing)*

### R

- Random permutation
*(computing)* - Random self-reducibility
*(computing)* - Random serial dictatorship
*(computing)* - Randomized algorithms as zero-sum games
*(computing)* - Reservoir sampling
*(computing)*

### S

- Set balancing
*(computing)* - Simultaneous perturbation stochastic approximation
*(earth)* - Sipser–Lautemann theorem
*(computing)* - Solovay–Strassen primality test
*(computing)*

### W

- With high probability
*(computing)*

### Y

- Yao's principle
*(computing)*