Lukasz Orlikowski

According to our database, Lukasz Orlikowski authored at least 4 papers between 2021 and 2023.

Collaborative distances:

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

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