Research Group
Brandt
Our group tackles questions from the area of theoretical computer science, mostly revolving around topics in algorithm design and analysis. One exemplary goal 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? A particular focus of our research is on distributed and parallel algorithms, but we are also interested in understanding how locality affects computation in general and extending local techniques to a broader range of areas in computer science.
