K. S. Thejaswini

activity

20202026

most citedThe Strahler number of a parity game

5 citations · 13 across the 15 of their papers we have counts for

collaborators

Showing cs.LOShow all

2 papers · 1 filter

cs.LO2024★ 1 cited

Rabin Games and Colourful Universal Trees

Rupak Majumdar, Irmak Saglam, K. S. Thejaswini

We provide an algorithm to solve Rabin and Streett games over graphs with $n$ vertices, $m$ edges, and $k$ colours that runs in $O ~ (mn (k!)^{1 + o (1)})$ time and $O…

cs.LO2020

A symmetric attractor-decomposition lifting algorithm for parity games

Marcin Jurdziński, Rémi Morvan, Pierre Ohlmann +1

Progress-measure lifting algorithms for solving parity games have the best worst-case asymptotic runtime, but are limited by their asymmetric nature, and known from the work of Cze…