My research interests lie in the intersection of logic, formal languages and games on graphs. More speifically, my research focuses on ω-automata, transducers and algorithms for solving infinite duration games.
Slides (Opens in a browser. Visualization in different browsers/computers might slightly differ.)
Research
A full list of my publications can also be found in my dblp and Google Scholar sites.
Journals
From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism (with Thomas Colcombet, Nathanaël Fijalkow and Karoliina Lehtinen), TheoretiCS 2024 - pdf - bibtex.
The Complexity of Simplifying ω-Automata through the Alternating Cycle Decomposition (with Corto Mascle). In: MFCS 2024 (to appear) - short version - full version.
Simple and Tight Complexity Lower Bounds for Solving Rabin Games (with Marcin Pilipczuk, Michał Pilipczuk, Uéverton S. Souza, K. S. Thejaswini). In: SOSA 2024 - pdf - bibtex.
Half-Positional Objectives Recognized by Deterministic Büchi Automata (with Patricia Bouyer, Mickael Randour and Pierre Vandenhove). In: CONCUR 2022 - short version - full version - bibtex.
On the Size of Good-For-Games Rabin Automata and Its Link with the Memory in Muller Games (with Thomas Colcombet and Karoliina Lehtinen). In: ICALP 2022 - pdf - bibtex.
Practical Applications of the Alternating Cycle Decomposition (with Alexandre Duret-Lutz, Klara J. Meyer, Florian Renkin and Salomon Sickert). In: TACAS 2022 - full version - bibtex.
On the Minimisation of Transition-Based Rabin Automata and the Chromatic Memory Requirements of Muller Conditions. In: CSL 2022 - short version - full version - bibtex. Best Student Paper Award.
Optimal Transformations of Games and Automata using Muller Conditions (with Thomas Colcombet and Nathanaël Fijalkow). In: ICALP 2021 - conf. version - journal version - bibtex.
Preprints
Fast Value Iteration for Energy Games (with Pierre Ohlmann), 2021 - pdf - bibtex.
Talks
Some slides and other resources
State-Based vs Transition-Based Acceptance in ω-Automata - slides.
Minimisation of (History) Deterministic Generalised (co)Büchi Automata - slides.
Characterization of Half-Positionality for ω-Regular Languages - slides - poster.
Half-Positional Objectives Recognized by Deterministic Büchi Automata - slides.
On a Correspondence Between Memory Structures for Muller Games and Rabin Automata.- slides.
Good-For-Games Rabin Automata and the Memory Requirements of Muller Conditions.- slides- poster.
Minimisation of Transition-Based Rabin Automata - slides - poster.
Optimal Transformations of Games and Automata using Muller Conditions - slides.
Open Problem: Memory Requirements for Generalised Reachability
games - poster.
