Follow
Filip Mazowiecki
Title
Cited by
Cited by
Year
The reachability problem for Petri nets is not elementary
W Czerwiński, S Lasota, R Lazić, J Leroux, F Mazowiecki
Journal of the ACM (JACM) 68 (1), 1-28, 2020
1672020
Let’s agree to degree: Comparing graph convolutional networks in the message-passing framework
F Geerts, F Mazowiecki, G Perez
International Conference on Machine Learning, 3640-3649, 2021
452021
Complexity of two-variable logic on finite trees
S Benaim, M Benedikt, W Charatonik, E Kieroński, R Lenhardt, ...
ACM Transactions on Computational Logic (TOCL) 17 (4), 1-38, 2016
36*2016
Affine extensions of integer vector addition systems with states
M Blondin, C Haase, F Mazowiecki, M Raskin
Logical Methods in Computer Science 17, 2021
232021
Copyless cost-register automata: Structure, expressiveness, and closure properties
F Mazowiecki, C Riveros
Journal of Computer and System Sciences 100, 1-29, 2019
222019
Reachability in fixed dimension vector addition systems with states
W Czerwiński, S Lasota, R Lazić, J Leroux, F Mazowiecki
arXiv preprint arXiv:2001.04327, 2020
172020
On polynomial recursive sequences
M Cadilhac, F Mazowiecki, C Paperman, M Pilipczuk, G Sénizergues
Theory of Computing Systems, 1-22, 2021
162021
Pumping lemmas for weighted automata
F Mazowiecki, C Riveros
35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), 2018
162018
Polynomial-space completeness of reachability for succinct branching VASS in dimension one
D Figueira, R Lazic, J Leroux, F Mazowiecki, G Sutre
44th International Colloquium on Automata, Languages, and Programming (ICALP …, 2017
152017
A robust class of linear recurrence sequences
C Barloy, N Fijalkow, N Lhote, F Mazowiecki
Information and Computation 289, 104964, 2022
142022
When is containment decidable for probabilistic automata?
L Daviaud, M Jurdziński, R Lazić, F Mazowiecki, GA Pérez, J Worrell
arXiv preprint arXiv:1804.09077, 2018
142018
Timed pushdown automata and branching vector addition systems
L Clemente, S Lasota, R Lazić, F Mazowiecki
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2017
122017
Decidability of weak logics with deterministic transitive closure
W Charatonik, E Kieroński, F Mazowiecki
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014
122014
Maximal partition logic: Towards a logical characterization of copyless cost register automata
F Mazowiecki, C Riveros
24th EACSL Annual Conference on Computer Science Logic (CSL 2015), 2015
112015
Dynamic data structures for timed automata acceptance
A Grez, F Mazowiecki, M Pilipczuk, G Puppis, C Riveros
Algorithmica 84 (11), 3223-3245, 2022
92022
Pumping lemmas for weighted automata
A Chattopadhyay, F Mazowiecki, A Muscholl, C Riveros
Logical Methods in Computer Science 17, 2021
92021
Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality
M Künnemann, F Mazowiecki, L Schütze, H Sinclair-Banks, K Węgrzycki
arXiv preprint arXiv:2305.01581, 2023
82023
The complexity of soundness in workflow nets
M Blondin, F Mazowiecki, P Offtermatt
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022
62022
Weak cost register automata are still powerful
S Almagor, M Cadilhac, F Mazowiecki, GA Pérez
Developments in Language Theory: 22nd International Conference, DLT 2018 …, 2018
62018
When are emptiness and containment decidable for probabilistic automata?
L Daviaud, M Jurdziński, R Lazić, F Mazowiecki, GA Pérez, J Worrell
Journal of Computer and System Sciences 119, 78-96, 2021
52021
The system can't perform the operation now. Try again later.
Articles 1–20