The course will provide an introduction to the theoretical foundations of distributed computing. The focus will be on the design and analysis of distributed algorithms and proving lower bounds for distributed computing tasks.
The course covers three major themes in the distributed computing: (1) locality of information, (2) communication as a computational resource, and (3) fault-tolerance. We will study several models of distributed computation that shed light on these aspects. The participants will learn how to prove mathematical statements about these models, both positive (e.g., that certain problems can be solved fast in the distributed setting) and negative results (e.g., that in a given model, certain problems cannot be solved at all).
- Kursverantwortliche/r: Joel Rybicki