Publications

Wojciech Czerwiński

Number of publications: 49

2024

• Wojciech Czerwiński , Challenges of the Reachability Problem in Infinite-State Systems (Invited Paper), International Symposium on Mathematical Foundations of Computer Science, Bratislava, Slovakia, 26 August 2024 - 30 August 2024. See in PBN

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 December 2023 - 20 December 2023. See in 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 December 2023 - 20 December 2023. See in 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 December 2023 - 20 December 2023. See in PBN

2022

• Wojciech Czerwiński , Involved VASS Zoo, 33rd International Conference on Concurrency Theory, Warszawa, Poland, 12 September 2022 - 16 September 2022. See in PBN
• Wojciech Czerwiński , Piotr Hofman , Language Inclusion for Boundedly-Ambiguous Vector Addition Systems Is Decidable, 33rd International Conference on Concurrency Theory, Warszawa, Poland, 12 September 2022 - 16 September 2022. See in PBN
• Wojciech Czerwiński , Łukasz Orlikowski, Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes, 37'th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, 2 August 2022 - 5 August 2022. See in PBN
• Wojciech Czerwiński , Łukasz Orlikowski, Reachability in Vector Addition Systems is Ackermann-complete, 62nd IEEE Annual Symposium on Foundations of Computer Science, Denver, the United States of America, 7 February 2022 - 10 February 2022. See in PBN
• Wojciech Czerwiński , Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus Whiteland, The boundedness and zero isolation problems for weighted automata over nonnegative rationals, 37'th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, 2 August 2022 - 5 August 2022. See in PBN

2021

• Jiehua Chen, Wojciech Czerwiński , Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara , Marcin Pilipczuk , Michał Pilipczuk , Manuel Sorge, Bartłomiej Wróblewski, Anna Zych-Pawlewicz , Efficient fully dynamic elimination forests with applications to detecting long paths and cycles, the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, Virginia (Virtual Conference), the United States of America, 10 January 2021 - 13 January 2021. See in PBN
• Wojciech Czerwiński , Wojciech Nadara , Marcin Pilipczuk , Improved Bounds for the Excluded-Minor Approximation of Treedepth, SIAM JOURNAL ON DISCRETE MATHEMATICS, 35 (2) 2021, p. 934-947. See in PBN
• Wojciech Czerwiński , Sławomir Lasota , Łukasz Orlikowski, Improved Lower Bounds for Reachability in Vector Addition Systems, 48th International Colloquium on Automata, Languages and Programming, Glasgow, the United Kingdom of Great Britain and Northern Ireland, 12 July 2021 - 16 July 2021. See in PBN
• Wojciech Czerwiński , Antoine Mottet, Karin Quaas, New Techniques for Universality in Unambiguous Register Automata, 48th International Colloquium on Automata, Languages and Programming, Glasgow, the United Kingdom of Great Britain and Northern Ireland, 12 July 2021 - 16 July 2021. See in PBN
• Wojciech Czerwiński , Sławomir Lasota , Ranko Lazić, JÉrôme Leroux, Filip Mazowiecki, The Reachability Problem for Petri Nets Is Not Elementary, JOURNAL OF THE ACM, 68 (1) 2021, p. 1-28. See in PBN

2020

• Georg Zetzsche, Wojciech Czerwiński , An Approach to Regular Separability in Vector Addition Systems, 35th Annual {ACM/IEEE} Symposium on Logic in Computer Science, Saarbrücken, Germany, 8 July 2020 - 11 July 2020. See in PBN
• Wojciech Czerwiński , Sławomir Lasota , Ranko Lazic, Jerome Leroux, Filip Mazowiecki, Reachability in Fixed Dimension Vector Addition Systems with States, 31st International Conference on Concurrency Theory, Vienna, Austria, 1 September 2020 - 4 September 2020. See in PBN
• Piotr Hofman , Wojciech Czerwiński , Diego Figueira, Universality Problem for Unambiguous VASS, Leibniz International Proceedings in Informatics, LIPIcs, 2020. See in PBN
• Wojciech Czerwiński , Piotr Hofman , Diego Figueira, Universality Problem for Unambiguous VASS, 31st International Conference on Concurrency Theory, Vienna, Austria, 1 September 2020 - 4 September 2020. See in PBN

2019

• Wojciech Czerwiński , Wojciech Nadara , Marcin Pilipczuk , Improved Bounds for the Excluded-Minor Approximation of Treedepth, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 September 2019 - 13 September 2019, 144 2019, p. 34:1--34:13. See in PBN
• Wojciech Czerwiński , Sławomir Lasota , Löding, Christof, Radosław Piórkowski, New Pumping Technique for 2-Dimensional VASS, Leibniz International Proceedings in Informatics, 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, Aachen, Germany, 26 August 2019 - 30 August 2019, 138 2019, p. 62:1--62:14. See in PBN
• Wojciech Czerwiński , Sławomir Lasota , Regular Separability of One Counter Automata, Logical Methods in Computer Science, 15 (2) 2019, p. 20:1–20:27. See in PBN
• Dmitry Chistikov, Wojciech Czerwiński , Piotr Hofman , Michał Pilipczuk , Michael Wehar, Shortest paths in one-counter systems, Logical Methods in Computer Science, 15 (1) 2019, p. 19:1–19:28. See in PBN
• Wojciech Czerwiński , Sławomir Lasota , Ranko Lazić, Jérôme Leroux, Filip Mazowiecki, The reachability problem for Petri nets is not elementary, 51st ACM Symposium on Theory of Computing, Phoenix, the United States of America, 23 June 2019 - 26 June 2019. See in PBN
• Wojciech Czerwiński , Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdziński, Ranko Lazić, Paweł Parys , Universal Trees Grow Inside Separating Automata: Quasi-Polynomial Lower Bounds for Parity Games, 30th ACM-SIAM Symposium on Discrete Algorithms, San Diego, the United States of America, 6 January 2019 - 9 January 2019. See in PBN

2018

• Wojciech Czerwiński , Wim Martens, Matthias Niewerth, Paweł Parys , Minimization of Tree Patterns, JOURNAL OF THE ACM, 65 (4) 2018, p. 26:1-26:46. See in PBN
• Wojciech Czerwiński , Claire David, Filip Murlak , Paweł Parys , Reasoning About Integrity Constraints for Tree-Structured Data, Theory of Computing Systems, 62 (4) 2018, p. 941–976. See in PBN
• Wojciech Czerwiński , K. Narayan Kumar, Sławomir Lasota , Roland Meyer, Sebastian Muskalla, Prakash Saivasan, Regular Separability of Well-Structured Transition Systems, 29th International Conference on Concurrency Theory, Beijing, China, 4 September 2018 - 7 September 2018. See in PBN
• Wojciech Czerwiński , Piotr Hofman , Georg Zetzsche, Unboundedness Problems for Languages of Vector Addition Systems, 45th International Colloquium on Automata, Languages, and Programming, Praha, Czechia, 9 July 2018 - 13 July 2018. See in PBN

2017

• Damian Niwiński , Henryk Michalewski , Wojciech Rytter , Joost Winter, Michał Skrzypczak , Szymon Toruńczyk , Michał Pilipczuk , Eryk Kopczyński , Sławomir Lasota , Paweł Parys , Joanna Ochremiak, Wojciech Czerwiński , Bartosz Klin , Igor Walukiewicz, Szczepan Hummel, Mikołaj Bojańczyk , Piotr Hofman , Lorenzo Clemente , Filip Mazowiecki, Filip Murlak , 200 Problems in Formal Languages and Automata Theory, 2017. See in PBN
• Wojciech Czerwiński , Claire David, Katja Losemann, Wim Martens, Deciding definability by deterministic regular expressions, Journal of Computer and System Sciences, 88 2017, p. 75-89. See in PBN
• Wojciech Czerwiński , Wim Martens, Matthias Niewerth, Paweł Parys , Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data, SIGMOD Record, 46 (1) 2017, p. 15–22. See in PBN
• Wojciech Czerwiński , Sławomir Lasota , Regular separability of one counter automata, Thirty-Second Annual ACM/IEEE Symposium on Logic in Computer Science, Reykjavik, Iceland, 20 June 2017 - 23 June 2017. See in PBN
• Charles Paperman, Sławomir Lasota , Wojciech Czerwiński , Lorenzo Clemente , Regular Separability of Parikh Automata, 44th International Colloquium on Automata, Languages, and Programming, Warszawa, Poland, 10 July 2017 - 14 July 2017. See in PBN
• Sławomir Lasota , Charles Paperman, Wojciech Czerwiński , Lorenzo Clemente , Separability of Reachability Sets of Vector Addition Systems, 34th International Symposium on Theoretical Aspects of Computer Science, Hannover, Germany, 8 March 2017 - 11 March 2017. See in PBN

2016

• Wojciech Czerwiński , Wim Martens, Matthias Niewerth, Paweł Parys , Minimization of Tree Pattern Queries, 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, San Francisco, the United States of America, 26 June 2016 - 1 July 2016. See in PBN
• Wojciech Czerwiński , Paweł Parys , Filip Murlak , Claire David, Reasoning About Integrity Constraints for Tree-Structured Data, 19th International Conference on Database Theory, Bordeaux, France, 15 March 2016 - 18 March 2016. See in PBN
• Dmitry Chistikov, Wojciech Czerwiński , Piotr Hofman , Michał Pilipczuk , Michael Wehar, Shortest Paths in One-Counter Systems, 19th International Conference on Foundations of Software Science and Computation Structures, Eindhoven, the Netherlands, 2 April 2016 - 8 April 2016. See in PBN

2015

• Wojciech Czerwiński , Wim Martens, Lorijn van Rooijen, Marc Zeitoun, A Note on Decidable Separability by Piecewise Testable Languages, 2015. See in PBN
• Wojciech Czerwiński , Petr Jancar, Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME, 2015. See in PBN
• Wojciech Czerwiński , Tomasz Gogacz, Eryk Kopczyński , Non-dominating Sequences of Vectors Using only Resets and Increments, Fundamenta Informaticae, 2015. See in PBN
• Wojciech Czerwiński , Wim Martens, Paweł Parys , Marcin Przybyłko, The (Almost) Complete Guide to Tree Pattern Containment, 34th ACM Symposium on Principles of Database Systems, PODS 2015, Melbourne, Victoria, Australia, May 31 - June 4, 2015, Melbourne, Australia, 31 May 2015 - 4 June 2015. See in PBN

2014

• Wojciech Czerwiński , Piotr Hofman , Sławomir Lasota , Decidability of branching bisimulation on normed commutative context-free processes, Theory of Computing Systems, 2014. See in PBN

2013

• Wojciech Czerwiński , Piotr Hofman , Sławomir Lasota , Reachability problem for weak multi-pushdown automata, Logical Methods in Computer Science, 2013. See in PBN

2012

• Wojciech Czerwiński , Sławomir Lasota , Partially-commutative context-free languages, Electronic Proceedings in Theoretical Computer Science, 2012. See in PBN
• Wojciech Czerwiński , Piotr Hofman , Sławomir Lasota , Reachability Problem for Weak Multi-Pushdown Automata, 23rd International Conference, CONCUR 2012, Newcastle upon Tyne, the United Kingdom of Great Britain and Northern Ireland, 4 September 2012 - 7 September 2012. See in PBN

2011

• Wojciech Czerwiński , Piotr Hofman , Sławomir Lasota , Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes, Lecture Notes in Computer Science, 2011. See in PBN

2010

• Wojciech Czerwiński , Sławomir Lasota , Fast equivalence-checking for normed context-free processes, 2010. See in PBN

2009

• Wojciech Czerwiński , Sibylle B. Fröschle, Sławomir Lasota , Partially-Commutative Context-Free Processes, Lecture Notes in Computer Science, 2009. See in PBN

2008

• Wojciech Czerwiński , Marek Orlik, Piotr Paklepa, Albin Wiśniewski, Piotr Wrona, The convection-driven non-additivity of the faradaic currents for the paralel reduction of some metal and hydrogen cations at the mercury electrode, Journal of Electroanalytical Chemistry, 2008. See in PBN