LEARNING OUTCOMES
After this course, you will be able to design and analyse efficient distributed algorithms for problems that are related to computer networks and other distributed systems. You will also know how to prove that your algorithm is as fast as possible, i.e., the same problem cannot be solved faster with any distributed algorithm.
Credits: 5
Schedule: 22.10.2024 - 05.12.2024
Teacher in charge (valid for whole curriculum period):
Teacher in charge (applies in this implementation): Jukka Suomela
Contact information for the course (applies in this implementation):
CEFR level (valid for whole curriculum period):
Language of instruction and studies (applies in this implementation):
Teaching language: English. Languages of study attainment: English
CONTENT, ASSESSMENT AND WORKLOAD
Content
valid for whole curriculum period:
This course provides an introduction to the theory of distributed algorithms. The topics include algorithmic techniques that can be used to solve graph problems efficiently in very large networks, as well as fundamental impossibility results that set limits to distributed computing.
Assessment Methods and Criteria
valid for whole curriculum period:
Exams and exercises.
Workload
valid for whole curriculum period:
Lectures, exercise, and exercise sessions.
DETAILS
Study Material
valid for whole curriculum period:
Freely available online.
Substitutes for Courses
valid for whole curriculum period:
Prerequisites
valid for whole curriculum period:
FURTHER INFORMATION
Further Information
valid for whole curriculum period:
Teaching Language: English
Teaching Period: 2024-2025 Autumn II
2025-2026 Autumn II