default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPawel Parys
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c45]Anita Badyl, Pawel Parys:
Extending the WMSO+U Logic with Quantification over Tuples. CSL 2024: 12:1-12:20- 2023
- [c44]Pawel Parys
, Aleksander Wiacek:
Improved Complexity Analysis of Quasi-Polynomial Algorithms Solving Parity Games. CiE 2023: 275-286 - [c43]Damian Niwinski, Pawel Parys, Michal Skrzypczak:
The Probabilistic Rabin Tree Theorem*. LICS 2023: 1-13 - [c42]Stefan Göller, Pawel Parys:
Weak Bisimulation Finiteness of Pushdown Systems With Deterministic ε-Transitions Is 2-EXPTIME-Complete. SODA 2023: 2777-2815 - [i20]Damian Niwinski, Pawel Parys, Michal Skrzypczak:
The Probabilistic Rabin Tree Theorem. CoRR abs/2304.12158 (2023) - [i19]Pawel Parys, Aleksander Wiacek:
Improved Complexity Analysis of Quasi-Polynomial Algorithms Solving Parity Games. CoRR abs/2305.00308 (2023) - [i18]Anita Badyl, Pawel Parys:
Extending the WMSO+U Logic With Quantification Over Tuples. CoRR abs/2311.16607 (2023) - 2022
- [j14]David Barozzini, Lorenzo Clemente, Thomas Colcombet, Pawel Parys:
Cost Automata, Safe Schemes, and Downward Closures. Fundam. Informaticae 188(3): 127-178 (2022) - [j13]Pawel Parys:
The Caucal hierarchy: Interpretations in the (W)MSO+U logic. Inf. Comput. 286: 104782 (2022) - [j12]Karoliina Lehtinen, Pawel Parys, Sven Schewe, Dominik Wojtczak:
A Recursive Approach to Solving Parity Games in Quasipolynomial Time. Log. Methods Comput. Sci. 18(1) (2022) - [c41]David Barozzini, Pawel Parys, Jan Wroblewski:
Unboundedness for Recursion Schemes: A Simpler Type System. ICALP 2022: 112:1-112:19 - [i17]David Barozzini, Pawel Parys, Jan Wroblewski:
Unboundedness for Recursion Schemes: A Simpler Type System. CoRR abs/2204.11023 (2022) - 2021
- [c40]André Arnold, Damian Niwinski, Pawel Parys:
A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation. CSL 2021: 9:1-9:23 - [c39]Pawel Parys:
Shelah-Stupp's and Muchnik's Iterations Revisited. CSR 2021: 395-405 - [c38]Pawel Parys:
Higher-Order Model Checking Step by Step. ICALP 2021: 140:1-140:16 - [i16]Karoliina Lehtinen, Pawel Parys, Sven Schewe, Dominik Wojtczak:
A Recursive Approach to Solving Parity Games in Quasipolynomial Time. CoRR abs/2104.09717 (2021) - [i15]Pawel Parys:
Higher-Order Model Checking Step by Step. CoRR abs/2105.01861 (2021) - 2020
- [j11]Pawel Parys:
A Type System Describing Unboundedness. Discret. Math. Theor. Comput. Sci. 22(4) (2020) - [j10]Pawel Parys:
Recursion Schemes, the MSO Logic, and the U quantifier. Log. Methods Comput. Sci. 16(1) (2020) - [j9]Pawel Parys:
On the Expressive Power of Higher-Order Pushdown Systems. Log. Methods Comput. Sci. 16(3) (2020) - [c37]Pawel Parys:
Parity Games: Another View on Lehtinen's Algorithm. CSL 2020: 32:1-32:15 - [c36]Pawel Parys:
Higher-Order Nonemptiness Step by Step. FSTTCS 2020: 53:1-53:14 - [c35]David Barozzini, Lorenzo Clemente, Thomas Colcombet, Pawel Parys:
Cost Automata, Safe Schemes, and Downward Closures. ICALP 2020: 109:1-109:18 - [c34]Stefan Göller, Pawel Parys:
Bisimulation Finiteness of Pushdown Systems Is Elementary. LICS 2020: 521-534 - [i14]David Barozzini, Lorenzo Clemente, Thomas Colcombet, Pawel Parys:
Cost Automata, Safe Schemes, and Downward Closures. CoRR abs/2004.12187 (2020) - [i13]Pawel Parys:
Compositionality of the MSO+U Logic. CoRR abs/2005.02384 (2020) - [i12]Stefan Göller, Pawel Parys:
Bisimulation Finiteness of Pushdown Systems Is Elementary. CoRR abs/2005.06285 (2020) - [i11]Pawel Parys:
On the Expressive Power of Higher-Order Pushdown Systems. CoRR abs/2008.00650 (2020) - [i10]Pawel Parys:
Higher-Order Nonemptiness Step by Step. CoRR abs/2009.08174 (2020)
2010 – 2019
- 2019
- [c33]Pawel Parys:
Extensions of the Caucal Hierarchy? LATA 2019: 368-380 - [c32]Pawel Parys:
Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time. MFCS 2019: 10:1-10:13 - [c31]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 - [i9]Pawel Parys:
Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time. CoRR abs/1904.12446 (2019) - [i8]Pawel Parys:
Parity Games: Another View on Lehtinen's Algorithm. CoRR abs/1910.03919 (2019) - 2018
- [j8]Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys:
Minimization of Tree Patterns. J. ACM 65(4): 26:1-26:46 (2018) - [j7]Wojciech Czerwinski, Claire David, Filip Murlak, Pawel Parys:
Reasoning about integrity constraints for tree-structured data. Theory Comput. Syst. 62(4): 941-976 (2018) - [c30]Pawel Parys:
Homogeneity Without Loss of Generality. FSCD 2018: 27:1-27:15 - [c29]Pawel Parys:
Recursion Schemes and the WMSO+U Logic. STACS 2018: 53:1-53:16 - [c28]Pawel Parys:
Intersection Types for Unboundedness Problems. DCM/ITRS 2018: 7-27 - [i7]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) - [i6]Pawel Parys:
Recursion Schemes, the MSO Logic, and the U quantifier. CoRR abs/1810.04763 (2018) - 2017
- [j6]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) - [c27]Pawel Parys:
The Complexity of the Diagonal Problem for Recursion Schemes. FSTTCS 2017: 45:1-45:14 - [i5]Pawel Parys:
Intersection Types and Counting. CoRR abs/1701.05303 (2017) - 2016
- [j5]Pawel Parys:
Weak containment for partial words is coNP-complete. Inf. Process. Lett. 116(2): 125-127 (2016) - [j4]Pawel Parys:
A characterization of lambda-terms transforming numerals. J. Funct. Program. 26: e12 (2016) - [c26]Pawel Parys, Szymon Torunczyk:
Models of Lambda-Calculus and the Weak MSO Logic. CSL 2016: 11:1-11:12 - [c25]Wojciech Czerwinski, Claire David, Filip Murlak, Pawel Parys:
Reasoning About Integrity Constraints for Tree-Structured Data. ICDT 2016: 20:1-20:18 - [c24]Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz:
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. LICS 2016: 96-105 - [c23]Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys:
Minimization of Tree Pattern Queries. PODS 2016: 43-54 - [c22]Achim Blumensath, Thomas Colcombet, Pawel Parys:
On a Fragment of AMSO and Tiling Systems. STACS 2016: 19:1-19:14 - [c21]Mikolaj Bojanczyk, Pawel Parys, Szymon Torunczyk:
The MSO+U Theory of (N, <) Is Undecidable. STACS 2016: 21:1-21:8 - [c20]Pawel Parys:
Intersection Types and Counting. ITRS 2016: 48-63 - [i4]Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz:
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. CoRR abs/1605.00371 (2016) - 2015
- [c19]Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz:
Ordered Tree-Pushdown Systems. FSTTCS 2015: 163-177 - [c18]Wojciech Czerwinski, Wim Martens, Pawel Parys, Marcin Przybylko:
The (Almost) Complete Guide to Tree Pattern Containment. PODS 2015: 117-130 - [i3]Mikolaj Bojanczyk, Pawel Parys, Szymon Torunczyk:
The MSO+U theory of (N, <) is undecidable. CoRR abs/1502.04578 (2015) - [i2]Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz:
Ordered Tree-Pushdown Systems. CoRR abs/1510.03278 (2015) - 2014
- [c17]Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Pawel Parys, Michael Vanden Boom:
Two-way cost automata and cost logics over infinite trees. CSL-LICS 2014: 16:1-16:9 - [c16]Pawel Parys:
First-Order Logic on CPDA Graphs. CSR 2014: 300-313 - [c15]Pawel Parys:
How Many Numbers Can a Lambda-Term Contain? FLOPS 2014: 302-318 - 2013
- [j3]Pawel Parys:
Some results on complexity of µ-calculus evaluation in the black-box model. RAIRO Theor. Informatics Appl. 47(1): 97-109 (2013) - 2012
- [j2]Pawel Parys, Igor Walukiewicz:
Weak Alternating Timed Automata. Log. Methods Comput. Sci. 8(3) (2012) - [c14]Pawel Parys:
Variants of Collapsible Pushdown Systems. CSL 2012: 500-515 - [c13]Vince Bárány, Mikolaj Bojanczyk, Diego Figueira, Pawel Parys:
Decidable classes of documents for XPath. FSTTCS 2012: 99-111 - [c12]Pawel Parys:
On the Significance of the Collapse Operation. LICS 2012: 521-530 - [c11]Alexander Kartzow, Pawel Parys:
Strictness of the Collapsible Pushdown Hierarchy. MFCS 2012: 566-577 - [c10]Pawel Parys:
A Pumping Lemma for Pushdown Graphs of Any Level. STACS 2012: 54-65 - [c9]Pawel Parys:
Higher-Order Pushdown Systems with Data. GandALF 2012: 210-223 - [i1]Alexander Kartzow, Pawel Parys:
Strictness of the Collapsible Pushdown Hierarchy. CoRR abs/1201.3250 (2012) - 2011
- [j1]Mikolaj Bojanczyk, Pawel Parys:
XPath evaluation in linear time. J. ACM 58(4): 17:1-17:33 (2011) - [c8]Pawel Parys:
Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata. STACS 2011: 603-614 - 2010
- [c7]Mikolaj Bojanczyk, Pawel Parys:
Efficient Evaluation of Nondeterministic Automata Using Factorization Forests. ICALP (1) 2010: 515-526
2000 – 2009
- 2009
- [c6]Pawel Parys:
Lower Bound for Evaluation of mu-nu Fixpoint. FICS 2009: 86-92 - [c5]Pawel Parys, Igor Walukiewicz:
Weak Alternating Timed Automata. ICALP (2) 2009: 273-284 - [c4]Pawel Parys:
XPath evaluation in linear time with polynomial combined complexity. PODS 2009: 55-64 - 2008
- [c3]Pawel Parys:
Systems of Equations Satisfied in All Commutative Finite Semigroups. FoSSaCS 2008: 261-272 - [c2]Mikolaj Bojanczyk, Pawel Parys:
XPath evaluation in linear time. PODS 2008: 241-250 - 2006
- [c1]Krzysztof Onak, Pawel Parys:
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders. FOCS 2006: 379-388
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 2025-01-21 00:12 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:
