Paweł Parys

About Paweł Parys

Paweł Parys, With an exceptional h-index of 15 and a recent h-index of 9 (since 2020), a distinguished researcher at Uniwersytet Warszawski,

His recent articles reflect a diverse array of research interests and contributions to the field:

Extending the WMSO+ U Logic with Quantification over Tuples

Improved Complexity Analysis of Quasi-Polynomial Algorithms Solving Parity Games

The Probabilistic Rabin Tree Theorem*

Cost automata, safe schemes, and downward closures

Weak Bisimulation Finiteness of Pushdown Systems With Deterministic ε-Transitions Is 2-EXPTIME-Complete

A recursive approach to solving parity games in quasipolynomial time

The Caucal hierarchy: Interpretations in the (W) MSO+ U logic

Unboundedness for Recursion Schemes: A Simpler Type System

Paweł Parys Information

University

Position

___

Citations(all)

629

Citations(since 2020)

308

Cited By

483

hIndex(all)

15

hIndex(since 2020)

9

i10Index(all)

19

i10Index(since 2020)

7

Email

University Profile Page

Google Scholar

Top articles of Paweł Parys

Extending the WMSO+ U Logic with Quantification over Tuples

2024

Paweł Parys
Paweł Parys

H-Index: 11

Improved Complexity Analysis of Quasi-Polynomial Algorithms Solving Parity Games

2023/7/19

Paweł Parys
Paweł Parys

H-Index: 11

The Probabilistic Rabin Tree Theorem*

2023/6/26

Paweł Parys
Paweł Parys

H-Index: 11

Michał Skrzypczak
Michał Skrzypczak

H-Index: 10

Cost automata, safe schemes, and downward closures

Fundamenta Informaticae

2023/4/18

Lorenzo Clemente
Lorenzo Clemente

H-Index: 12

Paweł Parys
Paweł Parys

H-Index: 11

Weak Bisimulation Finiteness of Pushdown Systems With Deterministic ε-Transitions Is 2-EXPTIME-Complete

2023

A recursive approach to solving parity games in quasipolynomial time

Logical Methods in Computer Science

2022/1/12

The Caucal hierarchy: Interpretations in the (W) MSO+ U logic

Information and Computation

2022/7/1

Paweł Parys
Paweł Parys

H-Index: 11

Unboundedness for Recursion Schemes: A Simpler Type System

arXiv preprint arXiv:2204.11023

2022/4/23

Paweł Parys
Paweł Parys

H-Index: 11

Higher-order model checking step by step

arXiv preprint arXiv:2105.01861

2021/5/5

Paweł Parys
Paweł Parys

H-Index: 11

Shelah-Stupp’s and Muchnik’s Iterations Revisited

2021

Paweł Parys
Paweł Parys

H-Index: 11

A quasi-polynomial black-box algorithm for fixed point evaluation

2021

Paweł Parys
Paweł Parys

H-Index: 11

Higher-order nonemptiness step by step

arXiv preprint arXiv:2009.08174

2020/9/17

Paweł Parys
Paweł Parys

H-Index: 11

On the Expressive Power of Higher-Order Pushdown Systems

Logical Methods in Computer Science

2020/8/20

Paweł Parys
Paweł Parys

H-Index: 11

A type system describing unboundedness

Discrete Mathematics & Theoretical Computer Science

2020/8/18

Paweł Parys
Paweł Parys

H-Index: 11

Bisimulation finiteness of pushdown systems is elementary

2020/7/8

Paweł Parys
Paweł Parys

H-Index: 11

Compositionality of the MSO+ U Logic

arXiv preprint arXiv:2005.02384

2020/5/5

Paweł Parys
Paweł Parys

H-Index: 11

Recursion schemes, the MSO logic, and the U quantifier

Logical Methods in Computer Science

2020/2/18

Paweł Parys
Paweł Parys

H-Index: 11

See List of Professors in Paweł Parys University(Uniwersytet Warszawski)