Author of the publication

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes., , and . CONCUR, volume 6901 of Lecture Notes in Computer Science, page 528-542. Springer, (2011)Improved Lower Bounds for Reachability in Vector Addition Systems., , and . ICALP, volume 198 of LIPIcs, page 128:1-128:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes., and . LICS, page 40:1-40:12. ACM, (2022)The reachability problem for Petri nets is not elementary., , , , and . STOC, page 24-33. ACM, (2019)A Note on Decidable Separability by Piecewise Testable Languages., , , and . FCT, volume 9210 of Lecture Notes in Computer Science, page 173-185. Springer, (2015)Shortest Paths in One-Counter Systems., , , , and . FoSSaCS, volume 9634 of Lecture Notes in Computer Science, page 462-478. Springer, (2016)Regular separability of one counter automata., and . LICS, page 1-12. IEEE Computer Society, (2017)Unboundedness Problems for Languages of Vector Addition Systems., , and . ICALP, volume 107 of LIPIcs, page 119:1-119:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Regular Separability of One Counter Automata., and . Logical Methods in Computer Science, (2019)Branching Bisimilarity of Normed BPA Processes is in NEXPTIME., and . CoRR, (2014)