( en | de | ru )

 

Disambiguation of "Mazowiecki, Filip"

Author of the publication

copydeleteadd this publication to your clipboard
Reachability for Bounded Branching VASS.

, and . CONCUR, volume 140 of LIPIcs, page 28:1-28:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

Filip Lebo

Adam Filip

Heinrich Filip

Filip Klein

Filip Beck

 

Other publications of authors with the same name

Copyless cost-register automata: Structure, expressiveness, and closure properties., and . J. Comput. Syst. Sci., (2019)Weak Cost Register Automata are Still Powerful., , , and . Int. J. Found. Comput. Sci., 31 (6): 689-709 (2020)The complexity of soundness in workflow nets., , and . LICS, page 20:1-20:13. ACM, (2022)Reachability for Bounded Branching VASS., and . CONCUR, volume 140 of LIPIcs, page 28:1-28:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Satisfiability of the Two-Variable Fragment of First-Order Logic over Trees, , and . CoRR, (2013)Dynamic Data Structures for Timed Automata Acceptance., , , , and . IPEC, volume 214 of LIPIcs, page 20:1-20:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)When is Containment Decidable for Probabilistic Automata?., , , , , and . ICALP, volume 107 of LIPIcs, page 121:1-121:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A robust class of linear recurrence sequences., , , and . Inf. Comput., 289 (Part): 104964 (2022)Fast Termination and Workflow Nets., , and . CAV (1), volume 13964 of Lecture Notes in Computer Science, page 132-155. Springer, (2023)Affine Extensions of Integer Vector Addition Systems with States, , , and . (2019)https://arxiv.org/abs/1909.12386.