Corpus ID: 27376564

Probability and computing: randomized algorithms and probabilistic analysis

@article{Niederreiter2006ProbabilityAC,
  title={Probability and computing: randomized algorithms and probabilistic analysis},
  author={H. Niederreiter},
  journal={Math. Comput.},
  year={2006},
  volume={75}
}

• H. Niederreiter
• Published 2006
• Mathematics, Computer Science
• Math. Comput.

View Paper

eecs.ucf.edu

Save to Library

Create Alert

Cite

Launch Research Feed

Randomized algorithms (making random choices during their execution) play an important role in modern computer science, with applications ranging from combinatorial optimization and machine learning to communications networks and secure protocols. Two advantages of randomization over determinism are crucial in the design of algorithms: simplicity and speed. For many applications, a randomized algorithm is often the simplest algorithm available, the fastest, or both.