Back to homepage
Talks given by Sebastian Forster
- Distributed Laplacian Solving with Applications (→ slides → sources)
29th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2022), Paderborn, Germany, June 2022
- Fast Deterministic Fully Dynamic Distance Approximation (→ slides → sources)
3rd European Meeting on Algorithmic Challenges of Big Data (ACBD 2022), IDEAS NCBR, Warsaw, Poland, May 2022
- Dynamische Algorithmen – Neue Werkzeuge für Big Data (→ slides → sources)
OCG Horizonte Spezial, Austrian Computer Society (OCG), Webinar, December 2020
- Algorithmen sind überall (→ slides → source)
i-Day for high-school students, University of Salzburg, Austria, February 2020
- Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms (→ slides → sources)
Workshop on Recent Trends in Theoretical Computer Science, TTIC, Chicago, IL, USA, January 2020
- Single-Source Shortest Paths: Towards Optimality (→ slides)
Workshop on Advances in Distributed Graph Algorithms (ADGA), New Orleans, LA, USA, October 2018
- A Faster Distributed Single-Source Shortest Paths Algorithm (→ slides)
59th Annual IEEE Symposium on Foundations of Computer Science (FOCS), Paris, France, October 2018
- Towards Optimal Dynamic Graph Compression (→ slides → sources)
Austrian Computer Science Day, Salzburg, Austria, June 2018
- Kidney Exchange Algorithmus (→ slides)
i-Day for high-school students, University of Salzburg, Austria, February 2018
- Towards Optimal Dynamic Graph Sparsification (→ slides)
University of Salzburg, Austria, November 2017
- Brief Announcement: A Note on Hardness of Diameter Approximation (→ slides)
31st International Symposium on Distributed Computing (DISC), Vienna, Austria, October 2017
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models (→ slides)
8th Bertinoro Workshop on Algorithms and Data Structures, June 2017
- Distributed Approximate Single-Source Shortest Paths (→ slides)
University of Copenhagen, Denmark, May 2017
- Fully dynamic all-pairs shortest paths with worst-case update-time revisited (→ slides)
28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Barcelona, Spain, January 2017
- Fully dynamic all-pairs shortest paths with worst-case update-time revisited (→ slides)
University of Trier, Germany, December 2016
- Advances in Fully Dynamic Algorithms with Worst-Case Update Time Guarantees (→ slides)
Dagstuhl Seminar "Structure and Hardness in P", Germany, November 2016
- Fully Dynamic Spanners with Worst-Case Update Time Guarantees (→ slides)
24th European Symposium on Algorithms (ESA), Aarhus, Denmark, August 2016
- Approximate Single-Source Shortest Paths: Distributed and Dynamic Algorithms (→ slides)
MADALGO: Center for Massive Data Algorithmics, Aarhus University, Denmark, August 2016
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (→ slides)
48th Annual ACM SIGACT Symposium on Theory of Computing (STOC), Cambridge, MA, USA, June 2016
- Towards Fully Dynamic Spanners with Worst-Case Update Time
University of Rome, "Tor Vergata", Italy, May 2016
- Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs
42nd International Colloquium on Automata, Languages, and Programming (ICALP), Kyoto, Japan, July 2015
- Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time
7th Bertinoro Workshop on Algorithms and Data Structures, June 2015
- A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths
25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Portland, OR, USA, January 2014
- Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
54th Annual IEEE Symposium on Foundations of Computer Science (FOCS), Berkeley, CA, USA October 2013
- Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs
40th International Colloquium on Automata, Languages, and Programming (ICALP), Riga, Latvia, July 2013
- Polynomial-Time Algorithms for Energy Games with Special Weight Structures
20th European Symposium on Algorithms (ESA), Ljubljana, Slovenia, September 2012
- Validity in a logic that combines supervaluation and fuzzy logic
Workshop on Non-classical logics, Vienna University of Technology, November 2011