VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.
Randomized Algorithms and Probabilistic Methods
Last Updated: 2026-02-05 15:25:12
Abstract
Las-Vegas & Monte-Carlo alg; inequalities of Markov, Chebyshev, Chernoff; negative correlation; Markov chains: convergence, rapidly mixing; generating functions; Examples include: min cut, median, balls and bins, routing in hypercubes, 3SAT, card shuffling, random walks
Content
Randomized Algorithms are algorithms that "flip coins" to take certain decisions. This concept extends the classical model of deterministic algorithms and has become very popular and useful within the last twenty years. In many cases, randomized algorithms are faster, simpler or just more elegant than determinictic ones. In the course, we will discuss basic principles and techniques and derive from them a number of randomized methods for problems in different areas.
Resources
Lecture Notes
Yes.
General Information
- Language
- English
- Levels
- BSC , DS , DR , MSC , WBZ
- Frequency
- Yearly recurring
Examination
- Type
- end-of-semester examination
Course Components
| Type | Title | Time & Place | Hours |
|---|---|---|---|
| lecture | Randomized Algorithms and Probabilistic Methods |
|
3 h weekly |
| exercise | Randomized Algorithms and Probabilistic Methods |
|
2 h weekly |