Welcome to the Efficient Algorithms Group
Prof. Sebastian Forster
is awarded with an ERC Starting Grant for the project "Dynamic Algorithms Against Strong Adversaries". The press release can be found here
Our research group focuses on different algorithmic aspects of modern models of computation, such as parallel and
distributed computing. Parallel and distributed algorithms are used to solve
large, computationally intensive problems in science and engineering. We work
on the interface between discrete mathematics, theoretical computer science, and
parallel aspects of computing. We combine various techniques from these fields
to design efficient solutions for problems such as information dissemination,
distributed communication, network exploration, load balancing, and graph
models for large real world networks.
In teaching, we cover the basic course for algorithms and data structures for
1st year students, as well as more advanced courses on algorithms for 3rd year
bachelor and master students. In addition, we run basic courses in theoretical
computer science. We also offer a number of seminars and projects related to
parallel and distributed algorithms.