En | Fr | Es

Antonio Casares Santos

I am a postdoctoral researcher in Theoretical Computer Science at the University of Warsaw (Poland), working in the group of Mikołaj Bojańczyk.

My research interests lie in the intersection of logic, formal languages and games on graphs. More specifically, my research focuses on ω-automata, transducers and algorithms for solving infinite duration games.

I received my doctoral degree in 2023 from the University of Bordeaux, under the supervision of Thomas Colcombet, Nathanaël Fijalkow and Igor Walukiewicz. Before that, I obtained my master's degree in Mathematical Logic and Foundations of Computer Science at Université de Paris-Cité (France).

You will find more information in my CV.

PhD Thesis

I defended my PhD thesis entitled Structural properties of automata over infinite words and memory for games on 23 November 2023. Below you can find:

Manuscript of the thesis (pdf)
How to cite (bibtex)
Slides (Opens in a browser. Visualization in different browsers/computers might slightly differ.)

My thesis has been awarded the "Science and technology" prize from the University of Bordeaux! (link)

Research

A full list of my publications can also be found in my dblp and Google Scholar sites.

Publications in peer-reviewed journals and conference proceedings

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.
Positional ω-regular languages (with Pierre Ohlmann). In: LICS 2024 - short version - full version- bibtex.
On the Minimisation of Deterministic and History-Deterministic Generalised (co)Büchi Automata (with Olivier Idir, Denis Kuperberg, Corto Mascle and Aditya 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.
Characterising Memory in Infinite Games (with Pierre Ohlmann). In: ICALP 2023 - full version - short version - bibtex.
Half-Positional Objectives Recognized by Deterministic Büchi Automata (with Patricia Bouyer, Mickael Randour and Pierre Vandenhove). In: CONCUR 2022 & IJCAI 2023 & LMCS - 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

The memory of ω-regular and BC(Σ₂) objectives (with Pierre Ohlmann). Submitted to: ICALP 2025 - pdf.
A positional Π₃⁰-complete objective (with Pierre Ohlmann and Pierre Vandenhove), 2024 - pdf - bibtex.

Talks

Some slides and other resources

Positionality and Memory of ω-Regular Languages - slides - old slides - poster.
Safety and Liveness. Some thoughts - slides.
A Uniform Framework for Energy Game Solvers - slides.
State-Based vs Transition-Based Acceptance in ω-Automata - slides.
Simplifying ω-Automata through the Alternating Cycle Decomposition - slides.
Minimisation of (History) Deterministic Generalised (co)Büchi Automata - slides.
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.
Can we program without while loops? - slides - old slides in Spanish - video youtube.

Current students

Kacper Lewandowski (University of Warsaw). Master thesis on: History-deterministic coBüchi automata.
Alan Le Brech (ENS Rennes). M1 internship on: Universal value-iteration algorithms for games on graphs.

Teaching

2023 - 2024 (University of Warsaw)

Algorithmic Aspects of Game Theory (Tutorials and some lectures).

Contact

E-mail
antoniocasares [at] mimuw [dot] edu [dot] pl

Location
Office 3.106 (3rd floor in CeNT building) MIMUW, Banacha 2, 02-097 Warsaw (Poland)