19 citations · 44 across the 18 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.FL2019
Parity Games: Another View on Lehtinen's Algorithm
Paweł Parys
Recently, five quasi-polynomial-time algorithms solving parity games were proposed. We elaborate on one of the algorithms, by Lehtinen (2018). Czerwiński et al. (2019) observe that…
cs.FL2019★ 1 cited
Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time
Paweł Parys
Calude, Jain, Khoussainov, Li, and Stephan (2017) proposed a quasi-polynomial-time algorithm solving parity games. After this breakthrough result, a few other quasi-polynomial-time…
cs.LO2019
Intersection Types for Unboundedness Problems
Paweł Parys
Intersection types have been originally developed as an extension of simple types, but they can also be used for refining simple types. In this survey we concentrate on the latter…