I am an associate professor (maître de conférences) in Theoretical Computer Science at Aix-Marseille Université and LIS. My research interests lie at the intersection of logic, formal languages and games on graphs, with a particular focus on automata over infinite words.
My thesis has been awarded the "Science and technology" prize from the University of Bordeaux! (link)
Book chapters
Chapter Positionality and Memory in the book Games on Graphs: From Logic and Automata to Algorithms (coauthored by Pierre Ohlmann and Pierre Vandenhove) - arxiv link - bibtex of chapter.
Publications in peer-reviewed journals and conference proceedings
Layered automata: A canonical model for
automata over infinite words (with Christof Löding and Igor Walukiewicz). In: LICS 2026 - pdf.
Automata for MSO over Infinite Trees with Quantification over
Borel Sets of Branches (with Mikołaj Bojańczyk, Sven Manthe and Paweł Parys). In: LICS 2026.
Fast value iteration: A uniform approach to efficient algorithms for energy games (with Michaël Cadilhac and Pierre Ohlmann). In: TACAS 2025 - pdf.
From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism (with Thomas Colcombet, Nathanaël Fijalkow and Karoliina Lehtinen). In: TheoretiCS (2024) - pdf - bibtex.
On the Minimisation of Deterministic and History-Deterministic Generalised (co)Büchi Automata (with Olivier Idir, Denis Kuperberg, Corto Mascle and Keya Prakash). In: CSL 2025 - pdf.
The Complexity of Simplifying ω-Automata through the Alternating Cycle Decomposition (with Corto Mascle). In: MFCS 2024 - short version - full version- bibtex.
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 & IJCAI 2023 & LMCS (2024) - journal version - conf version - extended abstract - 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 and submissions
History-Deterministic Büchi Automata are Succinct (with Keya Prakash and K.S Thejaswini). Submitted to: ICALP 2027 - pdf.
Infinite lexicographic products of positional objectives (with Pierre Ohlmann, Michał Skrzypczak and Igor Walukiewicz). Submitted to: LMCS - pdf.
A positional Π30-complete objective (with Pierre Ohlmann and Pierre Vandenhove), 2024 - pdf - bibtex.
Talks
Some slides and other resources
Layered Automata: A Canonical Model for ω-Regular Languages - pdf - animated slides.
