## Welcome to my webpage

Postdoc at MIMUW, University of Warsaw

Automata Theory group

Under Michał Pilipczuk

## About

I studied theoretical computer science and mathematics at École Normale Supérieure de Lyon. From September 2018 to October 2021, I have been working on my PhD at IRIF in Paris, under the supervision of Nathanaël Fijalkow and Olivier Serre. From January 2022, I am a postdoc under Michał Pilipczuk at at MIMUW, University of Warsaw. For more details, please see my resume (last updated Jan 2022).

## Research

### Interests

I am currently working primarily on fixed-parameter tractability of the model-checking problem for first-order logic. In my thesis, I have mostly been working on efficiently solving (in theory) parity and mean payoff games. I have also studied problems related to stochastic transition systems (such as Markov Decision Processes or Probabilistic Automata), and have also done some work in algebraic circuit complexity theory, and dynamical systems for verification. My interests range over most of theoretical computer science, and related mathematical theories.

### Thesis

- Monotonic graphs for parity and mean-payoff games, defended December 13th, slides

### Journals

- The theory of universal graphs for infinite duration games, with Nathanaël Fijalkow and Thomas Colcombet, Logical Methods in Computer Science (to appear)
- Controlling a random population, with Nathanaël Fijalkow and Thomas Colcombet, Logical Methods in Computer Science
- Lower Bounds for Arithmetic Circuits via the Hankel Matrix, with Nathanaël Fijalkow, Guillaume Lagarde and Olivier Serre, Computational Complexity
- Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem, with Nathanaël Fijalkow, Joël Ouaknine, Amaury Pouly and James Worrell, Theory of Computing Systems

### Conferences

- 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 Disctribution-based search, with Nathanaël Fijalkow, Guillaume Lagarde, Théo Matricon, Kevin Ellis and Akarsh Potta, AAAI 2022
- New Algorithms for Combinations of Objectives using Separating Automata, with Ashwani Anand, Nathanaël Fijalkow, Aliénor Goubault-Larrecq and Jérôme Leroux, GANDALF 2021
- Lower Bounds for Arithmetic Circuits via the Hankel Matrix, with Nathanaël Fijalkow, Guillaume Lagarde and Olivier Serre, STACS 2020
- Controlling a random population, with Nathanaël Fijalkow and Thomas Colcombet, FoSSaCS 2020
- Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games, with Nathanaël Fijalkow and Paweł Gawrychowski, MFCS 2020
- On the Monniaux Problem in Abstract Interpretation, with Nathanaël Fijalkow, Engel Lefaucheux, Joël Ouaknine, Amaury Pouly and James Worrell, SAS 2019
- Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem, with Nathanaël Fijalkow, Joël Ouaknine, Amaury Pouly and James Worrell, STACS 2017

### Preprints

- A symmetric attractor-decomposition lifting algorithm for parity games , with Marcin Jurdziński, Rémi Morvan and K. S. Thejaswini
- On the ESL algorithm for energy games, with Antonio Casares

### Some recent slides

These are to be openned in a browser- 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 Hankel matrix
- Solving mean payoff games with universal graphs