Follow
Łukasz Orlikowski
Łukasz Orlikowski
Verified email at students.mimuw.edu.pl
Title
Cited by
Cited by
Year
Reachability in vector addition systems is Ackermann-complete
W Czerwiński, Ł Orlikowski
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
732022
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
82022
Reachability in vector addition systems is Ackermann-complete. CoRR abs/2104.13866 (2021)
W Czerwinski, L Orlikowski
arXiv preprint arXiv:2104.13866, 2021
42021
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
42021
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
2023
The system can't perform the operation now. Try again later.
Articles 1–5