Wojciech Czerwinski
Wojciech Czerwinski
Verified email at mimuw.edu.pl - Homepage
Cited by
Cited by
The reachability problem for Petri nets is not elementary
W Czerwiński, S Lasota, R Lazić, J Leroux, F Mazowiecki
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing†…, 2019
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
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
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
Deciding definability by deterministic regular expressions
W Czerwiński, C David, K Losemann, W Martens
Journal of Computer and System Sciences, 2017
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
Fast equivalence-checking for normed context-free processes.
W Czerwinski, S Lasota
FSTTCS 2010, 260-271, 2010
Regular Separability of One Counter Automata
S Lasota, W Czerwiński
Logical Methods in Computer Science 15, 2019
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
Minimization of Tree Patterns
W CzerwiŃski, W Martens, M Niewerth, P Parys
Journal of the ACM (JACM) 65 (4), 26, 2018
Reachability Problem for Weak Multi-Pushdown Automata
SŁ Lasota, P Hofman, W Czerwiński
Logical Methods in Computer Science 9, 2013
Shortest paths in one-counter systems
M Wehar, M Pilipczuk, P Hofman, W Czerwiński, D Chistikov
Logical Methods in Computer Science 15, 2019
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
Regular Separability of Parikh Automata
L Clemente, W Czerwiński, S Lasota, C Paperman
arXiv preprint arXiv:1612.06233, 2016
Partially-commutative context-free processes: Expressibility and tractability
W Czerwiński, S FrŲschle, S Lasota
Information and Computation 209 (5), 782-798, 2011
Improved bounds for the excluded-minor approximation of treedepth
W Czerwiński, W Nadara, M Pilipczuk
arXiv preprint arXiv:1904.13077, 2019
Separability of Reachability Sets of Vector Addition Systems
L Clemente, W Czerwiński, S Lasota, C Paperman
arXiv preprint arXiv:1609.00214, 2016
Partially-commutative context-free languages
W Czerwiński, S Lasota
arXiv preprint arXiv:1208.2747, 2012
Branching bisimilarity of normed BPA processes is in NEXPTIME
W Czerwinski, P Jancar
Logic in Computer Science (LICS), 2015 30th Annual ACM/IEEE Symposium on†…, 2015
Partially-commutative context-free graphs
W Czerwinski
PhD thesis, University of Warsaw, 2012
The system can't perform the operation now. Try again later.
Articles 1–20