From post

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.

 

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

Efficient Algorithms for Checking Fast Termination in VASS., , , , и . CoRR, (2017)Runtime Analysis of Probabilistic Programs with Unbounded Recursion., , , и . ICALP (2), том 6756 из Lecture Notes in Computer Science, стр. 319-331. Springer, (2011)Efficient Controller Synthesis for Consumption Games with Multiple Resource Types., , , и . CAV, том 7358 из Lecture Notes in Computer Science, стр. 23-38. Springer, (2012)On-the-fly adaptation of patrolling strategies in changing environments., , , , , и . UAI, том 180 из Proceedings of Machine Learning Research, стр. 244-254. PMLR, (2022)Policy Learning for Time-Bounded Reachability in Continuous-Time Markov Decision Processes via Doubly-Stochastic Gradient Ascent., , , , и . QEST, том 9826 из Lecture Notes in Computer Science, стр. 244-259. Springer, (2016)Space-Efficient Scheduling of Stochastically Generated Tasks., , , и . ICALP (2), том 6199 из Lecture Notes in Computer Science, стр. 539-550. Springer, (2010)Solving Patrolling Problems in the Internet Environment., , и . IJCAI, стр. 121-127. ijcai.org, (2018)xOpat: eXplainable Open Pathology Analysis Tool., , , , , , , , , и . Comput. Graph. Forum, 42 (3): 63-73 (июня 2023)Reachability Games on Extended Vector Addition Systems with States., , и . ICALP (2), том 6199 из Lecture Notes in Computer Science, стр. 478-489. Springer, (2010)Qualitative Reachability in Stochastic BPA Games., , , и . STACS, том 3 из LIPIcs, стр. 207-218. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)