Filip Mazowiecki
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
33
Venues
12
Active years
2013–2026
Best venue rank
A*
Where they publish
Papers
33 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | CAV | Weighted Soundness for Workflow Nets. | Piotr Hofman, Krzysztof Makuracki, Filip Mazowiecki |
| 2026 | CONCUR | Representing One Letter Weighted Automata over the Tropical Semiring. | Shaull Almagor, Ismal Jecker, Filip Mazowiecki, Lukasz Orlikowski, David Purser, Henry Sinclair-Banks |
| 2026 | STACS | Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata. | Filip Mazowiecki, Antoni Puch, Daniel Smertnig |
| 2024 | FOCS | The Tractability Border of Reachability in Simple Vector Addition Systems with States. | Dmitry Chistikov, Wojciech Czerwinski, Filip Mazowiecki, Lukasz Orlikowski, Henry Sinclair-Banks, Karol Wegrzycki |
| 2024 | LICS | Soundness of reset workflow nets. | Michael Blondin, Alain Finkel, Piotr Hofman, Filip Mazowiecki, Philip Offtermatt |
| 2024 | LICS | Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata. | Ismal Jecker, Filip Mazowiecki, David Purser |
| 2023 | CAV | Fast Termination and Workflow Nets. | Piotr Hofman, Filip Mazowiecki, Philip Offtermatt |
| 2023 | CONCUR | Monus Semantics in Vector Addition Systems with States. | Pascal Baumann, Khushraj Madnani, Filip Mazowiecki, Georg Zetzsche |
| 2023 | FOSSACS | Coverability in 2-VASS with One Unary Counter is in NP. | Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki |
| 2023 | ICALP | Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality. | Marvin Knnemann, Filip Mazowiecki, Lia Schtze, Henry Sinclair-Banks, Karol Wegrzycki |
| 2023 | STACS | On Rational Recursive Sequences. | Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk |
| 2022 | CAV | Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations. | Michael Blondin, Filip Mazowiecki, Philip Offtermatt |
| 2022 | LICS | The complexity of soundness in workflow nets. | Michael Blondin, Filip Mazowiecki, Philip Offtermatt |
| 2022 | LICS | The boundedness and zero isolation problems for weighted automata over nonnegative rationals. | Wojciech Czerwinski, Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus A. Whiteland |
| 2021 | ICML | Let's Agree to Degree: Comparing Graph Convolutional Networks in the Message-Passing Framework. | Floris Geerts, Filip Mazowiecki, Guillermo A. Prez |
| 2021 | LICS | Continuous One-Counter Automata. | Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Prez |
| 2020 | CONCUR | Reachability in Fixed Dimension Vector Addition Systems with States. | Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jrme Leroux, Filip Mazowiecki |
| 2020 | CSL | A Robust Class of Linear Recurrence Sequences. | Corentin Barloy, Nathanal Fijalkow, Nathan Lhote, Filip Mazowiecki |
| 2020 | ICALP | On Polynomial Recursive Sequences. | Michal Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Graud Snizergues |
| 2019 | CONCUR | Reachability for Bounded Branching VASS. | Filip Mazowiecki, Michal Pilipczuk |
| 2019 | STOC | The reachability problem for Petri nets is not elementary. | Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jrme Leroux, Filip Mazowiecki |
| 2018 | CONCUR | Affine Extensions of Integer Vector Addition Systems with States. | Michael Blondin, Christoph Haase, Filip Mazowiecki |
| 2018 | DLT | Weak Cost Register Automata Are Still Powerful. | Shaull Almagor, Michal Cadilhac, Filip Mazowiecki, Guillermo A. Prez |
| 2018 | ICALP | When is Containment Decidable for Probabilistic Automata?. | Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Prez, James Worrell |
| 2018 | STACS | Pumping Lemmas for Weighted Automata. | Filip Mazowiecki, Cristian Riveros |
| 2017 | ICALP | Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One. | Diego Figueira, Ranko Lazic, Jrme Leroux, Filip Mazowiecki, Grgoire Sutre |
| 2017 | LICS | Timed pushdown automata and branching vector addition systems. | Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki |
| 2016 | STACS | Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties. | Filip Mazowiecki, Cristian Riveros |
| 2015 | CSL | Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata. | Filip Mazowiecki, Cristian Riveros |
| 2015 | MFCS | Eliminating Recursion from Monadic Datalog Programs on Trees. | Filip Mazowiecki, Joanna Ochremiak, Adam Witkowski |
| 2014 | CSL | Decidability of weak logics with deterministic transitive closure. | Witold Charatonik, Emanuel Kieronski, Filip Mazowiecki |
| 2014 | MFCS | Monadic Datalog and Regular Tree Pattern Queries. | Filip Mazowiecki, Filip Murlak, Adam Witkowski |
| 2013 | ICALP | Complexity of Two-Variable Logic on Finite Trees. | Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell |