Deterministic Distributed Algorithms
4
Algorithms and machine learning
Advanced studies
The course gives an introduction to the theory of distributed algorithms. The topics include algorithmic techniques that can be used to solve graph problems efficiently in extremely large networks, as well as fundamental impossibility results that put limitations on distributed computing. No prior knowledge of distributed systems is needed, but students are expected to have an interest in algorithmic problems and a basic knowledge of discrete mathematics. Course book: http://www.cs.helsinki.fi/jukka.suomela/dda
Exam
04.05.2012
09.00
B123
Year | Semester | Date | Period | Language | In charge |
---|---|---|---|---|---|
2012 | spring | 13.03-26.04. | 4-4 | English | Jukka Suomela |
Lectures
Time | Room | Lecturer | Date |
---|---|---|---|
Tue 12-14 | D122 | Jukka Suomela | 13.03.2012-26.04.2012 |
Thu 10-12 | D122 | Jukka Suomela | 13.03.2012-26.04.2012 |
Exercise groups
Time | Room | Instructor | Date | Observe |
---|---|---|---|---|
Fri 12-14 | B119 | Juho Hirvonen | 12.03.2012—27.04.2012 |