The Tractability Border of Reachability in Simple Vector Addition Systems with States.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024
New Lower Bounds for Reachability in Vector Addition Systems.
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023
Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022
Improved Lower Bounds for Reachability in Vector Addition Systems.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
Reachability in Vector Addition Systems is Ackermann-complete.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021