( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Formal Methods with a Touch of Magic.

, , , и . FMCAD, стр. 138-147. IEEE, (2020)

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.

Yehuda Avniel

Karin Avnit

Avni Dörtbudak

Avni Yazan

Avni Mazrreku

 

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

Congestion Games with Multisets of Resources and Applications in Synthesis., , и . FSTTCS, том 45 из LIPIcs, стр. 365-379. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Synthesis from Component Libraries with Costs., и . CONCUR, том 8704 из Lecture Notes in Computer Science, стр. 156-172. Springer, (2014)Infinite-Duration Poorman-Bidding Games., , и . WINE, том 11316 из Lecture Notes in Computer Science, стр. 21-36. Springer, (2018)Run-Time Optimization for Learned Controllers Through Quantitative Games., , , , , и . CAV (1), том 11561 из Lecture Notes in Computer Science, стр. 630-649. Springer, (2019)Quantitative Formal Methods Meets Algorithmic Game Theory (שער נוסף בעברית: שיטות פורמליות כמותיות פוגשות את תורת המשחקים החישובית.).. Hebrew University of Jerusalem, Israel, (2016)Infinite-Duration All-Pay Bidding Games., , и . SODA, стр. 617-636. SIAM, (2021)An Updated Survey of Bidding Games on Graphs (Invited Talk)., и . MFCS, том 241 из LIPIcs, стр. 3:1-3:6. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Bidding Graph Games with Partially-Observable Budgets., , и . AAAI, стр. 5464-5471. AAAI Press, (2023)Formal Methods with a Touch of Magic., , , и . FMCAD, стр. 138-147. IEEE, (2020)Timed Network Games., , и . MFCS, том 83 из LIPIcs, стр. 37:1-37:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)