Randomized Algorithms II
4
Algorithms and machine learning
Advanced studies
Design and analysis of randomized algorithms with emphasis on basic Markov chain techniques. Prerequisites: Design and analysis of algorithms and a basic course in probabilities, or equivalent. Randomized algorithms I is not a prerequisite, but is highly recommended. Course book: M. Mitzenmacher, E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press 2005.
Exam
29.04.2013
16.00
A111
| Year | Semester | Date | Period | Language | In charge |
|---|---|---|---|---|---|
| 2013 | spring | 11.03-24.04. | 4-4 | English | Jyrki Kivinen |
Lectures
| Time | Room | Lecturer | Date |
|---|---|---|---|
| Mon 10-12 | B119 | Jyrki Kivinen | 11.03.2013-24.04.2013 |
| Wed 10-12 | B119 | Jyrki Kivinen | 11.03.2013-24.04.2013 |
Exercise groups
| Time | Room | Instructor | Date | Observe |
|---|---|---|---|---|
| Thu 10-12 | B119 | Teppo Niinimäki | 18.03.2013—26.04.2013 |
Information for international students
The lectures and all the material will be in English.
General
Kurssin opetuskieli on englanti. Tarkemmat tiedot tulevat tämän sivun englanninkieliseen versioon.