( en | de | ru )

 

Disambiguation of "Casares, Antonio"

Author of the publication

copydeleteadd this publication to your clipboard
Simple and tight complexity lower bounds for solving Rabin games.

, , , , and . SOSA, page 160-167. SIAM, (2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Antonio Casares

Antonio Dell'Aquila

Antonio Wünsch

Antonio Nuzzo

Antonio Galeano

 

Other publications of authors with the same name

On the Minimisation of Transition-Based Rabin Automata and the Chromatic Memory Requirements of Muller Conditions.. CoRR, (2021)Positional ω-regular languages., and . LICS, page 21:1-21:14. ACM, (2024)Half-Positional Objectives Recognized by Deterministic Büchi Automata (Extended Abstract)., , , and . IJCAI, page 6420-6425. ijcai.org, (2023)On the Minimisation of Transition-Based Rabin Automata and the Chromatic Memory Requirements of Muller Conditions.. CSL, volume 216 of LIPIcs, page 12:1-12:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Characterising memory in infinite games., and . CoRR, (2022)Simple and tight complexity lower bounds for solving Rabin games., , , , and . CoRR, (2023)Practical Applications of the Alternating Cycle Decomposition., , , , and . TACAS (2), volume 13244 of Lecture Notes in Computer Science, page 99-117. Springer, (2022)Optimal transformations of Muller conditions., , and . CoRR, (2020)On the Size of Good-For-Games Rabin Automata and Its Link with the Memory in Muller Games., , and . ICALP, volume 229 of LIPIcs, page 117:1-117:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Simple and tight complexity lower bounds for solving Rabin games., , , , and . SOSA, page 160-167. SIAM, (2024)