| 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 | 179 | 2020 |
| Reachability in vector addition systems is Ackermann-complete W Czerwiński, Ł Orlikowski 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 105 | 2022 |
| 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 | 67 | 2013 |
| 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 | 53 | 2019 |
| 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 | 30 | 2016 |
| 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 | 25 | 2021 |
| 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 | 24 | 2021 |
| Shortest paths in one-counter systems M Wehar, M Pilipczuk, P Hofman, W Czerwiński, D Chistikov Logical Methods in Computer Science 15, 2019 | 24* | 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 | 24 | 2017 |
| Separability of Reachability Sets of Vector Addition Systems L Clemente, W Czerwiński, S Lasota, C Paperman arXiv preprint arXiv:1609.00214, 2016 | 24 | 2016 |
| 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 | 22 | 2014 |
| Fast equivalence-checking for normed context-free processes. W Czerwinski, S Lasota FSTTCS 2010, 260-271, 2010 | 22 | 2010 |
| 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 | 19 | 2015 |
| 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 | 18 | 2020 |
| Unboundedness problems for languages of vector addition systems W Czerwiński, P Hofman, G Zetzsche arXiv preprint arXiv:1802.06683, 2018 | 14 | 2018 |
| Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes W Czerwinski, L Orlikowski Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022 | 12 | 2022 |
Slawomir LasotaUniversity of Warsaw, prof. of computer scienceVerified email at mimuw.edu.pl
