Obserwuj
Filip Mazowiecki
Tytuł
Cytowane przez
Cytowane przez
Rok
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
1152020
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
34*2016
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
182021
Copyless cost-register automata: Structure, expressiveness, and closure properties
F Mazowiecki, C Riveros
Journal of Computer and System Sciences 100, 1-29, 2019
17*2019
Affine extensions of integer vector addition systems with states
M Raskin, F Mazowiecki, C Haase, M Blondin
Logical Methods in Computer Science 17, 2021
142021
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
Polynomial-space completeness of reachability for succinct branching VASS in dimension one
D Figueira, R Lazić, J Leroux, F Mazowiecki, G Sutre
International Colloquium on Automata, Languages, and Programming (ICALP), 119, 2017
142017
Pumping lemmas for weighted automata
F Mazowiecki, C Riveros
35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), 2018
122018
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
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
112017
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
On polynomial recursive sequences
M Cadilhac, F Mazowiecki, C Paperman, M Pilipczuk, G Sénizergues
Theory of Computing Systems, 1-22, 2021
102021
A robust class of linear recurrence sequences
C Barloy, N Fijalkow, N Lhote, F Mazowiecki
arXiv preprint arXiv:1908.03890, 2019
72019
Weak cost register automata are still powerful
S Almagor, M Cadilhac, F Mazowiecki, GA Pérez
International Conference on Developments in Language Theory, 83-95, 2018
62018
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
52020
Monadic datalog and regular tree pattern queries
F Mazowiecki, F Murlak, A Witkowski
ACM Transactions on Database Systems (TODS) 41 (3), 1-43, 2016
32016
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
22021
The monitoring problem for timed automata
A Grez, F Mazowiecki, M Pilipczuk, G Puppis, C Riveros
arXiv preprint arXiv:2002.07049, 2020
22020
Pumping lemmas for weighted automata
A Chattopadhyay, F Mazowiecki, A Muscholl, C Riveros
arXiv preprint arXiv:2001.06272, 2020
22020
Eliminating recursion from monadic datalog programs on trees
F Mazowiecki, J Ochremiak, A Witkowski
International Symposium on Mathematical Foundations of Computer Science, 394-406, 2015
22015
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20