Research
We perform basic research on the design and analysis of prior-free algorithms with a strong focus on theoretical and mathematical aspects. Motivated by the end of Moore’s Law and the prevalence of “big” and “fast” data, we mainly work an distributed and dynamic algorithms. Our main expertise lies in the domain of graphs, which are an abstract model for all kinds of networks. Please find more information about specific projects below. We also maintain a list of our publications.
