Filip Mazowiecki

Cited by

	All	Since 2019
Citations	520	452
h-index	12	11
i10-index	15	11

100

201420152016201720182019202020212022202320246 15 13 11 15 50 58 95 80 100 62

Public access

View all

23 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Ranko LazicDepartment of Computer Science, University of WarwickVerified email at warwick.ac.uk
Slawomir LasotaUniversity of Warsaw, prof. of computer scienceVerified email at mimuw.edu.pl
Wojciech CzerwinskiUniversity of WarsawVerified email at mimuw.edu.pl
Cristian RiverosAssociate Professor, Computer Science Department, PUC ChileVerified email at uc.cl
Guillermo A. PérezAssociate Professor, University of AntwerpVerified email at uantwerp.be
Jerome LerouxCNRS researcher, LaBRI, FranceVerified email at labri.fr
Michał PilipczukUniversity of WarsawVerified email at mimuw.edu.pl
Michael BlondinAssociate professor, Université de SherbrookeVerified email at usherbrooke.ca
Witold CharatonikProfessor of Computer Science, University of WrocławVerified email at cs.uni.wroc.pl
Emanuel KieronskiInstitute of Computer Science, University of WroclawVerified email at cs.uni.wroc.pl
James WorrellProfessor of Computer Science, Oxford UniversityVerified email at cs.ox.ac.uk
Philip OfftermattResearch Engineer @ Informal SystemsVerified email at informal.systems
Michaël CadilhacDePaul UniversityVerified email at cadilhac.name
Charles PapermanMaitre de Conférence à l'université de LilleVerified email at inria.fr
Lorenzo ClementeUniversity of WarsawVerified email at mimuw.edu.pl
Henry Sinclair-BanksUniversity of WarwickVerified email at warwick.ac.uk
Laure DaviaudUniversity of East AngliaVerified email at uea.ac.uk
Marcin JurdzińskiUniversity of Warwick, Department of Computer ScienceVerified email at warwick.ac.uk
Floris GeertsUniversity of AntwerpVerified email at uantwerp.be
Geraud SenizerguesLaBRI, Bordeaux universityVerified email at u-bordeaux.fr

Filip Mazowiecki

University of Warsaw

Verified email at mimuw.edu.pl - Homepage

Formal verification vector addition systems weighted automata


Title Sort by citations Sort by year Sort by 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	172	2020
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	48	2021
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	24	2021
Copyless cost-register automata: Structure, expressiveness, and closure properties F Mazowiecki, C Riveros Journal of Computer and System Sciences 100, 1-29, 2019	23	2019
On polynomial recursive sequences M Cadilhac, F Mazowiecki, C Paperman, M Pilipczuk, G Sénizergues Theory of Computing Systems, 1-22, 2021	18	2021
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	17	2020
Pumping lemmas for weighted automata F Mazowiecki, C Riveros 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), 2018	16	2018
A robust class of linear recurrence sequences C Barloy, N Fijalkow, N Lhote, F Mazowiecki Information and Computation 289, 104964, 2022	15	2022
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	15	2018
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	15	2017
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	13	2014
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	12	2017
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	11	2023
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	11	2015
Dynamic data structures for timed automata acceptance A Grez, F Mazowiecki, M Pilipczuk, G Puppis, C Riveros Algorithmica 84 (11), 3223-3245, 2022	9	2022
Pumping lemmas for weighted automata A Chattopadhyay, F Mazowiecki, A Muscholl, C Riveros Logical Methods in Computer Science 17, 2021	9	2021
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	7	2022
Continuous one-counter automata M Blondin, T Leys, F Mazowiecki, P Offtermatt, G Pérez ACM Transactions on Computational Logic 24 (1), 1-31, 2023	6	2023
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	6	2021

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors