Angelika Steger: Catalogue data in Autumn Semester 2020 |  |
| Name | Prof. Dr. Angelika Steger |
| Field | Informatik (Theoretische Informatik) |
| Address | Inst. f. Theoretische Informatik ETH Zürich, OAT Z 27 Andreasstrasse 5 8092 Zürich SWITZERLAND |
| steger@inf.ethz.ch | |
| URL | http://www.cadmo.ethz.ch/as/people/professor/asteger/index |
| Department | Computer Science |
| Relationship | Full Professor |
| Number | Title | ECTS | Hours | Lecturers | |
|---|---|---|---|---|---|
| 252-0417-00L | Randomized Algorithms and Probabilistic Methods Does not take place this semester. | 10 credits | 3V + 2U + 4A | A. Steger | |
| Abstract | Las Vegas & Monte Carlo algorithms; 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 | ||||
| Learning objective | After this course students will know fundamental techniques from probabilistic combinatorics for designing randomized algorithms and will be able to apply them to solve typical problems in these areas. | ||||
| 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 deterministic 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. | ||||
| Lecture notes | Yes. | ||||
| Literature | - Randomized Algorithms, Rajeev Motwani and Prabhakar Raghavan, Cambridge University Press (1995) - Probability and Computing, Michael Mitzenmacher and Eli Upfal, Cambridge University Press (2005) | ||||