K. S. Thejaswini

4 Publications

Mark all

[4]
2025 | Published | Conference Paper | IST-REx-ID: 20290 | OA
L. Brice, T. A. Henzinger, and K. S. Thejaswini, “Finding equilibria: Simpler for pessimists, simplest for optimists,” in 50th International Symposium on Mathematical Foundations of Computer Science, Warsaw, Poland, 2025, vol. 345.
[Published Version] View | Files available | DOI | arXiv
 
[3]
2025 | Published | Conference Paper | IST-REx-ID: 20291 | OA
T. A. Henzinger, A. Prakash, and K. S. Thejaswini, “Resolving nondeterminism with randomness,” in 50th International Symposium on Mathematical Foundations of Computer Science, Warsaw, Poland, 2025, vol. 345.
[Published Version] View | Files available | DOI | arXiv
 
[2]
2024 | Published | Conference Paper | IST-REx-ID: 18955 | OA
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
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 15377 | OA
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 | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

Grants


4 Publications

Mark all

[4]
2025 | Published | Conference Paper | IST-REx-ID: 20290 | OA
L. Brice, T. A. Henzinger, and K. S. Thejaswini, “Finding equilibria: Simpler for pessimists, simplest for optimists,” in 50th International Symposium on Mathematical Foundations of Computer Science, Warsaw, Poland, 2025, vol. 345.
[Published Version] View | Files available | DOI | arXiv
 
[3]
2025 | Published | Conference Paper | IST-REx-ID: 20291 | OA
T. A. Henzinger, A. Prakash, and K. S. Thejaswini, “Resolving nondeterminism with randomness,” in 50th International Symposium on Mathematical Foundations of Computer Science, Warsaw, Poland, 2025, vol. 345.
[Published Version] View | Files available | DOI | arXiv
 
[2]
2024 | Published | Conference Paper | IST-REx-ID: 18955 | OA
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
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 15377 | OA
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 | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed