Projects per year
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:
- Publications via dblp
- Preprints on arXiv
- Bibliometrics on Google Scholar
- Microblogging on Mastodon
Education/Academic qualification
Computer Science, Dr.techn., Faster Approximation Algorithms for Partially Dynamic Shortest Paths Problems, University of Vienna
1 Oct 2011 → 1 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 2008 → 20 Sept 2011
Award Date: 20 Sept 2011
Computer Science, B.Sc., University of Passau
1 Oct 2005 → 23 Sept 2008
Award Date: 23 Sept 2008
External positions
Postdoctoral Researcher, University of Vienna
1 Jan 2017 → 31 Aug 2017
Postdoctoral Researcher, Max-Planck-Institut fur Informatik
1 Jan 2016 → 31 Dec 2016
Postdoctoral Research Fellow, Simons Institute for the Theory of Computing
19 Aug 2015 → 31 Dec 2015
Internship, Microsoft Research Silicon Valley
7 Apr 2014 → 11 Jul 2014
Research Assistant, University of Vienna
1 Sept 2011 → 18 Aug 2015
Keywords
- 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
Projects
- 3 Active
-
TRoute: Routing für europäische Bahnverbindungen - Lösungskonzepte
Loidl, M., Forster, S. & Werner, C.
20/03/23 → 19/11/23
Project: Research
-
-
-
An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions
Forster, S., Grösbacher, M. & de Vos, T., 1 Feb 2022, 25th International Conference on Principles of Distributed Systems, OPODIS 2021. Bramas, Q., Gramoli, V., Gramoli, V. & Milani, A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 16. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 217).Research output: Chapter in Book/Report/Conference proceeding/Legal commentary › Conference contribution › peer-review
Open Access -
Fast Deterministic Fully Dynamic Distance Approximation
Forster, S., van den Brand, J. & Nazari, Y., 2022, In: Proceedings of FOCS 2022.Research output: Contribution to journal › Article › peer-review
-
Faster Cut Sparsification of Weighted Graphs
Forster, S. & de Vos, T., 1 Jul 2022, 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022. Bojanczyk, M., Merelli, E. & Woodruff, D. P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 61. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 229).Research output: Chapter in Book/Report/Conference proceeding/Legal commentary › Conference contribution › peer-review
Open Access -
Faster Cut Sparsification of Weighted Graphs
Forster, S. & de Vos, T., 2022, In: Algorithmica.Research output: Contribution to journal › Article › peer-review
Open Access -
Minor Sparsifiers and the Distributed Laplacian Paradigm
Forster, S., Goranci, G., Liu, Y. P., Peng, R., Sun, X. & Ye, M., 2022, Proceedings - 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science, FOCS 2021. IEEE Computer Society Press, p. 989-999 11 p. (2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021)).Research output: Chapter in Book/Report/Conference proceeding/Legal commentary › Conference contribution › peer-review
Open Access
Activities
-
Dagstuhl Seminar 22461
Sebastian Forster (Organiser) & Yasamin Nazari (Contributor)
13 Nov 2022 → 18 Nov 2022Activity: Participating in or organising an event › Contribution to an event
-
Distributed Laplacian Solving with Applications
Sebastian Forster (Speaker)
27 Jun 2022Activity: Talk or presentation › Oral presentation › science to science / art to art
-
Dynamische Algorithmen – Neue Werkzeuge für Big Data
Sebastian Forster (Speaker)
15 Jun 2022Activity: Talk or presentation › Oral presentation › science to public / art to public
-
Fast Deterministic Fully Dynamic Distance Approximation
Sebastian Forster (Speaker)
10 May 2022Activity: Talk or presentation › Oral presentation › science to science / art to art
-
18th Scandinavian Symposium and Workshops on Algorithm Theory (Event)
Sebastian Forster (Member)
Feb 2022 → Jun 2022Activity: Membership › Membership of committee