Urmãriți
Wojciech Czerwinski
Wojciech Czerwinski
University of Warsaw
Adresã de e-mail confirmatã pe mimuw.edu.pl - Pagina de pornire
Titlu
Citat de
Citat de
Anul
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
1772020
Reachability in vector addition systems is Ackermann-complete
W Czerwiñski, £ Orlikowski
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
1012022
Efficient separability of regular languages by subsequences and suffixes
W Czerwiñski, W Martens, T Masopust
International Colloquium on Automata, Languages, and Programming, 150-161, 2013
672013
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games
W Czerwiñski, L Daviaud, N Fijalkow, M Jurdziñski, R Laziæ, P Parys
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
532019
A Characterization for Decidable Separability by Piecewise Testable Languages
G Zetzsche, M Zeitoun, L van Rooijen, W Martens, W Czerwiñski
Discrete Mathematics & Theoretical Computer Science 19, 2017
42*2017
Deciding definability by deterministic regular expressions
W Czerwiñski, C David, K Losemann, W Martens
Journal of Computer and System Sciences, 2017
34*2017
Regular Separability of One Counter Automata
S Lasota, W Czerwiñski
Logical Methods in Computer Science 15, 2019
32*2019
Regular Separability of Parikh Automata
L Clemente, W Czerwiñski, S Lasota, C Paperman
arXiv preprint arXiv:1612.06233, 2016
302016
Improved bounds for the excluded-minor approximation of treedepth
W Czerwinski, W Nadara, M Pilipczuk
SIAM Journal on Discrete Mathematics 35 (2), 934-947, 2021
252021
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles
J Chen, W Czerwiñski, Y Disser, AE Feldmann, D Hermelin, W Nadara, ...
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
242021
Regular separability of well structured transition systems
W Czerwiñski, S Lasota, R Meyer, S Muskalla, KN Kumar, P Saivasan
arXiv preprint arXiv:1702.05334, 2017
242017
Separability of Reachability Sets of Vector Addition Systems
L Clemente, W Czerwiñski, S Lasota, C Paperman
arXiv preprint arXiv:1609.00214, 2016
242016
Shortest paths in one-counter systems
M Wehar, M Pilipczuk, P Hofman, W Czerwiñski, D Chistikov
Logical Methods in Computer Science 15, 2019
23*2019
Decidability of branching bisimulation on normed commutative context-free processes
W Czerwiñski, P Hofman, S Lasota
Theory of Computing Systems 55 (1), 136-169, 2014
222014
Fast equivalence-checking for normed context-free processes.
W Czerwinski, S Lasota
FSTTCS 2010, 260-271, 2010
222010
Minimization of Tree Patterns
W CzerwiÑski, W Martens, M Niewerth, P Parys
Journal of the ACM (JACM) 65 (4), 26, 2018
20*2018
The (almost) complete guide to tree pattern containment
W Czerwiñski, W Martens, P Parys, M Przybylko
Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2015
192015
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
Unboundedness problems for languages of vector addition systems
W Czerwiñski, P Hofman, G Zetzsche
arXiv preprint arXiv:1802.06683, 2018
142018
Reachability Problem for Weak Multi-Pushdown Automata
S£ Lasota, P Hofman, W Czerwiñski
Logical Methods in Computer Science 9, 2013
12*2013
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–20