Thesis: Under the supervision of Monika Henzinger.
My thesis was nominated for the GI dissertation prize, the Award of Excellence from the Austrian government, and the Heinz Zemanek prize.
Publications: (The ordering of the authors is alphabetic.)
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs - Krishnendu Chatterjee , Wolfgang Dvořák, Monika Henzinger, Alexander Svozil - CONCUR 2019
Quasipolynomial Set-Based Symbolic Algorithms for Parity Games - Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger, Alexander Svozil - LPAR 2018
Faster Algorithms for Mean-Payoff Parity Games - Krishnendu Chatterjee, Monika Henzinger, Alexander Svozil - MFCS 2017
Talks:
CONCUR 2019 (Amsterdam) Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs
LPAR 2018 (Awassa, Ethiopia): Quasipolynomial Set-Based Symbolic Algorithms for Parity Games
ICAPS 2018 (Delft): Algorithms and Conditional Lower Bounds for Planning Problems
MFCS 2017 (Aalborg): Faster Algorithms for Mean-Payoff Parity Games