K. S. Thejaswini
2 Publications
2024 | Published | Conference Paper | IST-REx-ID: 18955 |

A. Casares, M. Pilipczuk, M. Pilipczuk, U. S. Souza, and K. S. Thejaswini, “Simple and tight complexity lower bounds for solving Rabin games,” in 2024 Symposium on Simplicity in Algorithms, Alexandria, VA, United States, 2024, pp. 160–167.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 15377 |

R. Majumdar, I. Sağlam, and K. S. Thejaswini, “Rabin games and colourful universal trees,” in 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2024, vol. 14572, pp. 213–231.
[Published Version]
View
| Files available
| DOI
| arXiv
Grants
2 Publications
2024 | Published | Conference Paper | IST-REx-ID: 18955 |

A. Casares, M. Pilipczuk, M. Pilipczuk, U. S. Souza, and K. S. Thejaswini, “Simple and tight complexity lower bounds for solving Rabin games,” in 2024 Symposium on Simplicity in Algorithms, Alexandria, VA, United States, 2024, pp. 160–167.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 15377 |

R. Majumdar, I. Sağlam, and K. S. Thejaswini, “Rabin games and colourful universal trees,” in 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2024, vol. 14572, pp. 213–231.
[Published Version]
View
| Files available
| DOI
| arXiv