Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders. - Krzysztof Onak; Pawel Parys (FOCS, 2006)

Systems of Equations Satisfied in All Commutative Finite Semigroups. - Pawel Parys (FoSSaCS, 2008)

Lower Bound for Evaluation of mu-nu Fixpoint. - Pawel Parys (FICS, 2009)

XPath evaluation in linear time with polynomial combined complexity. - Pawel Parys (PODS, 2009)

Efficient Evaluation of Nondeterministic Automata Using Factorization Forests. - Mikolaj Bojanczyk; Pawel Parys (ICALP (1), 2010)

Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata. - Pawel Parys (STACS, 2011)

XPath evaluation in linear time. - Mikolaj Bojanczyk; Pawel Parys (J. ACM, 2011)

Variants of Collapsible Pushdown Systems. - Pawel Parys (CSL, 2012)

Decidable classes of documents for XPath. - Vince Bárány; Mikolaj Bojanczyk; Diego Figueira; Pawel Parys (FSTTCS, 2012)

On the Significance of the Collapse Operation. - Pawel Parys (LICS, 2012)

Strictness of the Collapsible Pushdown Hierarchy. - Alexander Kartzow; Pawel Parys (MFCS, 2012)

A Pumping Lemma for Pushdown Graphs of Any Level. - Pawel Parys (STACS, 2012)

Weak Alternating Timed Automata - Pawel Parys; Igor Walukiewicz (Log. Methods Comput. Sci., 2012)

Higher-Order Pushdown Systems with Data - Pawel Parys (GandALF, 2012)

Some results on complexity of µ-calculus evaluation in the black-box model. - Pawel Parys (RAIRO Theor. Informatics Appl., 2013)

Two-way cost automata and cost logics over infinite trees. - Achim Blumensath; Thomas Colcombet; Denis Kuperberg; Pawel Parys; Michael Vanden Boom (CSL-LICS, 2014)

First-Order Logic on CPDA Graphs. - Pawel Parys (CSR, 2014)

How Many Numbers Can a Lambda-Term Contain? - Pawel Parys (FLOPS, 2014)

Ordered Tree-Pushdown Systems. - Lorenzo Clemente; Pawel Parys; Sylvain Salvati; Igor Walukiewicz (FSTTCS, 2015)

The (Almost) Complete Guide to Tree Pattern Containment. - Wojciech Czerwinski; Wim Martens; Pawel Parys; Marcin Przybylko (PODS, 2015)

Models of Lambda-Calculus and the Weak MSO Logic. - Pawel Parys; Szymon Torunczyk (CSL, 2016)

The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. - Lorenzo Clemente; Pawel Parys; Sylvain Salvati; Igor Walukiewicz (LICS, 2016)

Minimization of Tree Pattern Queries. - Wojciech Czerwinski; Wim Martens; Matthias Niewerth; Pawel Parys (PODS, 2016)

On a Fragment of AMSO and Tiling Systems. - Achim Blumensath; Thomas Colcombet; Pawel Parys (STACS, 2016)

The MSO+U Theory of (N, <) Is Undecidable. - Mikolaj Bojanczyk; Pawel Parys; Szymon Torunczyk (STACS, 2016)

Intersection Types and Counting. - Pawel Parys (ITRS, 2016)

Weak containment for partial words is coNP-complete. - Pawel Parys (Inf. Process. Lett., 2016)

A characterization of lambda-terms transforming numerals. - Pawel Parys (J. Funct. Program., 2016)

The Complexity of the Diagonal Problem for Recursion Schemes. - Pawel Parys (FSTTCS, 2017)

Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data. - Wojciech Czerwinski; Wim Martens; Matthias Niewerth; Pawel Parys (SIGMOD Rec., 2017)

Homogeneity Without Loss of Generality. - Pawel Parys (FSCD, 2018)

Recursion Schemes and the WMSO+U Logic. - Pawel Parys (STACS, 2018)

Intersection Types for Unboundedness Problems. - Pawel Parys (DCM/ITRS, 2018)

Minimization of Tree Patterns. - Wojciech Czerwinski; Wim Martens; Matthias Niewerth; Pawel Parys (J. ACM, 2018)

Reasoning about integrity constraints for tree-structured data. - Wojciech Czerwinski; Claire David; Filip Murlak; Pawel Parys (Theory Comput. Syst., 2018)

Extensions of the Caucal Hierarchy? - Pawel Parys (LATA, 2019)

Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time. - Pawel Parys (MFCS, 2019)

Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. - Wojciech Czerwinski; Laure Daviaud; Nathanaël Fijalkow; Marcin Jurdzinski; Ranko Lazic 001; Pawel Parys (SODA, 2019)

Parity Games: Another View on Lehtinen's Algorithm. - Pawel Parys (CSL, 2020)

Higher-Order Nonemptiness Step by Step. - Pawel Parys (FSTTCS, 2020)

Bisimulation Finiteness of Pushdown Systems Is Elementary. - Stefan Göller; Pawel Parys (LICS, 2020)

Compositionality of the MSO+U Logic. - Pawel Parys (CoRR, 2020)

A Type System Describing Unboundedness. - Pawel Parys (Discret. Math. Theor. Comput. Sci., 2020)

Recursion Schemes, the MSO Logic, and the U quantifier. - Pawel Parys (Log. Methods Comput. Sci., 2020)

On the Expressive Power of Higher-Order Pushdown Systems. - Pawel Parys (Log. Methods Comput. Sci., 2020)

A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation. - André Arnold; Damian Niwinski; Pawel Parys (CSL, 2021)

Shelah-Stupp's and Muchnik's Iterations Revisited. - Pawel Parys (CSR, 2021)

Higher-Order Model Checking Step by Step. - Pawel Parys (ICALP, 2021)

Unboundedness for Recursion Schemes: A Simpler Type System. - David Barozzini; Pawel Parys; Jan Wroblewski (ICALP, 2022)

Cost Automata, Safe Schemes, and Downward Closures. - David Barozzini; Lorenzo Clemente; Thomas Colcombet; Pawel Parys (Fundam. Informaticae, 2022)

The Caucal hierarchy: Interpretations in the (W)MSO+U logic. - Pawel Parys (Inf. Comput., 2022)

A Recursive Approach to Solving Parity Games in Quasipolynomial Time. - Karoliina Lehtinen; Pawel Parys; Sven Schewe; Dominik Wojtczak (Log. Methods Comput. Sci., 2022)

Improved Complexity Analysis of Quasi-Polynomial Algorithms Solving Parity Games. - Pawel Parys; Aleksander Wiacek (CiE, 2023)

The Probabilistic Rabin Tree Theorem*. - Damian Niwinski; Pawel Parys; Michal Skrzypczak (LICS, 2023)

Weak Bisimulation Finiteness of Pushdown Systems With Deterministic ε-Transitions Is 2-EXPTIME-Complete. - Stefan Göller; Pawel Parys (SODA, 2023)

The Probabilistic Rabin Tree Theorem. - Damian Niwinski; Pawel Parys; Michal Skrzypczak (CoRR, 2023)

Extending the WMSO+U Logic with Quantification over Tuples. - Anita Badyl; Pawel Parys (CSL, 2024)

A Dichotomy Theorem for Ordinal Ranks in MSO. - Damian Niwinski; Pawel Parys; Michal Skrzypczak (STACS, 2025)