Short bio
Since January 2024, I hold a permanent research position (CNRS) at LIS in Marseille, in the MOVE team. From January 2022 to December 2023, I was a postdoc under Michał Pilipczuk at MIMUW, University of Warsaw. From September 2018 to October 2021, I was a PhD student at IRIF in Paris, under the supervision of Nathanaël Fijalkow and Olivier Serre. Before that, I studied theoretical computer science and mathematics at École Normale Supérieure de Lyon.
Research
My current research involves structural and algorithmic aspects of infinite duration games, as well as different problems related to logics on graphs. In the past, I have also worked on verification, arithmetic circuits, stochastic control, and a bit of AI.
Thesis
- Monotonic graphs for parity and mean-payoff games, defended December 13th, slides
Journals
- Characterizing positionality in games of infinite duration over infinite graphs, TheoretiCS, 2023
- Controlling a random population, Logical Methods in Computer Science, 2022
- The theory of universal graphs for infinite duration games, Logical Methods in Computer Science, 2021
- Lower bounds for arithmetic circuits via the Hankel matrix, Computational Complexity, 2021
- Semialgebraic invariant synthesis for the Kannan-Lipton orbit problem, Theory of Computing Systems, 2019
Conferences
- Positionality in Sigma2 and a completeness result, STACS, 2024
- Flipper games for monadically stable graph classes, ICALP, 2023
- Canonical decompositions in monadically stable and bounded shrubdepth graph classes, ICALP, 2023
- Characterising memory in infinite games, ICALP, 2023
- A technique to speed up symmetric attractor-based algorithms for parity games, FSTTCS, 2022
- Characterizing positionality in games of infinite duration over infinite graphs, LICS, 2022
- The GKK Algorithm is the Fastest over Simple Mean-Payoff Games, CSR, 2022
- Scaling Neural Program Synthesis with Distribution-based Search, AAAI, 2022
- New Algorithms for Combinations of Objectives using Separating Automata, Gandalf, 2021
- The complexity of mean payoff games using universal graphs, MFCS, 2020
- Lower bounds for arithmetic circuits via the Hankel matrix, STACS, 2022
- Controlling a Random Population, FoSSaCS, 2020
- On the Monniaux Problem in Abstract Interpretation, SAS, 2019
- Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem, STACS, 2017
Preprints
- Rank-decreasing transduction, arxiv, 2024
- Half-positional omega-regular languages, arxiv, 2024
- Fast value iteration for energy games, arxiv, 2021
Some recent sets of slides
- Rank-decreasing transductions
- Positionality of omega-regular objectives
- FO model-checking on graphs
- Positionality in Sigma2
- Games of infinite duration memory
- The GKK algorithm is fastest over simple mean-payoff games " (short version)"
- Positionality via monotonic graphs " (short version)"
- Solving energy games by hand
- Monotonic graphs for positional games (short version)
- Controlling a random population
- Arithmetic circuit lower bounds via the Hankel matrix
- Solving mean payoff games with universal graphs
| Location | |
| LIS, campus de Luminy Bureau 05.20 Batiment TPR2 163 Avenue de Luminy Marseille 13009 |
 |