Lia Schütze

According to our database, Lia Schütze authored at least 9 papers between 2022 and 2026.

Collaborative distances:

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

2026

Bounded Treewidth, Multiple Context-Free Grammars, and Downward Closures.

C. Aiswarya, Pascal Baumann, Prakash Saivasan, Lia Schütze, Georg Zetzsche

Proc. ACM Program. Lang., 2026

Well-quasi-orderings on word languages.

Nathan Lhote, Aliaume Lopez, Lia Schütze

Proceedings of the Foundations of Software Science and Computation Structures, 2026

2025

Coverability in VASS Revisited: Improving Rackoff's Bounds to Obtain Conditional Optimality.

Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki

J. ACM, October, 2025

2024

Verifying Unboundedness via Amalgamation.

Ashwani Anand, Sylvain Schmitz, Lia Schütze, Georg Zetzsche

Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

On the Length of Strongly Monotone Descending Chains over ℕ^d.

Sylvain Schmitz, Lia Schütze

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

On the Length of Strongly Monotone Descending Chains over N^d.

Sylvain Schmitz, Lia Schütze

CoRR, 2023

Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality.

Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Unboundedness Problems for Machines with Reversal-Bounded Counters.

Pascal Baumann, Flavio D'Alessandro, Moses Ganardi, Oscar H. Ibarra, Ian McQuillan, Lia Schütze, Georg Zetzsche

Proceedings of the Foundations of Software Science and Computation Structures, 2023

2022

Reachability in Bidirected Pushdown VASS.

Moses Ganardi, Rupak Majumdar, Andreas Pavlogiannis, Lia Schütze, Georg Zetzsche

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022