Dynamic Algorithms Against Strong Adversaries (DynASoAr)
This website collects all activity related to the research project "Dynamic Algorithms Against Strong Adversaries (DynASoAr)". The main objective in this project is to develop faster dynamic graph algorithms that are deterministic or come with worst-case update time guarantees. The project is funded by an ERC Starting Grant.
Principal Investigator: Sebastian Forster
Host Institution: University of Salzburg
Funding Agency: European Research Council (ERC)
Duration: 09/2021 – 08/2026
Team Members
- Sebastian Forster, PI
- Elisabeth Riedl, administration
- Emilio Cruciani, postdoc
- Yasamin Nazari, postdoc
- Antonis Skarlatos, PhD student
- Tijn de Vos, PhD student
Former Team Members
- Judith Warter, administration
Publications
- Fast Deterministic Fully Dynamic Distance Approximation
Jan van den Brand, Sebastian Forster, and Yasamin Nazari
63rd IEEE Symposium on Foundations of Computer Science (FOCS), 2022 arXiv - Faster Cut Sparsification of Weighted Graphs
Sebastian Forster and Tijn de Vos
49th EATCS International Colloquium on Automata, Languages, and Programming (ICALP), 2022
arXiv - A Framework for Distributed Quantum Queries in the CONGEST Model
Joran van Apeldoorn and Tijn de Vos
41st ACM Symposium on Principles of Distributed Computing (PODC), 2022
arXiv