معرفی
Sebastian Forster is a Professor at the University of Salzburg, affiliated with the Faculty of Digital & Analytical Sciences and the Department of Computer Science. He leads the Big Data Algorithms Group and holds administrative roles as Vice Dean, Local Coordinator of CIVIS Hub 5, and coordinator of the supplementary study programme "Informatikkompetenz für alle." His research focuses on algorithms for big and fast data, particularly distributed and dynamic algorithms applied to graphs, networks, and complexity theory.
- Education:
- Ph.D. in Computer Science (University of Vienna, 2011–2015)
- M.Sc. in Computational Intelligence (Vienna University of Technology, 2008–2011)
- B.Sc. in Computer Science (University of Passau, 2005–2008)
Research Agenda: Forster's work addresses the theoretical and mathematical challenges of prior-free algorithms in the post-Moore's Law era. His key contributions include advancements in graph algorithms, fine-grained complexity, and network science. Recent publications span distributed Laplacian methods, dynamic graph sparsifiers, and approximate shortest path solutions, reflecting a blend of algorithmic design and hardness analysis.
Scientific Awards:
- Heinz Zemanek Award (OCG)
- Award of Excellence (BMWFW)
Academic Service: He has served on program committees for ICALP 2025, STACS 2024, FOCS 2023, and other major conferences. He actively reviews for journals like Journal of the ACM and funding bodies such as BSF and ISF. Co-organized the Dagstuhl Seminar 22461 on Dynamic Graph Algorithms.
