Publikacje

Conference: Foundations of Software Technology and Theoretical Computer Science

2023

• Dmitry Chistikov, Wojciech Czerwiński , Piotr Hofman , Filip Mazowiecki , Henry Sinclair-Banks, Acyclic Petri and Workflow Nets with Resets, 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India, 18 grudnia 2023 - 20 grudnia 2023. Zobacz w PBN
• Wojciech Czerwiński , Maciej Dębski, Tomasz Gogacz , Gordon Ho, Sanjay Jain, Michał Skrzypczak , Frank Stephan, Christopher Tan, Languages Given by Finite Automata over the Unary Alphabet, 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India, 18 grudnia 2023 - 20 grudnia 2023. Zobacz w PBN
• Wojciech Czerwiński , Ismaël Jecker , Sławomir Lasota , Jérôme Leroux, Łukasz Orlikowski , New Lower Bounds for Reachability in Vector Addition Systems, 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India, 18 grudnia 2023 - 20 grudnia 2023. Zobacz w PBN

2021

• Sławomir Lasota , Mohnish Pattathurajan, Parikh Images of Register Automata, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Virtual, India, 14 grudnia 2021 - 17 grudnia 2021, 213 2021, s. 50:1--50:14. Zobacz w PBN

2020

• Paweł Parys , Higher-Order Nonemptiness Step by Step, 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020, Goa, India, 14 grudnia 2020 - 18 grudnia 2020, 182 2020, s. 53:1-53:14. Zobacz w PBN
• Udi Boker, Denis Kuperberg, Michał Skrzypczak , Karoliina Lehtinen, On the Succinctness of Alternating Parity Good-For-Games Automata, Leibniz International Proceedings in Informatics, 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020, Goa, India, 14 grudnia 2020 - 18 grudnia 2020, 182 2020, s. 41:1--41:13. Zobacz w PBN

2018

• Udi Boker, Orna Kupferman, Michał Skrzypczak , How Deterministic are Good-For-Games Automata?, 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Kanpur, India, 11 grudnia 2017 - 15 grudnia 2017. Zobacz w PBN
• Paweł Parys , The Complexity of the Diagonal Problem for Recursion Schemes, 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Kanpur, India, 11 grudnia 2017 - 15 grudnia 2017. Zobacz w PBN