Antonio Casares

Orcid: 0000-0002-6539-2020

Affiliations:
  • University of Bordeaux, LaBRI, France


According to our database1, Antonio Casares authored at least 17 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism.
TheoretiCS, 2024

Half-Positional Objectives Recognized by Deterministic Büchi Automata.
Log. Methods Comput. Sci., 2024

A positional Π<sup>0</sup><sub>3</sub>-complete objective.
CoRR, 2024

On the Minimisation of Deterministic and History-Deterministic Generalised (co)Büchi Automata.
CoRR, 2024

Half-positional ω-regular languages.
CoRR, 2024

Simple and tight complexity lower bounds for solving Rabin games.
Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

The Complexity of Simplifying ω-Automata Through the Alternating Cycle Decomposition.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Positional ω-regular languages.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

2023
Structural properties of automata over infinite words and memory for games. (Propriétés structurelles des automates sur les mots infinis et mémoire pour les jeux).
PhD thesis, 2023

Half-Positional Objectives Recognized by Deterministic Büchi Automata (Extended Abstract).
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Characterising Memory in Infinite Games.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
Practical Applications of the Alternating Cycle Decomposition.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

On the Size of Good-For-Games Rabin Automata and Its Link with the Memory in Muller Games.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

On the Minimisation of Transition-Based Rabin Automata and the Chromatic Memory Requirements of Muller Conditions.
Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022

2021
On the ESL algorithm for solving energy games.
CoRR, 2021

Optimal Transformations of Games and Automata Using Muller Conditions.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Optimal transformations of Muller conditions.
CoRR, 2020


  Loading...