Algorithms and Complexity Seminar
Summer Term 2026
Seminar topic: Massively Parallel Computation Algorithms
Nowadays, there are many applications that require computations with of vast amounts of data. In such cases, the data cannot be stored and processed on a single computer. In order to simplify the development of parallel algorithms for computations in large clusters of computers, programming frameworks such as MapReduce have been developed first by industry and then also by academia. As a result of this, researchers have developed the so-called Massively Parallel Computation (MPC) model as an abstract theoretical model that allows to develop and analyze algorithms frameworks such as MapReduce. In this seminar, we will look at the most important theoretical literature on algorithms for the MPC model.
Seminar description
To pass the seminar, the students participating in the seminar have to present a research paper (the list of possible papers will soon be published on this webpage). Depending on the number of students participating in the seminar, each paper will have to be prepared and presented by a pair of students. The presentations about each paper will be 45 minutes (approx. 60 mins including questions) so that we have enough time to dive into the papers in sufficient detail to also cover and understand some of the relevant technical details. For the talks, we will have six meetings, each on a Monday between 10:15 and approx. 12:30. Attendance to those meetings is mandatory to pass the seminar. On Monday, 20.04., from 12:15 - 14:00 in room 101-01-016/18, there will be an introductory meeting to the seminar, where we will explain our plan for the seminar in more detail.
Note that you have to sign up to the seminar through HISinOne. The process of how to sign up for seminars and how the assignment of the seminar slots is organized is decribed here.
Topics and Schedule
Below are the six days on which we will have the talks. We will soon also add the list of topics.