default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWojciech Czerwinski
Person information
- unicode name: Wojciech Czerwiński
- affiliation: University of Warsaw, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c38]Wojciech Czerwinski:
Challenges of the Reachability Problem in Infinite-State Systems (Invited Paper). MFCS 2024: 2:1-2:8- 2023
- [c37]Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Filip Mazowiecki, Henry Sinclair-Banks:
Acyclic Petri and Workflow Nets with Resets. FSTTCS 2023: 16:1-16:18 - [c36]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: 22:1-22:20 - [c35]Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Jérôme Leroux, Lukasz Orlikowski:
New Lower Bounds for Reachability in Vector Addition Systems. FSTTCS 2023: 35:1-35:22 - [i26]Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Filip Mazowiecki, Henry Sinclair-Banks:
Acyclic Petri and Workflow Nets with Resets. CoRR abs/2310.01992 (2023) - [i25]Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Jérôme Leroux, Lukasz Orlikowski:
New Lower Bounds for Reachability in Vector Addition Systems. CoRR abs/2310.09008 (2023) - 2022
- [c34]Wojciech Czerwinski:
Involved VASS Zoo (Invited Talk). CONCUR 2022: 5:1-5:13 - [c33]Wojciech Czerwinski, Piotr Hofman
:
Language Inclusion for Boundedly-Ambiguous Vector Addition Systems Is Decidable. CONCUR 2022: 16:1-16:22 - [c32]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: 15:1-15:13 - [c31]Wojciech Czerwinski, Lukasz Orlikowski:
Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes. LICS 2022: 40:1-40:12 - [i24]Wojciech Czerwinski, Piotr Hofman:
Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable. CoRR abs/2202.08033 (2022) - [i23]Wojciech Czerwinski, Lukasz Orlikowski:
Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes. CoRR abs/2203.04243 (2022) - [i22]Wojciech Czerwinski, Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus A. Whiteland:
The boundedness and zero isolation problems for weighted automata over nonnegative rationals. CoRR abs/2205.13516 (2022) - 2021
- [j13]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): 7:1-7:28 (2021) - [j12]Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk:
Improved Bounds for the Excluded-Minor Approximation of Treedepth. SIAM J. Discret. Math. 35(2): 934-947 (2021) - [c30]Wojciech Czerwinski, Lukasz Orlikowski:
Reachability in Vector Addition Systems is Ackermann-complete. FOCS 2021: 1229-1240 - [c29]Wojciech Czerwinski, Slawomir Lasota, Lukasz Orlikowski:
Improved Lower Bounds for Reachability in Vector Addition Systems. ICALP 2021: 128:1-128:15 - [c28]Wojciech Czerwinski, Antoine Mottet, Karin Quaas:
New Techniques for Universality in Unambiguous Register Automata. ICALP 2021: 129:1-129:16 - [c27]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: 796-809 - [i21]Wojciech Czerwinski, Antoine Mottet, Karin Quaas:
New Techniques for Universality in Unambiguous Register Automata. CoRR abs/2102.08331 (2021) - [i20]Wojciech Czerwinski, Lukasz Orlikowski:
Reachability in Vector Addition Systems is Ackermann-complete. CoRR abs/2104.13866 (2021) - [i19]Wojciech Czerwinski, Adam Jedrych:
Long Runs Imply Big Separators in Vector Addition Systems. CoRR abs/2105.00052 (2021) - 2020
- [c26]Wojciech Czerwinski, Diego Figueira, Piotr Hofman:
Universality Problem for Unambiguous VASS. CONCUR 2020: 36:1-36:15 - [c25]Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki:
Reachability in Fixed Dimension Vector Addition Systems with States. CONCUR 2020: 48:1-48:21 - [c24]Wojciech Czerwinski, Georg Zetzsche:
An Approach to Regular Separability in Vector Addition Systems. LICS 2020: 341-354 - [i18]Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki:
Reachability in fixed dimension vector addition systems with states. CoRR abs/2001.04327 (2020) - [i17]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 abs/2006.00571 (2020) - [i16]Wojciech Czerwinski, Georg Zetzsche:
An Approach to Regular Separability in Vector Addition Systems. CoRR abs/2007.00111 (2020) - [i15]Wojciech Czerwinski, Diego Figueira, Piotr Hofman:
Universality Problem for Unambiguous VASS. CoRR abs/2007.10907 (2020)
2010 – 2019
- 2019
- [j11]Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar:
Shortest paths in one-counter systems. Log. Methods Comput. Sci. 15(1) (2019) - [j10]Wojciech Czerwinski, Slawomir Lasota:
Regular Separability of One Counter Automata. Log. Methods Comput. Sci. 15(2) (2019) - [c23]Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk:
Improved Bounds for the Excluded-Minor Approximation of Treedepth. ESA 2019: 34:1-34:13 - [c22]Wojciech Czerwinski, Slawomir Lasota, Christof Löding, Radoslaw Piórkowski:
New Pumping Technique for 2-Dimensional VASS. MFCS 2019: 62:1-62:14 - [c21]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: 2333-2349 - [c20]Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki:
The reachability problem for Petri nets is not elementary. STOC 2019: 24-33 - [i14]Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk:
Improved bounds for the excluded-minor approximation of treedepth. CoRR abs/1904.13077 (2019) - [i13]Wojciech Czerwinski, Slawomir Lasota, Christof Löding, Radoslaw Piórkowski:
New Pumping Technique for 2-dimensional VASS. CoRR abs/1906.10494 (2019) - 2018
- [j9]Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys:
Minimization of Tree Patterns. J. ACM 65(4): 26:1-26:46 (2018) - [j8]Wojciech Czerwinski, Claire David, Filip Murlak, Pawel Parys:
Reasoning about integrity constraints for tree-structured data. Theory Comput. Syst. 62(4): 941-976 (2018) - [c19]Wojciech Czerwinski, Slawomir Lasota, Roland Meyer, Sebastian Muskalla, K. Narayan Kumar, Prakash Saivasan:
Regular Separability of Well-Structured Transition Systems. CONCUR 2018: 35:1-35:18 - [c18]Wojciech Czerwinski, Piotr Hofman, Georg Zetzsche:
Unboundedness Problems for Languages of Vector Addition Systems. ICALP 2018: 119:1-119:15 - [i12]Wojciech Czerwinski, Piotr Hofman, Georg Zetzsche:
Unboundedness problems for languages of vector addition systems. CoRR abs/1802.06683 (2018) - [i11]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 abs/1807.10546 (2018) - [i10]Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki:
The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract). CoRR abs/1809.07115 (2018) - 2017
- [j7]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) - [j6]Wojciech Czerwinski, Claire David, Katja Losemann, Wim Martens:
Deciding definability by deterministic regular expressions. J. Comput. Syst. Sci. 88: 75-89 (2017) - [j5]Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys:
Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data. SIGMOD Rec. 46(1): 15-22 (2017) - [c17]Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman:
Regular Separability of Parikh Automata. ICALP 2017: 117:1-117:13 - [c16]Wojciech Czerwinski, Slawomir Lasota:
Regular separability of one counter automata. LICS 2017: 1-12 - [c15]Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman:
Separability of Reachability Sets of Vector Addition Systems. STACS 2017: 24:1-24:14 - [i9]Wojciech Czerwinski, Slawomir Lasota:
Regular Separability of One Counter Automata. CoRR abs/1701.02808 (2017) - [i8]Wojciech Czerwinski, Slawomir Lasota:
Regular Separability of Well Structured Transition Systems. CoRR abs/1702.05334 (2017) - 2016
- [c14]Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar:
Shortest Paths in One-Counter Systems. FoSSaCS 2016: 462-478 - [c13]Wojciech Czerwinski, Claire David, Filip Murlak, Pawel Parys:
Reasoning About Integrity Constraints for Tree-Structured Data. ICDT 2016: 20:1-20:18 - [c12]Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys:
Minimization of Tree Pattern Queries. PODS 2016: 43-54 - [i7]Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman:
Separability of Reachability Sets of Vector Addition Systems. CoRR abs/1609.00214 (2016) - [i6]Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman:
Regular Separability of Parikh Automata. CoRR abs/1612.06233 (2016) - 2015
- [j4]Wojciech Czerwinski, Tomasz Gogacz, Eryk Kopczynski:
Non-dominating Sequences of Vectors Using only Resets and Increments. Fundam. Informaticae 140(2): 123-127 (2015) - [c11]Wojciech Czerwinski, Wim Martens, Lorijn van Rooijen, Marc Zeitoun:
A Note on Decidable Separability by Piecewise Testable Languages. FCT 2015: 173-185 - [c10]Wojciech Czerwinski, Petr Jancar:
Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME. LICS 2015: 168-179 - [c9]Wojciech Czerwinski, Wim Martens, Pawel Parys, Marcin Przybylko:
The (Almost) Complete Guide to Tree Pattern Containment. PODS 2015: 117-130 - [i5]Wojciech Czerwinski, Tomasz Gogacz, Eryk Kopczynski:
Non-dominating sequences of vectors using only resets and increments. CoRR abs/1506.05279 (2015) - [i4]Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar:
Shortest paths in one-counter systems. CoRR abs/1510.05460 (2015) - 2014
- [j3]Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota:
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. Theory Comput. Syst. 55(1): 136-169 (2014) - [i3]Wojciech Czerwinski, Petr Jancar:
Branching Bisimilarity of Normed BPA Processes is in NEXPTIME. CoRR abs/1407.0645 (2014) - [i2]Wojciech Czerwinski, Wim Martens:
A Note on Decidable Separability by Piecewise Testable Languages. CoRR abs/1410.1042 (2014) - 2013
- [j2]Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota:
Reachability Problem for Weak Multi-Pushdown Automata. Log. Methods Comput. Sci. 9(3) (2013) - [c8]Wojciech Czerwinski, Claire David, Katja Losemann, Wim Martens:
Deciding Definability by Deterministic Regular Expressions. FoSSaCS 2013: 289-304 - [c7]Wojciech Czerwinski, Wim Martens, Tomás Masopust:
Efficient Separability of Regular Languages by Subsequences and Suffixes. ICALP (2) 2013: 150-161 - [c6]Wojciech Czerwinski, Petr Jancar, Martin Kot, Zdenek Sawa:
Complexity of Checking Bisimilarity between Sequential and Parallel Processes. MFCS 2013: 302-313 - [i1]Wojciech Czerwinski, Wim Martens, Tomás Masopust:
Efficient Separability of Regular Languages by Subsequences and Suffixes. CoRR abs/1303.0966 (2013) - 2012
- [c5]Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota:
Reachability Problem for Weak Multi-Pushdown Automata. CONCUR 2012: 53-68 - [c4]Wojciech Czerwinski, Slawomir Lasota:
Partially-commutative context-free languages. EXPRESS/SOS 2012: 35-48 - 2011
- [j1]Wojciech Czerwinski, Sibylle B. Fröschle, Slawomir Lasota:
Partially-commutative context-free processes: Expressibility and tractability. Inf. Comput. 209(5): 782-798 (2011) - [c3]Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota:
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. CONCUR 2011: 528-542 - 2010
- [c2]Wojciech Czerwinski, Slawomir Lasota:
Fast equivalence-checking for normed context-free processes. FSTTCS 2010: 260-271
2000 – 2009
- 2009
- [c1]Wojciech Czerwinski, Sibylle B. Fröschle, Slawomir Lasota:
Partially-Commutative Context-Free Processes. CONCUR 2009: 259-273
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-18 20:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
