default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFilip Mazowiecki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Michaël Cadilhac
, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues:
On Polynomial Recursive Sequences. Theory Comput. Syst. 68(4): 593-614 (2024)- [c31]Michael Blondin, Alain Finkel, Piotr Hofman, Filip Mazowiecki, Philip Offtermatt:
Soundness of reset workflow nets. LICS 2024: 13:1-13:14 - [c30]Ismaël Jecker, Filip Mazowiecki, David Purser:
Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata. LICS 2024: 46:1-46:13 - 2023
- [j12]Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez:
Continuous One-counter Automata. ACM Trans. Comput. Log. 24(1): 3:1-3:31 (2023) - [c29]Piotr Hofman, Filip Mazowiecki, Philip Offtermatt:
Fast Termination and Workflow Nets. CAV (1) 2023: 132-155 - [c28]Pascal Baumann, Khushraj Madnani, Filip Mazowiecki, Georg Zetzsche:
Monus Semantics in Vector Addition Systems with States. CONCUR 2023: 10:1-10:18 - [c27]Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki:
Coverability in 2-VASS with One Unary Counter is in NP. FoSSaCS 2023: 196-217 - [c26]Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Filip Mazowiecki, Henry Sinclair-Banks:
Acyclic Petri and Workflow Nets with Resets. FSTTCS 2023: 16:1-16:18 - [c25]Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki:
Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality. ICALP 2023: 131:1-131:20 - [c24]Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk:
On Rational Recursive Sequences. STACS 2023: 24:1-24:21 - [i24]Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki:
Coverability in 2-VASS with One Unary Counter is in NP. CoRR abs/2301.13543 (2023) - [i23]Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki:
Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality. CoRR abs/2305.01581 (2023) - [i22]Pascal Baumann, Khushraj Madnani, Filip Mazowiecki, Georg Zetzsche:
Monus semantics in vector addition systems with states. CoRR abs/2308.14926 (2023) - [i21]Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Filip Mazowiecki, Henry Sinclair-Banks:
Acyclic Petri and Workflow Nets with Resets. CoRR abs/2310.01992 (2023) - [i20]Ismaël Jecker, Filip Mazowiecki, David Purser:
Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata. CoRR abs/2310.02204 (2023) - 2022
- [j11]Alejandro Grez, Filip Mazowiecki, Michal Pilipczuk, Gabriele Puppis, Cristian Riveros:
Dynamic Data Structures for Timed Automata Acceptance. Algorithmica 84(11): 3223-3245 (2022) - [j10]Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki:
A robust class of linear recurrence sequences. Inf. Comput. 289(Part): 104964 (2022) - [c23]Michael Blondin, Filip Mazowiecki, Philip Offtermatt:
Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations. CAV (2) 2022: 468-489 - [c22]Wojciech Czerwinski, Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus A. Whiteland:
The boundedness and zero isolation problems for weighted automata over nonnegative rationals. LICS 2022: 15:1-15:13 - [c21]Michael Blondin, Filip Mazowiecki, Philip Offtermatt:
The complexity of soundness in workflow nets. LICS 2022: 20:1-20:13 - [i19]Michael Blondin, Filip Mazowiecki, Philip Offtermatt:
The complexity of soundness in workflow nets. CoRR abs/2201.05588 (2022) - [i18]Wojciech Czerwinski, Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus A. Whiteland:
The boundedness and zero isolation problems for weighted automata over nonnegative rationals. CoRR abs/2205.13516 (2022) - [i17]Michael Blondin, Filip Mazowiecki, Philip Offtermatt:
Verifying generalised and structural soundness of workflow nets via relaxations. CoRR abs/2206.02606 (2022) - [i16]Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk:
On Rational Recursive Sequences. CoRR abs/2210.01635 (2022) - 2021
- [j9]Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki:
The Reachability Problem for Petri Nets Is Not Elementary. J. ACM 68(1): 7:1-7:28 (2021) - [j8]Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell:
When are emptiness and containment decidable for probabilistic automata? J. Comput. Syst. Sci. 119: 78-96 (2021) - [j7]Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail A. Raskin:
Affine Extensions of Integer Vector Addition Systems with States. Log. Methods Comput. Sci. 17(3) (2021) - [j6]Agnishom Chattopadhyay, Filip Mazowiecki, Anca Muscholl, Cristian Riveros:
Pumping lemmas for weighted automata. Log. Methods Comput. Sci. 17(3) (2021) - [c20]Floris Geerts, Filip Mazowiecki, Guillermo A. Pérez:
Let's Agree to Degree: Comparing Graph Convolutional Networks in the Message-Passing Framework. ICML 2021: 3640-3649 - [c19]Alejandro Grez, Filip Mazowiecki, Michal Pilipczuk, Gabriele Puppis, Cristian Riveros:
Dynamic Data Structures for Timed Automata Acceptance. IPEC 2021: 20:1-20:18 - [c18]Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez:
Continuous One-Counter Automata. LICS 2021: 1-13 - [i15]Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez:
Continuous One-Counter Automata. CoRR abs/2101.11996 (2021) - 2020
- [j5]Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez:
Weak Cost Register Automata are Still Powerful. Int. J. Found. Comput. Sci. 31(6): 689-709 (2020) - [c17]Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki:
Reachability in Fixed Dimension Vector Addition Systems with States. CONCUR 2020: 48:1-48:21 - [c16]Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki:
A Robust Class of Linear Recurrence Sequences. CSL 2020: 9:1-9:16 - [c15]Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues:
On Polynomial Recursive Sequences. ICALP 2020: 117:1-117:17 - [i14]Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki:
Reachability in fixed dimension vector addition systems with states. CoRR abs/2001.04327 (2020) - [i13]Agnishom Chattopadhyay, Filip Mazowiecki, Anca Muscholl, Cristian Riveros:
Pumping lemmas for weighted automata. CoRR abs/2001.06272 (2020) - [i12]Alejandro Grez, Filip Mazowiecki, Michal Pilipczuk, Gabriele Puppis, Cristian Riveros:
The monitoring problem for timed automata. CoRR abs/2002.07049 (2020) - [i11]Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues:
On polynomial recursive sequences. CoRR abs/2002.08630 (2020) - [i10]Floris Geerts, Filip Mazowiecki, Guillermo A. Pérez:
Let's Agree to Degree: Comparing Graph Convolutional Networks in the Message-Passing Framework. CoRR abs/2004.02593 (2020)
2010 – 2019
- 2019
- [j4]Filip Mazowiecki, Cristian Riveros:
Copyless cost-register automata: Structure, expressiveness, and closure properties. J. Comput. Syst. Sci. 100: 1-29 (2019) - [j3]Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki:
Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems. ACM Trans. Comput. Log. 20(3): 14:1-14:31 (2019) - [c14]Filip Mazowiecki, Michal Pilipczuk:
Reachability for Bounded Branching VASS. CONCUR 2019: 28:1-28:13 - [c13]Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki:
The reachability problem for Petri nets is not elementary. STOC 2019: 24-33 - [i9]Filip Mazowiecki, Michal Pilipczuk:
Reachability for Bounded Branching VASS. CoRR abs/1904.10226 (2019) - [i8]Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki:
A Robust Class of Linear Recurrence Sequences. CoRR abs/1908.03890 (2019) - [i7]Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail A. Raskin:
Affine Extensions of Integer Vector Addition Systems with States. CoRR abs/1909.12386 (2019) - 2018
- [c12]Michael Blondin, Christoph Haase, Filip Mazowiecki:
Affine Extensions of Integer Vector Addition Systems with States. CONCUR 2018: 14:1-14:17 - [c11]Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez:
Weak Cost Register Automata Are Still Powerful. DLT 2018: 83-95 - [c10]Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell:
When is Containment Decidable for Probabilistic Automata?. ICALP 2018: 121:1-121:14 - [c9]Filip Mazowiecki, Cristian Riveros:
Pumping Lemmas for Weighted Automata. STACS 2018: 50:1-50:14 - [i6]Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez:
Weak Cost Register Automata are Still Powerful. CoRR abs/1804.06336 (2018) - [i5]Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell:
When is Containment Decidable for Probabilistic Automata? CoRR abs/1804.09077 (2018) - [i4]Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki:
The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract). CoRR abs/1809.07115 (2018) - 2017
- [c8]Diego Figueira, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki, Grégoire Sutre:
Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One. ICALP 2017: 119:1-119:14 - [c7]Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki:
Timed pushdown automata and branching vector addition systems. LICS 2017: 1-12 - 2016
- [j2]Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell:
Complexity of Two-Variable Logic on Finite Trees. ACM Trans. Comput. Log. 17(4): 32 (2016) - [j1]Filip Mazowiecki, Filip Murlak, Adam Witkowski:
Monadic Datalog and Regular Tree Pattern Queries. ACM Trans. Database Syst. 41(3): 20:1-20:43 (2016) - [c6]Filip Mazowiecki, Cristian Riveros:
Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties. STACS 2016: 53:1-53:13 - 2015
- [c5]Filip Mazowiecki, Cristian Riveros:
Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata. CSL 2015: 144-159 - [c4]Filip Mazowiecki, Joanna Ochremiak, Adam Witkowski:
Eliminating Recursion from Monadic Datalog Programs on Trees. MFCS (1) 2015: 394-406 - [i3]Filip Mazowiecki, Cristian Riveros:
On the expressibility of copyless cost register automata. CoRR abs/1504.01709 (2015) - [i2]Filip Mazowiecki, Joanna Ochremiak, Adam Witkowski:
Eliminating Recursion from Monadic Datalog Programs on Trees. CoRR abs/1505.02444 (2015) - 2014
- [c3]Witold Charatonik, Emanuel Kieronski, Filip Mazowiecki:
Decidability of weak logics with deterministic transitive closure. CSL-LICS 2014: 29:1-29:10 - [c2]Filip Mazowiecki, Filip Murlak, Adam Witkowski:
Monadic Datalog and Regular Tree Pattern Queries. MFCS (1) 2014: 426-437 - 2013
- [c1]Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell:
Complexity of Two-Variable Logic on Finite Trees. ICALP (2) 2013: 74-88 - [i1]Witold Charatonik, Emanuel Kieronski, Filip Mazowiecki:
Satisfiability of the Two-Variable Fragment of First-Order Logic over Trees. CoRR abs/1304.7204 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 23:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
