Lukasz Orlikowski

According to our database, Lukasz Orlikowski authored at least 10 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2026

Reachability in VASS Extended with Integer Counters.

Clotilde Bizière, Wojciech Czerwinski, Roland Guttenberg, Jérôme Leroux, Vincent Michielini, Lukasz Orlikowski, Antoni Puch, Henry Sinclair-Banks

CoRR, March, 2026

Exploring VASS Parameterised by Geometric Dimension.

Wojciech Czerwinski, Roland Guttenberg, Lukasz Orlikowski, Henry Sinclair-Banks, Yangluo Zheng

CoRR, February, 2026

2025

Language Equivalence is Undecidable in VASS with Restricted Nondeterminism.

Wojciech Czerwinski, Lukasz Orlikowski

CoRR, October, 2025

Reachability in 3-VASS Is Elementary.

Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Lukasz Orlikowski

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Languages of Boundedly-Ambiguous Vector Addition Systems with States.

Wojciech Czerwinski, Lukasz Orlikowski

Proceedings of the 36th International Conference on Concurrency Theory, 2025

2024

The Tractability Border of Reachability in Simple Vector Addition Systems with States.

Dmitry Chistikov, Wojciech Czerwinski, Filip Mazowiecki, Lukasz Orlikowski, Henry Sinclair-Banks, Karol Wegrzycki

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

New Lower Bounds for Reachability in Vector Addition Systems.

Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Jérôme Leroux, Lukasz Orlikowski

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

2022

Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes.

Wojciech Czerwinski, Lukasz Orlikowski

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

2021

Improved Lower Bounds for Reachability in Vector Addition Systems.

Wojciech Czerwinski, Slawomir Lasota, Lukasz Orlikowski

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Reachability in Vector Addition Systems is Ackermann-complete.

Wojciech Czerwinski, Lukasz Orlikowski

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021