Wojciech Czerwinski

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 58

Top Topics

Transition Systems

Finite Automata

Top Venues

Publications

Wojciech Czerwinski
Challenges of the Reachability Problem in Infinite-State Systems (Invited Paper). MFCS (2024)
Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Jérôme Leroux, Lukasz Orlikowski
New Lower Bounds for Reachability in Vector Addition Systems. CoRR (2023)
Wojciech Czerwinski, Maciej Debski, Tomasz Gogasz, Gordon Hoi, Sanjay Jain, Michal Skrzypczak, Frank Stephan, Christopher Tan
Languages Given by Finite Automata over the Unary Alphabet. FSTTCS (2023)
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Filip Mazowiecki, Henry Sinclair-Banks
Acyclic Petri and Workflow Nets with Resets. FSTTCS (2023)
Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Jérôme Leroux, Lukasz Orlikowski
New Lower Bounds for Reachability in Vector Addition Systems. FSTTCS (2023)
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Filip Mazowiecki, Henry Sinclair-Banks
Acyclic Petri and Workflow Nets with Resets. CoRR (2023)
Wojciech Czerwinski, Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus A. Whiteland
The boundedness and zero isolation problems for weighted automata over nonnegative rationals. LICS (2022)
Wojciech Czerwinski, Lukasz Orlikowski
Reachability in Vector Addition Systems is Ackermann-complete. FOCS (2022)
Wojciech Czerwinski, Piotr Hofman
Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable. CoRR (2022)
Wojciech Czerwinski, Piotr Hofman
Language Inclusion for Boundedly-Ambiguous Vector Addition Systems Is Decidable. CONCUR (2022)
Wojciech Czerwinski, Lukasz Orlikowski
Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes. LICS (2022)
Wojciech Czerwinski, Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus A. Whiteland
The boundedness and zero isolation problems for weighted automata over nonnegative rationals. CoRR (2022)
Wojciech Czerwinski, Lukasz Orlikowski
Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes. CoRR (2022)
Wojciech Czerwinski
Involved VASS Zoo (Invited Talk). CONCUR (2022)
Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk
Improved Bounds for the Excluded-Minor Approximation of Treedepth. SIAM J. Discret. Math. 35 (2) (2021)
Wojciech Czerwinski, Adam Jedrych
Long Runs Imply Big Separators in Vector Addition Systems. CoRR (2021)
Wojciech Czerwinski, Antoine Mottet, Karin Quaas
New Techniques for Universality in Unambiguous Register Automata. CoRR (2021)
Wojciech Czerwinski, Lukasz Orlikowski
Reachability in Vector Addition Systems is Ackermann-complete. FOCS (2021)
Wojciech Czerwinski, Antoine Mottet, Karin Quaas
New Techniques for Universality in Unambiguous Register Automata. ICALP (2021)
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
The Reachability Problem for Petri Nets Is Not Elementary. J. ACM 68 (1) (2021)
Wojciech Czerwinski, Slawomir Lasota, Lukasz Orlikowski
Improved Lower Bounds for Reachability in Vector Addition Systems. ICALP (2021)
Wojciech Czerwinski, Lukasz Orlikowski
Reachability in Vector Addition Systems is Ackermann-complete. CoRR (2021)
Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. SODA (2021)
Wojciech Czerwinski, Georg Zetzsche
An Approach to Regular Separability in Vector Addition Systems. LICS (2020)
Wojciech Czerwinski, Diego Figueira, Piotr Hofman
Universality Problem for Unambiguous VASS. CONCUR (2020)
Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Michal Pilipczuk, Marcin Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz
On Dynamic Parameterized k-Path. CoRR (2020)
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
Reachability in fixed dimension vector addition systems with states. CoRR (2020)
Wojciech Czerwinski, Georg Zetzsche
An Approach to Regular Separability in Vector Addition Systems. CoRR (2020)
Wojciech Czerwinski, Diego Figueira, Piotr Hofman
Universality Problem for Unambiguous VASS. CoRR (2020)
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
Reachability in Fixed Dimension Vector Addition Systems with States. CONCUR (2020)
Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. SODA (2019)
Wojciech Czerwinski, Slawomir Lasota
Regular Separability of One Counter Automata. Log. Methods Comput. Sci. 15 (2) (2019)
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar
Shortest paths in one-counter systems. Log. Methods Comput. Sci. 15 (1) (2019)
Wojciech Czerwinski, Slawomir Lasota, Christof Löding, Radoslaw Piórkowski
New Pumping Technique for 2-Dimensional VASS. MFCS (2019)
Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk
Improved bounds for the excluded-minor approximation of treedepth. CoRR (2019)
Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk
Improved Bounds for the Excluded-Minor Approximation of Treedepth. ESA (2019)
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
The reachability problem for Petri nets is not elementary. STOC (2019)
Wojciech Czerwinski, Slawomir Lasota, Christof Löding, Radoslaw Piórkowski
New Pumping Technique for 2-dimensional VASS. CoRR (2019)
Wojciech Czerwinski, Piotr Hofman, Georg Zetzsche
Unboundedness Problems for Languages of Vector Addition Systems. ICALP (2018)
Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys
Minimization of Tree Patterns. J. ACM 65 (4) (2018)
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract). CoRR (2018)
Wojciech Czerwinski, Claire David, Filip Murlak, Pawel Parys
Reasoning about integrity constraints for tree-structured data. Theory Comput. Syst. 62 (4) (2018)
Wojciech Czerwinski, Piotr Hofman, Georg Zetzsche
Unboundedness problems for languages of vector addition systems. CoRR (2018)
Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. CoRR (2018)
Wojciech Czerwinski, Slawomir Lasota, Roland Meyer, Sebastian Muskalla, K. Narayan Kumar, Prakash Saivasan
Regular Separability of Well-Structured Transition Systems. CONCUR (2018)
Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman
Regular Separability of Parikh Automata. ICALP (2017)
Wojciech Czerwinski, Slawomir Lasota
Regular separability of one counter automata. LICS (2017)
Wojciech Czerwinski, Claire David, Katja Losemann, Wim Martens
Deciding definability by deterministic regular expressions. J. Comput. Syst. Sci. 88 (2017)
Wojciech Czerwinski, Wim Martens, Lorijn van Rooijen, Marc Zeitoun, Georg Zetzsche
A Characterization for Decidable Separability by Piecewise Testable Languages. Discret. Math. Theor. Comput. Sci. 19 (4) (2017)
Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys
Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data. SIGMOD Rec. 46 (1) (2017)
Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman
Separability of Reachability Sets of Vector Addition Systems. STACS (2017)
Wojciech Czerwinski, Slawomir Lasota
Regular Separability of One Counter Automata. CoRR (2017)
Wojciech Czerwinski, Slawomir Lasota
Regular Separability of Well Structured Transition Systems. CoRR (2017)
Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman
Regular Separability of Parikh Automata. CoRR (2016)
Wojciech Czerwinski, Claire David, Filip Murlak, Pawel Parys
Reasoning About Integrity Constraints for Tree-Structured Data. ICDT (2016)
Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman
Separability of Reachability Sets of Vector Addition Systems. CoRR (2016)
Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys
Minimization of Tree Pattern Queries. PODS (2016)
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar
Shortest Paths in One-Counter Systems. FoSSaCS (2016)
Wojciech Czerwinski, Tomasz Gogacz, Eryk Kopczynski
Non-dominating Sequences of Vectors Using only Resets and Increments. Fundam. Informaticae 140 (2) (2015)
Wojciech Czerwinski, Petr Jancar
Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME. LICS (2015)
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar
Shortest paths in one-counter systems. CoRR (2015)
Wojciech Czerwinski, Wim Martens, Lorijn van Rooijen, Marc Zeitoun
A Note on Decidable Separability by Piecewise Testable Languages. FCT (2015)
Wojciech Czerwinski, Tomasz Gogacz, Eryk Kopczynski
Non-dominating sequences of vectors using only resets and increments. CoRR (2015)
Wojciech Czerwinski, Wim Martens, Pawel Parys, Marcin Przybylko
The (Almost) Complete Guide to Tree Pattern Containment. PODS (2015)
Wojciech Czerwinski, Wim Martens
A Note on Decidable Separability by Piecewise Testable Languages. CoRR (2014)
Wojciech Czerwinski, Petr Jancar
Branching Bisimilarity of Normed BPA Processes is in NEXPTIME. CoRR (2014)
Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. Theory Comput. Syst. 55 (1) (2014)
Wojciech Czerwinski, Petr Jancar, Martin Kot, Zdenek Sawa
Complexity of Checking Bisimilarity between Sequential and Parallel Processes. MFCS (2013)
Wojciech Czerwinski, Wim Martens, Tomás Masopust
Efficient Separability of Regular Languages by Subsequences and Suffixes. ICALP (2) (2013)
Wojciech Czerwinski, Wim Martens, Tomás Masopust
Efficient Separability of Regular Languages by Subsequences and Suffixes CoRR (2013)
Wojciech Czerwinski, Claire David, Katja Losemann, Wim Martens
Deciding Definability by Deterministic Regular Expressions. FoSSaCS (2013)
Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota
Reachability Problem for Weak Multi-Pushdown Automata. Log. Methods Comput. Sci. 9 (3) (2013)
Wojciech Czerwinski, Slawomir Lasota
Partially-commutative context-free languages EXPRESS/SOS (2012)
Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota
Reachability Problem for Weak Multi-Pushdown Automata. CONCUR (2012)
Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. CONCUR (2011)
Wojciech Czerwinski, Sibylle B. Fröschle, Slawomir Lasota
Partially-commutative context-free processes: Expressibility and tractability. Inf. Comput. 209 (5) (2011)
Wojciech Czerwinski, Slawomir Lasota
Fast equivalence-checking for normed context-free processes. FSTTCS (2010)
Wojciech Czerwinski, Sibylle B. Fröschle, Slawomir Lasota
Partially-Commutative Context-Free Processes. CONCUR (2009)