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}
}
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. 

Citations

Publications citing this paper.
SHOWING 1-10 OF 1,231 CITATIONS, ESTIMATED 48% COVERAGE

2,592 Citations

0100200300'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 2,592 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…