activity
20122026
most citedUniversal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games

19 citations · 44 across the 18 of their papers we have counts for

collaborators
Showing 2017Show all

2 papers · 1 filter

cs.LO2017★ 3 cited

Intersection Types and Counting

Paweł Parys

We present a new approach to the following meta-problem: given a quantitative property of trees, design a type system such that the desired property for the tree generated by an in…

cs.LO2017

Intersection Types and Counting

Paweł Parys

We present a new approach to the following meta-problem: given a quantitative property of trees, design a type system such that the desired property for the tree generated by an in…