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}
}
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. 
946 Citations
Approximation Theory and the Design of Fast Algorithms
  • 2
  • PDF
Applications of Randomized Algorithms
A quantum lower bound for distinguishing random functions from random permutations
  • H. Yuen
  • Mathematics, Computer Science
  • Quantum Inf. Comput.
  • 2014
  • 15
  • PDF
Distributed Computing
  • Highly Influenced
Nondeterministic Communication Complexity of Random Boolean Functions
  • PDF
Coin Tossing in Dynamic Programming Is Almost Useless
  • PDF
Random walks in distributed networks and their applications
  • Highly Influenced
  • PDF
...
1
2
3
4
5
...