Probability and computing: randomized algorithms and probabilistic analysis

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

• Harald Niederreiter
• Published in Math. Comput. 2006

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. 

View Paper

Save to Library

Create Alert

Cite