| 2026 | LICS | Automata for MSO over Infinite Trees with Quantification over Borel Sets of Branches. | Mikolaj Bojanczyk, Antonio Casares, Sven Manthe, Pawel Parys |
| 2026 | STACS | Generalised Quantifiers Based on Rabin-Mostowski Index. | Denis Kuperberg, Damian Niwinski, Pawel Parys, Michal Skrzypczak |
| 2025 | STACS | A Dichotomy Theorem for Ordinal Ranks in MSO. | Damian Niwinski, Pawel Parys, Michal Skrzypczak |
| 2024 | CSL | Extending the WMSO+U Logic with Quantification over Tuples. | Anita Badyl, Pawel Parys |
| 2023 | CiE | Improved Complexity Analysis of Quasi-Polynomial Algorithms Solving Parity Games. | Pawel Parys, Aleksander Wiacek |
| 2023 | LICS | The Probabilistic Rabin Tree Theorem | Damian Niwinski, Pawel Parys, Michal Skrzypczak |
| 2023 | SODA | Weak Bisimulation Finiteness of Pushdown Systems With Deterministic ε-Transitions Is 2-EXPTIME-Complete. | Stefan Gller, Pawel Parys |
| 2022 | ICALP | Unboundedness for Recursion Schemes: A Simpler Type System. | David Barozzini, Pawel Parys, Jan Wroblewski |
| 2021 | CSL | A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation. | Andr Arnold, Damian Niwinski, Pawel Parys |
| 2021 | CSR | Shelah-Stupp's and Muchnik's Iterations Revisited. | Pawel Parys |
| 2021 | ICALP | Higher-Order Model Checking Step by Step. | Pawel Parys |
| 2020 | CSL | Parity Games: Another View on Lehtinen's Algorithm. | Pawel Parys |
| 2020 | ICALP | Cost Automata, Safe Schemes, and Downward Closures. | David Barozzini, Lorenzo Clemente, Thomas Colcombet, Pawel Parys |
| 2020 | LICS | Bisimulation Finiteness of Pushdown Systems Is Elementary. | Stefan Gller, Pawel Parys |
| 2019 | LATA | Extensions of the Caucal Hierarchy? | Pawel Parys |
| 2019 | MFCS | Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time. | Pawel Parys |
| 2019 | SODA | Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. | Wojciech Czerwinski, Laure Daviaud, Nathanal Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys |
| 2018 | STACS | Recursion Schemes and the WMSO+U Logic. | Pawel Parys |
| 2016 | CSL | Models of Lambda-Calculus and the Weak MSO Logic. | Pawel Parys, Szymon Torunczyk |
| 2016 | ICDT | Reasoning About Integrity Constraints for Tree-Structured Data. | Wojciech Czerwinski, Claire David, Filip Murlak, Pawel Parys |
| 2016 | LICS | The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. | Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz |
| 2016 | PODS | Minimization of Tree Pattern Queries. | Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys |
| 2016 | STACS | On a Fragment of AMSO and Tiling Systems. | Achim Blumensath, Thomas Colcombet, Pawel Parys |
| 2016 | STACS | The MSO+U Theory of (N, <) Is Undecidable. | Mikolaj Bojanczyk, Pawel Parys, Szymon Torunczyk |
| 2015 | PODS | The (Almost) Complete Guide to Tree Pattern Containment. | Wojciech Czerwinski, Wim Martens, Pawel Parys, Marcin Przybylko |
| 2014 | CSL | Two-way cost automata and cost logics over infinite trees. | Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Pawel Parys, Michael Vanden Boom |
| 2014 | CSR | First-Order Logic on CPDA Graphs. | Pawel Parys |
| 2014 | FLOPS | How Many Numbers Can a Lambda-Term Contain? | Pawel Parys |
| 2012 | CSL | Variants of Collapsible Pushdown Systems. | Pawel Parys |
| 2012 | LICS | On the Significance of the Collapse Operation. | Pawel Parys |
| 2012 | MFCS | Strictness of the Collapsible Pushdown Hierarchy. | Alexander Kartzow, Pawel Parys |
| 2012 | STACS | A Pumping Lemma for Pushdown Graphs of Any Level. | Pawel Parys |
| 2011 | STACS | Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata. | Pawel Parys |
| 2010 | ICALP | Efficient Evaluation of Nondeterministic Automata Using Factorization Forests. | Mikolaj Bojanczyk, Pawel Parys |
| 2009 | ICALP | Weak Alternating Timed Automata. | Pawel Parys, Igor Walukiewicz |
| 2009 | PODS | XPath evaluation in linear time with polynomial combined complexity. | Pawel Parys |
| 2008 | FOSSACS | Systems of Equations Satisfied in All Commutative Finite Semigroups. | Pawel Parys |
| 2008 | PODS | XPath evaluation in linear time. | Mikolaj Bojanczyk, Pawel Parys |
| 2006 | FOCS | Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders. | Krzysztof Onak, Pawel Parys |