K. S. Thejaswini

4 Publications

Mark all

[4]
2025 | Published | Conference Paper | IST-REx-ID: 20290 | OA
Brice L, Henzinger TA, Thejaswini KS. 2025. Finding equilibria: Simpler for pessimists, simplest for optimists. 50th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 345, 30.
[Published Version] View | Files available | DOI | arXiv
 
[3]
2025 | Published | Conference Paper | IST-REx-ID: 20291 | OA
Henzinger TA, Prakash A, Thejaswini KS. 2025. Resolving nondeterminism with randomness. 50th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 345, 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 US, Thejaswini KS. 2024. Simple and tight complexity lower bounds for solving Rabin games. 2024 Symposium on Simplicity in Algorithms. SOSA: Symposium on Simplicity in Algorithms, 160–167.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 15377 | OA
Majumdar R, Sağlam I, Thejaswini KS. 2024. Rabin games and colourful universal trees. 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. , LNCS, vol. 14572, 213–231.
[Published Version] View | Files available | DOI | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed

Grants


4 Publications

Mark all

[4]
2025 | Published | Conference Paper | IST-REx-ID: 20290 | OA
Brice L, Henzinger TA, Thejaswini KS. 2025. Finding equilibria: Simpler for pessimists, simplest for optimists. 50th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 345, 30.
[Published Version] View | Files available | DOI | arXiv
 
[3]
2025 | Published | Conference Paper | IST-REx-ID: 20291 | OA
Henzinger TA, Prakash A, Thejaswini KS. 2025. Resolving nondeterminism with randomness. 50th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 345, 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 US, Thejaswini KS. 2024. Simple and tight complexity lower bounds for solving Rabin games. 2024 Symposium on Simplicity in Algorithms. SOSA: Symposium on Simplicity in Algorithms, 160–167.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 15377 | OA
Majumdar R, Sağlam I, Thejaswini KS. 2024. Rabin games and colourful universal trees. 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. , LNCS, vol. 14572, 213–231.
[Published Version] View | Files available | DOI | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed