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.

 

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

A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games., , и . CoRR, (2018)The ideal view on Rackoff's coverability technique., и . Inf. Comput., (2021)Verification Column.. ACM SIGLOG News, 10 (1): 23 (января 2023)Safety alternating automata on data words.. ACM Trans. Comput. Log., 12 (2): 10:1-10:24 (2011)The covering and boundedness problems for branching vector addition systems., , , и . J. Comput. Syst. Sci., 79 (1): 23-38 (2013)When is Containment Decidable for Probabilistic Automata?., , , , , и . ICALP, том 107 из LIPIcs, стр. 121:1-121:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Contextual Approximation and Higher-Order Procedures., и . FoSSaCS, том 9634 из Lecture Notes in Computer Science, стр. 162-179. Springer, (2016)Model Checking Freeze LTL over One-Counter Automata., , и . FoSSaCS, том 4962 из Lecture Notes in Computer Science, стр. 490-504. Springer, (2008)The Reachability Problem for Two-Dimensional Vector Addition Systems with States., , , , , , , и . J. ACM, 68 (5): 34:1-34:43 (2021)Safety alternating automata on data words. CoRR, (2008)