Filip Mazowiecki

76 papers A* 13A 4B 9C 1Journal 42Unranked 7
YearRankTypeTitle / Venue / Authors
2026 A conf
Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata.
STACS
Filip Mazowiecki, Antoni Puch, Daniel Smertnig
2025 B ed.
50th International Symposium on Mathematical Foundations of Computer Science, MFCS 2025, Warsaw, Poland, August 25-29, 2025
MFCS
Pawel Gawrychowski, Filip Mazowiecki, Michal Skrzypczak
2025 J jnl
Coverability in VASS Revisited: Improving Rackoff's Bounds to Obtain Conditional Optimality.
J. ACM
Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki
2025 J jnl
Fined-Grained Complexity of Ambiguity Problems on Automata and Directed Graphs.
CoRR
Karolina Drabik, Anita Dürr, Fabian Frei, Filip Mazowiecki, Karol Wegrzycki
2025 J jnl
Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata.
CoRR
Filip Mazowiecki, Antoni Puch, Daniel Smertnig
2025 J jnl
Soundness of reset workflow nets.
CoRR
Michael Blondin, Alain Finkel, Piotr Hofman, Filip Mazowiecki, Philip Offtermatt
2024 A* conf
Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata.
LICS
Ismaël Jecker, Filip Mazowiecki, David Purser
2024 J jnl
On Polynomial Recursive Sequences.
Theory Comput. Syst.
Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues
2024 A* conf
Soundness of reset workflow nets.
LICS
Michael Blondin, Alain Finkel, Piotr Hofman, Filip Mazowiecki, Philip Offtermatt
2024 A* conf
The Tractability Border of Reachability in Simple Vector Addition Systems with States.
FOCS
Dmitry Chistikov, Wojciech Czerwinski, Filip Mazowiecki, Lukasz Orlikowski, Henry Sinclair-Banks, Karol Wegrzycki
2024 J jnl
The Tractability Border of Reachability in Simple Vector Addition Systems with States.
CoRR
Dmitry Chistikov, Wojciech Czerwinski, Filip Mazowiecki, Lukasz Orlikowski, Henry Sinclair-Banks, Karol Wegrzycki
2023 — conf
Acyclic Petri and Workflow Nets with Resets.
FSTTCS
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Filip Mazowiecki, Henry Sinclair-Banks
2023 J jnl
Acyclic Petri and Workflow Nets with Resets.
CoRR
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Filip Mazowiecki, Henry Sinclair-Banks
2023 J jnl
Continuous One-counter Automata.
ACM Trans. Comput. Log.
Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez
2023 B conf
Coverability in 2-VASS with One Unary Counter is in NP.
FoSSaCS
Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki
2023 J jnl
Coverability in 2-VASS with One Unary Counter is in NP.
CoRR
Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki
2023 A* conf
Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality.
ICALP
Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki
2023 J jnl
Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality.
CoRR
Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki
2023 J jnl
Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata.
CoRR
Ismaël Jecker, Filip Mazowiecki, David Purser
2023 — conf
Fast Termination and Workflow Nets.
CAV (1)
Piotr Hofman, Filip Mazowiecki, Philip Offtermatt
2023 B conf
Monus Semantics in Vector Addition Systems with States.
CONCUR
Pascal Baumann, Khushraj Madnani, Filip Mazowiecki, Georg Zetzsche
2023 J jnl
Monus semantics in vector addition systems with states.
CoRR
Pascal Baumann, Khushraj Madnani, Filip Mazowiecki, Georg Zetzsche
2023 A conf
On Rational Recursive Sequences.
STACS
Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk
2022 J jnl
A robust class of linear recurrence sequences.
Inf. Comput.
Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki
2022 J jnl
Dynamic Data Structures for Timed Automata Acceptance.
Algorithmica
Alejandro Grez, Filip Mazowiecki, Michal Pilipczuk, Gabriele Puppis, Cristian Riveros
2022 J jnl
On Rational Recursive Sequences.
CoRR
Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk
2022 A* conf
The boundedness and zero isolation problems for weighted automata over nonnegative rationals.
LICS
Wojciech Czerwinski, Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus A. Whiteland
2022 J jnl
The boundedness and zero isolation problems for weighted automata over nonnegative rationals.
CoRR
Wojciech Czerwinski, Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus A. Whiteland
2022 A* conf
The complexity of soundness in workflow nets.
LICS
Michael Blondin, Filip Mazowiecki, Philip Offtermatt
2022 J jnl
The complexity of soundness in workflow nets.
CoRR
Michael Blondin, Filip Mazowiecki, Philip Offtermatt
2022 — conf
Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations.
CAV (2)
Michael Blondin, Filip Mazowiecki, Philip Offtermatt
2022 J jnl
Verifying generalised and structural soundness of workflow nets via relaxations.
CoRR
Michael Blondin, Filip Mazowiecki, Philip Offtermatt
2021 J jnl
Affine Extensions of Integer Vector Addition Systems with States.
Log. Methods Comput. Sci.
Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail A. Raskin
2021 A* conf
Continuous One-Counter Automata.
LICS
Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez
2021 J jnl
Continuous One-Counter Automata.
CoRR
Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez
2021 B conf
Dynamic Data Structures for Timed Automata Acceptance.
IPEC
Alejandro Grez, Filip Mazowiecki, Michal Pilipczuk, Gabriele Puppis, Cristian Riveros
2021 A* conf
Let's Agree to Degree: Comparing Graph Convolutional Networks in the Message-Passing Framework.
ICML
Floris Geerts, Filip Mazowiecki, Guillermo A. Pérez
2021 J jnl
Pumping lemmas for weighted automata.
Log. Methods Comput. Sci.
Agnishom Chattopadhyay, Filip Mazowiecki, Anca Muscholl, Cristian Riveros
2021 J jnl
The Reachability Problem for Petri Nets Is Not Elementary.
J. ACM
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
2021 J jnl
When are emptiness and containment decidable for probabilistic automata?
J. Comput. Syst. Sci.
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell
2020 B conf
A Robust Class of Linear Recurrence Sequences.
CSL
Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki
2020 J jnl
Let's Agree to Degree: Comparing Graph Convolutional Networks in the Message-Passing Framework.
CoRR
Floris Geerts, Filip Mazowiecki, Guillermo A. Pérez
2020 A* conf
On Polynomial Recursive Sequences.
ICALP
Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues
2020 J jnl
On polynomial recursive sequences.
CoRR
Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues
2020 J jnl
Pumping lemmas for weighted automata.
CoRR
Agnishom Chattopadhyay, Filip Mazowiecki, Anca Muscholl, Cristian Riveros
2020 B conf
Reachability in Fixed Dimension Vector Addition Systems with States.
CONCUR
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
2020 J jnl
Reachability in fixed dimension vector addition systems with states.
CoRR
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
2020 J jnl
The monitoring problem for timed automata.
CoRR
Alejandro Grez, Filip Mazowiecki, Michal Pilipczuk, Gabriele Puppis, Cristian Riveros
2020 J jnl
Weak Cost Register Automata are Still Powerful.
Int. J. Found. Comput. Sci.
Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez
2019 J jnl
A Robust Class of Linear Recurrence Sequences.
CoRR
Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki
2019 J jnl
Affine Extensions of Integer Vector Addition Systems with States.
CoRR
Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail A. Raskin
2019 J jnl
Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems.
ACM Trans. Comput. Log.
Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki
2019 J jnl
Copyless cost-register automata: Structure, expressiveness, and closure properties.
J. Comput. Syst. Sci.
Filip Mazowiecki, Cristian Riveros
2019 B conf
Reachability for Bounded Branching VASS.
CONCUR
Filip Mazowiecki, Michal Pilipczuk
2019 J jnl
Reachability for Bounded Branching VASS.
CoRR
Filip Mazowiecki, Michal Pilipczuk
2019 A* conf
The reachability problem for Petri nets is not elementary.
STOC
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
2018 B conf
Affine Extensions of Integer Vector Addition Systems with States.
CONCUR
Michael Blondin, Christoph Haase, Filip Mazowiecki
2018 A conf
Pumping Lemmas for Weighted Automata.
STACS
Filip Mazowiecki, Cristian Riveros
2018 J jnl
The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract).
CoRR
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
2018 C conf
Weak Cost Register Automata Are Still Powerful.
DLT
Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez
2018 J jnl
Weak Cost Register Automata are Still Powerful.
CoRR
Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez
2018 J jnl
When is Containment Decidable for Probabilistic Automata?
CoRR
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell
2018 A* conf
When is Containment Decidable for Probabilistic Automata?.
ICALP
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell
2017 A* conf
Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One.
ICALP
Diego Figueira, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki, Grégoire Sutre
2017 A* conf
Timed pushdown automata and branching vector addition systems.
LICS
Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki
2016 J jnl
Complexity of Two-Variable Logic on Finite Trees.
ACM Trans. Comput. Log.
Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell
2016 A conf
Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties.
STACS
Filip Mazowiecki, Cristian Riveros
2016 J jnl
Monadic Datalog and Regular Tree Pattern Queries.
ACM Trans. Database Syst.
Filip Mazowiecki, Filip Murlak, Adam Witkowski
2015 — conf
Eliminating Recursion from Monadic Datalog Programs on Trees.
MFCS (1)
Filip Mazowiecki, Joanna Ochremiak, Adam Witkowski
2015 J jnl
Eliminating Recursion from Monadic Datalog Programs on Trees.
CoRR
Filip Mazowiecki, Joanna Ochremiak, Adam Witkowski
2015 B conf
Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata.
CSL
Filip Mazowiecki, Cristian Riveros
2015 J jnl
On the expressibility of copyless cost register automata.
CoRR
Filip Mazowiecki, Cristian Riveros
2014 — conf
Decidability of weak logics with deterministic transitive closure.
CSL-LICS
Witold Charatonik, Emanuel Kieronski, Filip Mazowiecki
2014 — conf
Monadic Datalog and Regular Tree Pattern Queries.
MFCS (1)
Filip Mazowiecki, Filip Murlak, Adam Witkowski
2013 — conf
Complexity of Two-Variable Logic on Finite Trees.
ICALP (2)
Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell
2013 J jnl
Satisfiability of the Two-Variable Fragment of First-Order Logic over Trees
CoRR
Witold Charatonik, Emanuel Kieronski, Filip Mazowiecki