| Reachability in vector addition systems is Ackermann-complete W Czerwiński, Ł Orlikowski 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 82 | 2022 |
| 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 | 9 | 2022 |
| Improved lower bounds for reachability in vector addition systems W Czerwiński, S Lasota, Ł Orlikowski 48th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021 | 5 | 2021 |
| Reachability in vector addition systems is Ackermann-complete. CoRR abs/2104.13866 (2021) W Czerwinski, L Orlikowski arXiv preprint arXiv:2104.13866, 2021 | 4 | 2021 |
| New Lower Bounds for Reachability in Vector Addition Systems W Czerwiński, I Jecker, S Lasota, J Leroux, Ł Orlikowski arXiv preprint arXiv:2310.09008, 2023 | 2 | 2023 |
