Sebastian Forster

Assoz. Prof. Dipl.-Ing. Dr., BSc.


Research activity per year

If you made any changes in Pure these will be visible here soon.

Personal profile

Research interests

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

Further info

I have previously published under the name Sebastian Krinninger.

Further profiles:

Education/Academic qualification

Computer Science, Dr.techn., Faster Approximation Algorithms for Partially Dynamic Shortest Paths Problems, University of Vienna

1 Oct 20111 Jun 2015

Award Date: 3 Jun 2015

Computational Intelligence, Dipl.-Ing., Combining Supervaluation and Fuzzy Logic Based Theories of Vagueness, Vienna University of Technology

1 Oct 200820 Sept 2011

Award Date: 20 Sept 2011

Computer Science, B.Sc., University of Passau

1 Oct 200523 Sept 2008

Award Date: 23 Sept 2008

External positions

Postdoctoral Researcher, University of Vienna

1 Jan 201731 Aug 2017

Postdoctoral Researcher, Max-Planck-Institut fur Informatik

1 Jan 201631 Dec 2016

Postdoctoral Research Fellow, Simons Institute for the Theory of Computing

19 Aug 201531 Dec 2015

Internship, Microsoft Research Silicon Valley

7 Apr 201411 Jul 2014

Research Assistant, University of Vienna

1 Sept 201118 Aug 2015


  • QA75 Electronic computers. Computer science
  • efficient algorithms
  • dynamic graph algorithms
  • distributed algorithms
  • fine-grained complexity

Fields of Science and Technology Classification 2012 (Level 2, 3-digit codes).

  • 102 Computer Sciences