The postdoc positions are typically for 1 to 2 years, but can possibly be extended. The candidate is expected to have a doctoral degree, or to complete her/his PhD soon. The ideal candidate has a strong background in algorithmic research, with publications in leading TCS conferences or journals, and is interested in working in the area of distributed and parallel algorithms. A background in distributed or parallel algorithms is not necessary. We expressly encourage bright students from maths (in particular pure maths) to apply if they are interested in algorithmic questions. The ideal candidate has an excellent master's (or, in exceptional cases, bachelor's) degree in computer science or a related field. For an introduction to our research, please take a look here. Our newly founded group aims for being one of the leading reseach groups in the area of distributed and parallel algorithms, with a strong emphasis on cutting-edge research. Several PhD and Postdoc positions are available in our group! We are looking for bright and motivated students and researchers interested in working on distributed and parallel algorithms. I received my PhD from ETH in the beginning of 2018, under the supervision of Roger Wattenhofer. Prior to joining CISPA, I was a postdoc in the Discrete and Distributed Algorithms Group at ETH Zurich, led by Mohsen Ghaffari. If you would like to know more about distributed algorithms and the kinds of questions we study, please take a look at the introduction here. If I encounter some interesting problem from a completely different field, I am happy to take a shot at it and collaborate with people knowing more about it than I do. Moreover, I do not feel constrained by area tags. Other more-or-less related topics I am curious about and have worked on include computability/decidability, massively parallel computation, biologically-inspired algorithms, and mobile agents. One of my main goals is to understand the nature of locality in algorithms: What can be computed with access to only a small, local part of the input data? What are the fundamental limitations due to locality, and how can we prove them? Naturally, my research focuses on distributed and parallel algorithms, but I am also interested in understanding how locality affects computation in general, and extending local techniques to a broader range of areas in computer science. My research tackles questions from the area of theoretical computer science, mostly revolving around topics in algorithm design and analysis. I am a tenure-track faculty member at the Helmholtz Center for Information Security (CISPA) in Saarbruecken, Germany.