Distributed algorithms are algorithms that are designed to run on a network of multiple computers. In this seminar, we explore recent topics in the theoretical foundations of distributed and parallel computing. We will focus on issues related to computability (i.e., what can and cannot be computed by distributed algorithms) and computational complexity (i.e., how much computational resources are needed to solve a given problem in a distributed system).During the seminar, the participants will read original research papers, write a seminar report and give a presentation on a selected topic. The participants should be comfortable in reading and writing mathematical proofs. Prior knowledge about distributed systems is not necessary. The seminar is aimed at advanced students who have a strong interest in theoretical computer science and algorithmic questions. In particular, the seminar is well-suited for students who have taken the lecture course ‘Foundations of Distributed Computing’ and who are interested in topics beyond the scope of the lecture course. However, the lecture course is not a prerequisite for successfully completing the seminar.
The language of the seminar will be English.
Vertiefungsschwerpunkt: Algorithmen und Modelle
Die Veranstaltung wurde 1 mal im Vorlesungsverzeichnis SoSe 2025 gefunden:
