Sebastian Forster performs 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, he mainly works on distributed and dynamic algorithms. Most of his algorithms are for the domain of graphs, which are an abstract model for all kinds of networks. Occasionally, he complements my algorithmic work with hardness results in the realm of fine-grained complexity theory.