Author of the publication

Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games.

, , , , , and . SODA, page 2333-2349. SIAM, (2019)

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

Improved Bounds for the Excluded-Minor Approximation of Treedepth., , and . SIAM J. Discret. Math., 35 (2): 934-947 (2021)New Pumping Technique for 2-Dimensional VASS., , , and . MFCS, volume 138 of LIPIcs, page 62:1-62:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Regular Separability of One Counter Automata., and . Logical Methods in Computer Science, (2019)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)Efficient Separability of Regular Languages by Subsequences and Suffixes., , and . ICALP (2), volume 7966 of Lecture Notes in Computer Science, page 150-161. Springer, (2013)Partially-commutative context-free processes: Expressibility and tractability., , and . Inf. Comput., 209 (5): 782-798 (2011)Branching Bisimilarity of Normed BPA Processes is in NEXPTIME., and . CoRR, (2014)An Approach to Regular Separability in Vector Addition Systems., and . LICS, page 341-354. ACM, (2020)Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games., , , , , and . SODA, page 2333-2349. SIAM, (2019)Involved VASS Zoo (Invited Talk).. CONCUR, volume 243 of LIPIcs, page 5:1-5:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)