K. S. Thejaswini

4 Publications

Mark all

[4]
2025 | Published | Conference Paper | IST-REx-ID: 20290 | OA
Brice, L., Henzinger, T. A., & Thejaswini, K. S. (2025). Finding equilibria: Simpler for pessimists, simplest for optimists. In 50th International Symposium on Mathematical Foundations of Computer Science (Vol. 345). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2025.30
[Published Version] View | Files available | DOI | arXiv
 
[3]
2025 | Published | Conference Paper | IST-REx-ID: 20291 | OA
Henzinger, T. A., Prakash, A., & Thejaswini, K. S. (2025). Resolving nondeterminism with randomness. In 50th International Symposium on Mathematical Foundations of Computer Science (Vol. 345). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2025.57
[Published Version] View | Files available | DOI | arXiv
 
[2]
2024 | Published | Conference Paper | IST-REx-ID: 18955 | OA
Casares, A., Pilipczuk, M., Pilipczuk, M., Souza, U. S., & Thejaswini, K. S. (2024). Simple and tight complexity lower bounds for solving Rabin games. In 2024 Symposium on Simplicity in Algorithms (pp. 160–167). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977936.16
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 15377 | OA
Majumdar, R., Sağlam, I., & Thejaswini, K. S. (2024). Rabin games and colourful universal trees. In 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 14572, pp. 213–231). Springer Nature. https://doi.org/10.1007/978-3-031-57256-2_11
[Published Version] View | Files available | DOI | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed

Grants


4 Publications

Mark all

[4]
2025 | Published | Conference Paper | IST-REx-ID: 20290 | OA
Brice, L., Henzinger, T. A., & Thejaswini, K. S. (2025). Finding equilibria: Simpler for pessimists, simplest for optimists. In 50th International Symposium on Mathematical Foundations of Computer Science (Vol. 345). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2025.30
[Published Version] View | Files available | DOI | arXiv
 
[3]
2025 | Published | Conference Paper | IST-REx-ID: 20291 | OA
Henzinger, T. A., Prakash, A., & Thejaswini, K. S. (2025). Resolving nondeterminism with randomness. In 50th International Symposium on Mathematical Foundations of Computer Science (Vol. 345). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2025.57
[Published Version] View | Files available | DOI | arXiv
 
[2]
2024 | Published | Conference Paper | IST-REx-ID: 18955 | OA
Casares, A., Pilipczuk, M., Pilipczuk, M., Souza, U. S., & Thejaswini, K. S. (2024). Simple and tight complexity lower bounds for solving Rabin games. In 2024 Symposium on Simplicity in Algorithms (pp. 160–167). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977936.16
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 15377 | OA
Majumdar, R., Sağlam, I., & Thejaswini, K. S. (2024). Rabin games and colourful universal trees. In 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 14572, pp. 213–231). Springer Nature. https://doi.org/10.1007/978-3-031-57256-2_11
[Published Version] View | Files available | DOI | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed