( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Improving Priority Promotion for Parity Games.

, , и . Haifa Verification Conference, том 10028 из Lecture Notes in Computer Science, стр. 117-133. (2016)

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.

Daniele Soroldoni

Daniele Silvestro

Daniele Palmisano

Daniele Capriotti

Daniele Gaggero

 

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

Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games., , и . GandALF, том 256 из EPTCS, стр. 121-135. (2017)Solving Mean-Payoff Games via Quasi Dominions., , и . TACAS (2), том 12079 из Lecture Notes in Computer Science, стр. 289-306. Springer, (2020)Solving Parity Games via Priority Promotion., , и . CAV (2), том 9780 из Lecture Notes in Computer Science, стр. 270-290. Springer, (2016)Errata to: "Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games"., и . CoRR, (2023)Improving Priority Promotion for Parity Games., , и . Haifa Verification Conference, том 10028 из Lecture Notes in Computer Science, стр. 117-133. (2016)Semantic flowers for good-for-games and deterministic automata., , , и . Inf. Process. Lett., (марта 2024)An Objective Improvement Approach to Solving Discounted Payoff Games., , и . CoRR, (2024)Priority Promotion with Parysian Flair., , , , и . CoRR, (2021)Solving Infinite Games on Graphs via Quasi Dominions.. University of Naples Federico II, Italy, (2019)base-search.net (ftunivnapoli:oai:fedoa.unina.it:12951).An Objective Improvement Approach to Solving Discounted Payoff Games., , и . GandALF, том 390 из EPTCS, стр. 203-219. (2023)