K. S. Thejaswini
2 Publications
2024 | Published | Conference Paper | IST-REx-ID: 18955 | 
Casares, Antonio, Marcin Pilipczuk, Michał Pilipczuk, Uéverton S. Souza, and K. S. Thejaswini. “Simple and Tight Complexity Lower Bounds for Solving Rabin Games.” In 2024 Symposium on Simplicity in Algorithms, 160–67. Society for Industrial and Applied Mathematics, 2024. https://doi.org/10.1137/1.9781611977936.16.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 15377 |
Majumdar, Rupak, Irmak 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, 14572:213–31. Springer Nature, 2024. https://doi.org/10.1007/978-3-031-57256-2_11.
[Published Version]
View
| Files available
| DOI
| arXiv
Search
Filter Publications
Display / Sort
Export / Embed
Grants
2 Publications
2024 | Published | Conference Paper | IST-REx-ID: 18955 |
Casares, Antonio, Marcin Pilipczuk, Michał Pilipczuk, Uéverton S. Souza, and K. S. Thejaswini. “Simple and Tight Complexity Lower Bounds for Solving Rabin Games.” In 2024 Symposium on Simplicity in Algorithms, 160–67. Society for Industrial and Applied Mathematics, 2024. https://doi.org/10.1137/1.9781611977936.16.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 15377 |
Majumdar, Rupak, Irmak 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, 14572:213–31. Springer Nature, 2024. https://doi.org/10.1007/978-3-031-57256-2_11.
[Published Version]
View
| Files available
| DOI
| arXiv