( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Simple and tight complexity lower bounds for solving Rabin games.

, , , , и . SOSA, стр. 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.

Antonio Casares

Antonio Wünsch

Antonio Accardi

Antonio Pinto

Antonio Bergua

 

Другие публикации лиц с тем же именем

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