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.
Topics from this paper
946 Citations
A quantum lower bound for distinguishing random functions from random permutations
- Mathematics, Computer Science
- Quantum Inf. Comput.
- 2014
- 15
- PDF
Quantum collision-resistance of non-uniformly distributed functions: upper and lower bounds
- Physics, Computer Science
- Quantum Inf. Comput.
- 2018
- 10
- PDF
Nondeterministic Communication Complexity of Random Boolean Functions
- Mathematics, Computer Science
- 2016
- PDF