Satisfiability of the Two-Variable Fragment of First-Order Logic over Trees - Witold Charatonik; Emanuel Kieronski; Filip Mazowiecki (CoRR, 2013)

Decidability of weak logics with deterministic transitive closure. - Witold Charatonik; Emanuel Kieronski; Filip Mazowiecki (CSL-LICS, 2014)

Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata. - Filip Mazowiecki; Cristian Riveros (CSL, 2015)

Eliminating Recursion from Monadic Datalog Programs on Trees. - Filip Mazowiecki; Joanna Ochremiak; Adam Witkowski (MFCS (1), 2015)

On the expressibility of copyless cost register automata. - Filip Mazowiecki; Cristian Riveros (CoRR, 2015)

Complexity of Two-Variable Logic on Finite Trees. - Saguy Benaim; Michael Benedikt; Witold Charatonik; Emanuel Kieronski; Rastislav Lenhardt; Filip Mazowiecki; James Worrell 001 (ACM Trans. Comput. Log., 2016)

Monadic Datalog and Regular Tree Pattern Queries. - Filip Mazowiecki; Filip Murlak; Adam Witkowski (ACM Trans. Database Syst., 2016)

Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One. - Diego Figueira; Ranko Lazic 001; Jérôme Leroux; Filip Mazowiecki; Grégoire Sutre (ICALP, 2017)

Timed pushdown automata and branching vector addition systems. - Lorenzo Clemente; Slawomir Lasota 001; Ranko Lazic 001; Filip Mazowiecki (LICS, 2017)

Affine Extensions of Integer Vector Addition Systems with States. - Michael Blondin; Christoph Haase; Filip Mazowiecki (CONCUR, 2018)

When is Containment Decidable for Probabilistic Automata?. - Laure Daviaud; Marcin Jurdzinski; Ranko Lazic 001; Filip Mazowiecki; Guillermo A. Pérez 001; James Worrell 001 (ICALP, 2018)

Pumping Lemmas for Weighted Automata. - Filip Mazowiecki; Cristian Riveros (STACS, 2018)

The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract). - Wojciech Czerwinski; Slawomir Lasota 001; Ranko Lazic 001; Jérôme Leroux; Filip Mazowiecki (CoRR, 2018)

Reachability for Bounded Branching VASS. - Filip Mazowiecki; Michal Pilipczuk (CONCUR, 2019)

Copyless cost-register automata: Structure, expressiveness, and closure properties. - Filip Mazowiecki; Cristian Riveros (J. Comput. Syst. Sci., 2019)

Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems. - Lorenzo Clemente; Slawomir Lasota 001; Ranko Lazic 001; Filip Mazowiecki (ACM Trans. Comput. Log., 2019)

Reachability in Fixed Dimension Vector Addition Systems with States. - Wojciech Czerwinski; Slawomir Lasota 001; Ranko Lazic 001; Jérôme Leroux; Filip Mazowiecki (CONCUR, 2020)

The monitoring problem for timed automata. - Alejandro Grez; Filip Mazowiecki; Michal Pilipczuk; Gabriele Puppis; Cristian Riveros (CoRR, 2020)

Weak Cost Register Automata are Still Powerful. - Shaull Almagor; Michaël Cadilhac; Filip Mazowiecki; Guillermo A. Pérez 001 (Int. J. Found. Comput. Sci., 2020)

Let's Agree to Degree: Comparing Graph Convolutional Networks in the Message-Passing Framework. - Floris Geerts; Filip Mazowiecki; Guillermo A. Pérez 001 (ICML, 2021)

The Reachability Problem for Petri Nets Is Not Elementary. - Wojciech Czerwinski; Slawomir Lasota 001; Ranko Lazic 001; Jérôme Leroux; Filip Mazowiecki (J. ACM, 2021)

When are emptiness and containment decidable for probabilistic automata? - Laure Daviaud; Marcin Jurdzinski; Ranko Lazic 001; Filip Mazowiecki; Guillermo A. Pérez 001; James Worrell 001 (J. Comput. Syst. Sci., 2021)

Affine Extensions of Integer Vector Addition Systems with States. - Michael Blondin; Christoph Haase; Filip Mazowiecki; Mikhail A. Raskin (Log. Methods Comput. Sci., 2021)

Pumping lemmas for weighted automata. - Agnishom Chattopadhyay; Filip Mazowiecki; Anca Muscholl; Cristian Riveros (Log. Methods Comput. Sci., 2021)

Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations. - Michael Blondin; Filip Mazowiecki; Philip Offtermatt (CAV (2), 2022)

The complexity of soundness in workflow nets. - Michael Blondin; Filip Mazowiecki; Philip Offtermatt (LICS, 2022)

The boundedness and zero isolation problems for weighted automata over nonnegative rationals. - Wojciech Czerwinski; Engel Lefaucheux; Filip Mazowiecki; David Purser; Markus A. Whiteland (LICS, 2022)

Dynamic Data Structures for Timed Automata Acceptance. - Alejandro Grez; Filip Mazowiecki; Michal Pilipczuk; Gabriele Puppis; Cristian Riveros (Algorithmica, 2022)

A robust class of linear recurrence sequences. - Corentin Barloy; Nathanaël Fijalkow; Nathan Lhote; Filip Mazowiecki (Inf. Comput., 2022)

Fast Termination and Workflow Nets. - Piotr Hofman; Filip Mazowiecki; Philip Offtermatt (CAV (1), 2023)

Monus Semantics in Vector Addition Systems with States. - Pascal Baumann 001; Khushraj Madnani; Filip Mazowiecki; Georg Zetzsche (CONCUR, 2023)

Coverability in 2-VASS with One Unary Counter is in NP. - Filip Mazowiecki; Henry Sinclair-Banks; Karol Wegrzycki (FoSSaCS, 2023)

Acyclic Petri and Workflow Nets with Resets. - Dmitry Chistikov 001; Wojciech Czerwinski; Piotr Hofman; Filip Mazowiecki; Henry Sinclair-Banks (FSTTCS, 2023)

Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality. - Marvin Künnemann; Filip Mazowiecki; Lia Schütze; Henry Sinclair-Banks; Karol Wegrzycki (ICALP, 2023)

On Rational Recursive Sequences. - Lorenzo Clemente; Maria Donten-Bury; Filip Mazowiecki; Michal Pilipczuk (STACS, 2023)

Continuous One-counter Automata. - Michael Blondin; Tim Leys; Filip Mazowiecki; Philip Offtermatt; Guillermo A. Pérez 001 (ACM Trans. Comput. Log., 2023)

The Tractability Border of Reachability in Simple Vector Addition Systems with States. - Dmitry Chistikov 001; Wojciech Czerwinski; Filip Mazowiecki; Lukasz Orlikowski; Henry Sinclair-Banks; Karol Wegrzycki (FOCS, 2024)

Soundness of reset workflow nets. - Michael Blondin; Alain Finkel; Piotr Hofman; Filip Mazowiecki; Philip Offtermatt (LICS, 2024)

Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata. - Ismaël Jecker; Filip Mazowiecki; David Purser (LICS, 2024)

On Polynomial Recursive Sequences. - Michaël Cadilhac; Filip Mazowiecki; Charles Paperman; Michal Pilipczuk; Géraud Sénizergues (Theory Comput. Syst., 2024)

Fined-Grained Complexity of Ambiguity Problems on Automata and Directed Graphs. - Karolina Drabik; Anita Dürr; Fabian Frei; Filip Mazowiecki; Karol Wegrzycki (CoRR, 2025)

Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata. - Filip Mazowiecki; Antoni Puch; Daniel Smertnig (CoRR, 2025)