The course provides 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 area:(1) locality of information,(2) communication as a computational resource, and(3) how to deal with unreliable communication and computation.During the course, we will introduce and 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).Prerequisites:The course requires basic knowledge of algorithm analysis, discrete mathematics, graph theory, and some elementary probability theory.
The course language will be English.
Die Veranstaltung wurde 1 mal im Vorlesungsverzeichnis WiSe 2024/25 gefunden:
