Pawel Parys - RankMe

85 papers A* 14A 8B 9C 2Misc 3Journal 38Unranked 11

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Generalised Quantifiers Based on Rabin-Mostowski Index. STACS Denis Kuperberg, Damian Niwinski, Pawel Parys, Michal Skrzypczak
2026	J	`jnl`	Generalised Quantifiers Based on Rabin-Mostowski Index. CoRR Denis Kuperberg, Damian Niwinski, Pawel Parys, Michal Skrzypczak
2025	A	`conf`	A Dichotomy Theorem for Ordinal Ranks in MSO. STACS Damian Niwinski, Pawel Parys, Michal Skrzypczak
2025	J	`jnl`	A Dichotomy Theorem for Ordinal Ranks in MSO. CoRR Damian Niwinski, Pawel Parys, Michal Skrzypczak
2025	J	`jnl`	A finer reparameterisation theorem for MSO and FO queries on strings. CoRR Lê Thành Dung Nguyên, Pawel Parys
2025	J	`jnl`	Constrained Adaptive Rejection Sampling. CoRR Pawel Parys, Sairam Vaidya, Taylor Berg-Kirkpatrick, Loris D'Antoni
2024	B	`conf`	Extending the WMSO+U Logic with Quantification over Tuples. CSL Anita Badyl, Pawel Parys
2023	J	`jnl`	Extending the WMSO+U Logic With Quantification Over Tuples. CoRR Anita Badyl, Pawel Parys
2023	C	`conf`	Improved Complexity Analysis of Quasi-Polynomial Algorithms Solving Parity Games. CiE Pawel Parys, Aleksander Wiacek
2023	J	`jnl`	Improved Complexity Analysis of Quasi-Polynomial Algorithms Solving Parity Games. CoRR Pawel Parys, Aleksander Wiacek
2023	A*	`conf`	The Probabilistic Rabin Tree Theorem LICS Damian Niwinski, Pawel Parys, Michal Skrzypczak
2023	J	`jnl`	The Probabilistic Rabin Tree Theorem. CoRR Damian Niwinski, Pawel Parys, Michal Skrzypczak
2023	A*	`conf`	Weak Bisimulation Finiteness of Pushdown Systems With Deterministic ε-Transitions Is 2-EXPTIME-Complete. SODA Stefan Göller, Pawel Parys
2022	J	`jnl`	A Recursive Approach to Solving Parity Games in Quasipolynomial Time. Log. Methods Comput. Sci. Karoliina Lehtinen, Pawel Parys, Sven Schewe, Dominik Wojtczak
2022	J	`jnl`	Cost Automata, Safe Schemes, and Downward Closures. Fundam. Informaticae David Barozzini, Lorenzo Clemente, Thomas Colcombet, Pawel Parys
2022	J	`jnl`	The Caucal hierarchy: Interpretations in the (W)MSO+U logic. Inf. Comput. Pawel Parys
2022	A*	`conf`	Unboundedness for Recursion Schemes: A Simpler Type System. ICALP David Barozzini, Pawel Parys, Jan Wroblewski
2022	J	`jnl`	Unboundedness for Recursion Schemes: A Simpler Type System. CoRR David Barozzini, Pawel Parys, Jan Wroblewski
2021	B	`conf`	A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation. CSL André Arnold, Damian Niwinski, Pawel Parys
2021	J	`jnl`	A Recursive Approach to Solving Parity Games in Quasipolynomial Time. CoRR Karoliina Lehtinen, Pawel Parys, Sven Schewe, Dominik Wojtczak
2021	A*	`conf`	Higher-Order Model Checking Step by Step. ICALP Pawel Parys
2021	J	`jnl`	Higher-Order Model Checking Step by Step. CoRR Pawel Parys
2021	Misc	`conf`	Shelah-Stupp's and Muchnik's Iterations Revisited. CSR Pawel Parys
2020	J	`jnl`	A Type System Describing Unboundedness. Discret. Math. Theor. Comput. Sci. Pawel Parys
2020	A*	`conf`	Bisimulation Finiteness of Pushdown Systems Is Elementary. LICS Stefan Göller, Pawel Parys
2020	J	`jnl`	Bisimulation Finiteness of Pushdown Systems Is Elementary. CoRR Stefan Göller, Pawel Parys
2020	J	`jnl`	Compositionality of the MSO+U Logic. CoRR Pawel Parys
2020	A*	`conf`	Cost Automata, Safe Schemes, and Downward Closures. ICALP David Barozzini, Lorenzo Clemente, Thomas Colcombet, Pawel Parys
2020	J	`jnl`	Cost Automata, Safe Schemes, and Downward Closures. CoRR David Barozzini, Lorenzo Clemente, Thomas Colcombet, Pawel Parys
2020	—	`conf`	Higher-Order Nonemptiness Step by Step. FSTTCS Pawel Parys
2020	J	`jnl`	Higher-Order Nonemptiness Step by Step. CoRR Pawel Parys
2020	J	`jnl`	On the Expressive Power of Higher-Order Pushdown Systems. CoRR Pawel Parys
2020	J	`jnl`	On the Expressive Power of Higher-Order Pushdown Systems. Log. Methods Comput. Sci. Pawel Parys
2020	B	`conf`	Parity Games: Another View on Lehtinen's Algorithm. CSL Pawel Parys
2020	J	`jnl`	Recursion Schemes, the MSO Logic, and the U quantifier. Log. Methods Comput. Sci. Pawel Parys
2019	C	`conf`	Extensions of the Caucal Hierarchy? LATA Pawel Parys
2019	J	`jnl`	Parity Games: Another View on Lehtinen's Algorithm. CoRR Pawel Parys
2019	B	`conf`	Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time. MFCS Pawel Parys
2019	J	`jnl`	Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time. CoRR Pawel Parys
2019	A*	`conf`	Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. SODA Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys
2018	B	`conf`	Homogeneity Without Loss of Generality. FSCD Pawel Parys
2018	—	`conf`	Intersection Types for Unboundedness Problems. DCM/ITRS Pawel Parys
2018	J	`jnl`	Minimization of Tree Patterns. J. ACM Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys
2018	J	`jnl`	Reasoning about integrity constraints for tree-structured data. Theory Comput. Syst. Wojciech Czerwinski, Claire David, Filip Murlak, Pawel Parys
2018	A	`conf`	Recursion Schemes and the WMSO+U Logic. STACS Pawel Parys
2018	J	`jnl`	Recursion Schemes, the MSO Logic, and the U quantifier. CoRR Pawel Parys
2018	J	`jnl`	Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. CoRR Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys
2017	J	`jnl`	Intersection Types and Counting. CoRR Pawel Parys
2017	J	`jnl`	Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data. SIGMOD Rec. Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys
2017	—	`conf`	The Complexity of the Diagonal Problem for Recursion Schemes. FSTTCS Pawel Parys
2016	J	`jnl`	A characterization of lambda-terms transforming numerals. J. Funct. Program. Pawel Parys
2016	—	`conf`	Intersection Types and Counting. ITRS Pawel Parys
2016	A*	`conf`	Minimization of Tree Pattern Queries. PODS Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys
2016	B	`conf`	Models of Lambda-Calculus and the Weak MSO Logic. CSL Pawel Parys, Szymon Torunczyk
2016	A	`conf`	On a Fragment of AMSO and Tiling Systems. STACS Achim Blumensath, Thomas Colcombet, Pawel Parys
2016	A	`conf`	Reasoning About Integrity Constraints for Tree-Structured Data. ICDT Wojciech Czerwinski, Claire David, Filip Murlak, Pawel Parys
2016	A*	`conf`	The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. LICS Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz
2016	J	`jnl`	The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. CoRR Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz
2016	A	`conf`	The MSO+U Theory of (N, <) Is Undecidable. STACS Mikolaj Bojanczyk, Pawel Parys, Szymon Torunczyk
2016	J	`jnl`	Weak containment for partial words is coNP-complete. Inf. Process. Lett. Pawel Parys
2015	—	`conf`	Ordered Tree-Pushdown Systems. FSTTCS Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz
2015	J	`jnl`	Ordered Tree-Pushdown Systems. CoRR Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz
2015	A*	`conf`	The (Almost) Complete Guide to Tree Pattern Containment. PODS Wojciech Czerwinski, Wim Martens, Pawel Parys, Marcin Przybylko
2015	J	`jnl`	The MSO+U theory of (N, <) is undecidable. CoRR Mikolaj Bojanczyk, Pawel Parys, Szymon Torunczyk
2014	Misc	`conf`	First-Order Logic on CPDA Graphs. CSR Pawel Parys
2014	Misc	`conf`	How Many Numbers Can a Lambda-Term Contain? FLOPS Pawel Parys
2014	—	`conf`	Two-way cost automata and cost logics over infinite trees. CSL-LICS Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Pawel Parys, Michael Vanden Boom
2013	J	`jnl`	Some results on complexity of µ-calculus evaluation in the black-box model. RAIRO Theor. Informatics Appl. Pawel Parys
2012	A	`conf`	A Pumping Lemma for Pushdown Graphs of Any Level. STACS Pawel Parys
2012	—	`conf`	Decidable classes of documents for XPath. FSTTCS Vince Bárány, Mikolaj Bojanczyk, Diego Figueira, Pawel Parys
2012	—	`conf`	Higher-Order Pushdown Systems with Data GandALF Pawel Parys
2012	A*	`conf`	On the Significance of the Collapse Operation. LICS Pawel Parys
2012	J	`jnl`	Strictness of the Collapsible Pushdown Hierarchy CoRR Alexander Kartzow, Pawel Parys
2012	B	`conf`	Strictness of the Collapsible Pushdown Hierarchy. MFCS Alexander Kartzow, Pawel Parys
2012	B	`conf`	Variants of Collapsible Pushdown Systems. CSL Pawel Parys
2012	J	`jnl`	Weak Alternating Timed Automata Log. Methods Comput. Sci. Pawel Parys, Igor Walukiewicz
2011	A	`conf`	Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata. STACS Pawel Parys
2011	J	`jnl`	XPath evaluation in linear time. J. ACM Mikolaj Bojanczyk, Pawel Parys
2010	—	`conf`	Efficient Evaluation of Nondeterministic Automata Using Factorization Forests. ICALP (1) Mikolaj Bojanczyk, Pawel Parys
2009	—	`conf`	Lower Bound for Evaluation of mu-nu Fixpoint. FICS Pawel Parys
2009	—	`conf`	Weak Alternating Timed Automata. ICALP (2) Pawel Parys, Igor Walukiewicz
2009	A*	`conf`	XPath evaluation in linear time with polynomial combined complexity. PODS Pawel Parys
2008	B	`conf`	Systems of Equations Satisfied in All Commutative Finite Semigroups. FoSSaCS Pawel Parys
2008	A*	`conf`	XPath evaluation in linear time. PODS Mikolaj Bojanczyk, Pawel Parys
2006	A*	`conf`	Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders. FOCS Krzysztof Onak, Pawel Parys