Publications

Filip Mazowiecki

Number of publications: 44

2024

• Ismaël Jecker, Filip Mazowiecki , David Purser, Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata, 39th Annual ACM/IEEE Symposium on Logic in Computer Science, Tallinn, Estonia, 8 July 2024 - 11 July 2024. See in PBN
• Michaël Cadilhac, Filip Mazowiecki , Charles Paperman, Michał Pilipczuk , Géraud Sénizergues, On Polynomial Recursive Sequences, Theory of Computing Systems, 68 2024, p. 593–614. See in PBN
• Michael Blondin, Alain Finkel, Piotr Hofman , Filip Mazowiecki , Philip Offtermatt, Soundness of reset workflow nets, 39th Annual ACM/IEEE Symposium on Logic in Computer Science, Tallinn, Estonia, 8 July 2024 - 11 July 2024. See in PBN
• Dmitry Chistikov, Wojciech Czerwiński , Filip Mazowiecki , Łukasz Orlikowski , Henry Sinclair-Banks , Karol Węgrzycki, The Tractability Border of Reachability in Simple Vector Addition Systems with States, 65th IEEE Symposium on Foundations of Computer Science, Chicago, the United States of America, 27 October 2024 - 30 October 2024. See in PBN

2023

• Dmitry Chistikov, Wojciech Czerwiński , Piotr Hofman , Filip Mazowiecki , Henry Sinclair-Banks, Acyclic Petri and Workflow Nets with Resets, 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India, 18 December 2023 - 20 December 2023. See in PBN
• Michael Blondin, Tim Leys, Filip Mazowiecki , Philip Offtermatt, Guillermo Pérez, Continuous One-counter Automata, ACM Transactions on Computational Logic, 24 (1) 2023, p. 1-31. See in PBN
• Filip Mazowiecki , Henry Sinclair-Banks, Karol Węgrzycki, Coverability in 2-VASS with One Unary Counter is in NP, 26th International Conference on Foundations of Software Science and Computation Structures, Paryż, France, 22 April 2023 - 27 April 2023. See in PBN
• Marvin Künnemann, Filip Mazowiecki , Lia Schütze, Henry Sinclair-Banks, Karol Węgrzycki, Coverability in VASS Revisited: Improving Rackoff’s Bound to Obtain Conditional Optimality, 50th EATCS International Colloquium on Automata, Languages and Programming, Padeborn, Germany, 10 July 2023 - 14 July 2023. See in PBN
• Piotr Hofman , Filip Mazowiecki , Philip Offtermatt, Fast Termination and Workflow Nets, 35th International Conference on Computer Aided Verification, Paris, France, 17 July 2023 - 22 July 2023. See in PBN
• Pascal Baumann, Khushraj Madnani, Filip Mazowiecki , Georg Zetzsche, Monus Semantics in Vector Addition Systems with States, 34th International Conference on Concurrency Theory, Antwerpia, Belgium, 19 September 2023 - 22 September 2023. See in PBN
• Lorenzo Clemente , Maria Donten-Bury , Filip Mazowiecki , Michał Pilipczuk , On Rational Recursive Sequences, 40th International Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, 7 March 2023 - 9 March 2023. See in PBN

2022

• Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki , A robust class of linear recurrence sequences, Information and Computation, 289 2022, p. 104964. See in PBN
• Alejandro Grez, Filip Mazowiecki , Michał Pilipczuk , Gabriele Puppis, Cristian Riveros, Dynamic Data Structures for Timed Automata Acceptance, ALGORITHMICA, 84 (11) 2022, p. 3223-3245. See in PBN
• Wojciech Czerwiński , Engel Lefaucheux, Filip Mazowiecki , David Purser, Markus Whiteland, The boundedness and zero isolation problems for weighted automata over nonnegative rationals, 37'th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, 2 August 2022 - 5 August 2022. See in PBN
• Michael Blondin, Filip Mazowiecki , Philip Offtermatt, The complexity of soundness in workflow nets, 37'th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, 2 August 2022 - 5 August 2022. See in PBN
• Filip Mazowiecki , Philip Offtermatt, Michael Blondin, Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations, Computer Aided Verification - 34th International Conference, Haifa, Israel, 7 August 2022 - 10 August 2022. See in PBN

2021

• Michael Blondin, Christoph Haase, Mikhail Raskin, Filip Mazowiecki , Affine Extensions of Integer Vector Addition Systems with States, Logical Methods in Computer Science, Volume 17, Issue 3 2021. See in PBN
• Michael Blondin, Tim Leys, Philip Offtermatt, Guillermo A., Filip Mazowiecki , Continuous One-Counter Automata, Symposium on Logic in Computer Science, 2021, p. 1--13. See in PBN
• Alejandro Grez, Gabriele Puppis, Cristian Riveros, Filip Mazowiecki , Michał Pilipczuk , Dynamic Data Structures for Timed Automata Acceptance, Leibniz International Proceedings in Informatics, LIPIcs, 214 2021, p. 20:1--20:18. See in PBN
• Floris Geerts, Guillermo A., Filip Mazowiecki , Let's Agree to Degree: Comparing Graph Convolutional Networks in the Message-Passing Framework, PMLR, 139 2021, p. 3640--3649. See in PBN
• Agnishom Chattopadhyay, Anca Muscholl, Cristian Riveros, Filip Mazowiecki , Pumping lemmas for weighted automata, Logical Methods in Computer Science, Volume 17, Issue 3 2021. See in PBN
• Wojciech Czerwiński , Sławomir Lasota , Ranko Lazić, JÉrôme Leroux, Filip Mazowiecki , The Reachability Problem for Petri Nets Is Not Elementary, Journal of the ACM, 68 (1) 2021, p. 1-28. See in PBN
• Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Guillermo A., James Worrell, Filip Mazowiecki , When are emptiness and containment decidable for probabilistic automata?, Journal of Computer and System Sciences, 119 2021, p. 78--96. See in PBN

2020

• Corentin Barloy, Nathanael Fijalkow, Nathan Lhote, Filip Mazowiecki , A Robust Class of Linear Recurrence Sequences, 28th International Conference on Computer Science Logic, Barcelona, Spain, 13 January 2020 - 16 January 2020, 152 2020, p. 9:1--9:16. See in PBN
• Michaël Cadilhac, Charles Paperman, Michał Pilipczuk , Géraud Sénizergues, Filip Mazowiecki , On Polynomial Recursive Sequences, Leibniz International Proceedings in Informatics, LIPIcs, 47th International Colloquium on Automata, Languages, and Programming, Saarbrücken, Germany, 8 July 2020 - 11 July 2020, 168 2020, p. 117:1--117:17. See in PBN
• Wojciech Czerwiński , Sławomir Lasota , Ranko Lazic, Jerome Leroux, Filip Mazowiecki , Reachability in Fixed Dimension Vector Addition Systems with States, 31st International Conference on Concurrency Theory, Vienna, Austria, 1 September 2020 - 4 September 2020. See in PBN
• Shaull Almagor, Michaël Cadilhac, Guillermo A. Pérez, Filip Mazowiecki , Weak Cost Register Automata are Still Powerful, International Journal of Foundations of Computer Science, 31 (6) 2020, p. 689-709. See in PBN

2019

• Lorenzo Clemente , Sławomir Lasota , Ranko Lazić, Filip Mazowiecki , Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems, ACM Transactions on Computational Logic, 20 (3) 2019, p. 1-31. See in PBN
• Cristian Riveros, Filip Mazowiecki , Copyless cost-register automata: Structure, expressiveness, and closure properties, Journal of Computer and System Sciences, 100 2019, p. 1-29. See in PBN
• Michał Pilipczuk , Filip Mazowiecki , Reachability for Bounded Branching VASS, 30th International Conference on Concurrency Theory, Amsterdam, the Netherlands, 26 August 2019 - 31 August 2019, 140 2019, p. 28:1--28:13. See in PBN
• Wojciech Czerwiński , Sławomir Lasota , Ranko Lazić, Jérôme Leroux, Filip Mazowiecki , The reachability problem for Petri nets is not elementary, 51st ACM Symposium on Theory of Computing, Phoenix, the United States of America, 23 June 2019 - 26 June 2019. See in PBN

2018

• Michael Blondin, Christoph Haase, Filip Mazowiecki , Affine Extensions of Integer Vector Addition Systems with States, Leibniz International Proceedings in Informatics, LIPIcs, 118 2018, p. 14:1--14:17. See in PBN
• Cristian Riveros, Filip Mazowiecki , Pumping Lemmas for Weighted Automata, Leibniz International Proceedings in Informatics, LIPIcs, 96 2018, p. 50:1--50:14. See in PBN
• Shaull Almagor, Micha{\"{e}}l Cadilhac, Guillermo A., Filip Mazowiecki , Weak Cost Register Automata Are Still Powerful, Lecture Notes in Computer Science, 11088 2018, p. 83--95. See in PBN
• Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Guillermo A., James Worrell, Filip Mazowiecki , When is Containment Decidable for Probabilistic Automata?, Leibniz International Proceedings in Informatics, LIPIcs, 107 2018, p. 121:1--121:14. See in PBN

2017

• Damian Niwiński , Henryk Michalewski , Wojciech Rytter , Joost Winter, Michał Skrzypczak , Szymon Toruńczyk , Michał Pilipczuk , Eryk Kopczyński , Sławomir Lasota , Paweł Parys , Joanna Ochremiak, Wojciech Czerwiński , Bartosz Klin , Igor Walukiewicz, Szczepan Hummel, Mikołaj Bojańczyk , Piotr Hofman , Lorenzo Clemente , Filip Mazowiecki , Filip Murlak , 200 Problems in Formal Languages and Automata Theory, 2017. See in PBN
• Diego Figueira, Ranko Lazic, J{\'{e}}r{\^{o}}me Leroux, Gr{\'{e}}goire Sutre, Filip Mazowiecki , Polynomial-Space Completeness of Reachability for Succinct Branching {VASS} in Dimension One, Leibniz International Proceedings in Informatics, LIPIcs, 80 2017, p. 119:1--119:14. See in PBN
• Lorenzo Clemente , Sławomir Lasota , Ranko Lazić, Filip Mazowiecki , Timed pushdown automata and branching vector addition systems, Thirty-Second Annual ACM/IEEE Symposium on Logic in Computer Science, Reykjavik, Iceland, 20 June 2017 - 23 June 2017. See in PBN

2016

• Filip Murlak , Adam Witkowski, Filip Mazowiecki , Monadic Datalog and Regular Tree Pattern Queries, ACM Transactions on Database Systems, 2016. See in PBN

2015

• Joanna Ochremiak, Adam Witkowski, Filip Mazowiecki , Eliminating Recursion from Monadic Datalog Programs on Trees, Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MIlan, Italy, 24 August 2015 - 28 August 2015. See in PBN
• Cristian Riveros, Filip Mazowiecki , Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata, 2015. See in PBN

2014

• Emanuel Kieroński, Witold Charatonik, Filip Mazowiecki , Decidability of weak logics with deterministic transitive closure, Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014, 2014. See in PBN
• Filip Murlak , Adam Witkowski, Filip Mazowiecki , Monadic Datalog and Regular Tree Pattern Queries, Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II, 2014. See in PBN

2013

• Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieroński, Rastislav Lenhardt, James Worrell, Filip Mazowiecki , Complexity of Two-Variable Logic on Finite Trees, Lecture Notes in Computer Science, 7966 2013, p. 74-88. See in PBN