Angelika Steger: Catalogue data in Autumn Semester 2020

Award: The Golden Owl
Name Prof. Dr. Angelika Steger
FieldInformatik (Theoretische Informatik)
Address
Inst. f. Theoretische Informatik
ETH Zürich, CAB G 37.2
Universitätstrasse 6
8092 Zürich
SWITZERLAND
Telephone+41 44 632 04 97
Fax+41 44 632 13 99
E-mailsteger@inf.ethz.ch
URLhttp://www.cadmo.ethz.ch/as/people/professor/asteger/index
DepartmentComputer Science
RelationshipFull Professor

NumberTitleECTSHoursLecturers
252-0417-00LRandomized Algorithms and Probabilistic Methods
Does not take place this semester.
10 credits3V + 2U + 4AA. Steger
AbstractLas 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
ObjectiveAfter 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.
ContentRandomized 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 notesYes.
Literature- Randomized Algorithms, Rajeev Motwani and Prabhakar Raghavan, Cambridge University Press (1995)
- Probability and Computing, Michael Mitzenmacher and Eli Upfal, Cambridge University Press (2005)