K. S. Thejaswini
6 Publications
2025 |
Published |
Conference Paper |
IST-REx-ID: 21020 |
Henzinger, Thomas A, Mahyar Karimi, and K. S. Thejaswini. “Privacy-Preserving Runtime Verification.” In Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, 2774–87. Association for Computing Machinery, 2025. https://doi.org/10.1145/3719027.3765137.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20290 |
Brice, Léonard, Thomas A Henzinger, and K. S. Thejaswini. “Finding Equilibria: Simpler for Pessimists, Simplest for Optimists.” In 50th International Symposium on Mathematical Foundations of Computer Science, Vol. 345. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.MFCS.2025.30.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20291 |
Henzinger, Thomas A, Aditya Prakash, and K. S. Thejaswini. “Resolving Nondeterminism with Randomness.” In 50th International Symposium on Mathematical Foundations of Computer Science, Vol. 345. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.MFCS.2025.57.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 21281 |
Asadi, Ali, Leonard Brice, Krishnendu Chatterjee, and K. S. Thejaswini. “ε-Stationary Nash Equilibria in Multi-Player Stochastic Graph Games.” In 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 360:9:1-9:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/lipics.fsttcs.2025.9.
[Published Version]
View
| Files available
| DOI
| 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
| WoS
| arXiv
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
Search
Filter Publications
Display / Sort
Export / Embed
Grants
6 Publications
2025 |
Published |
Conference Paper |
IST-REx-ID: 21020 |
Henzinger, Thomas A, Mahyar Karimi, and K. S. Thejaswini. “Privacy-Preserving Runtime Verification.” In Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, 2774–87. Association for Computing Machinery, 2025. https://doi.org/10.1145/3719027.3765137.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20290 |
Brice, Léonard, Thomas A Henzinger, and K. S. Thejaswini. “Finding Equilibria: Simpler for Pessimists, Simplest for Optimists.” In 50th International Symposium on Mathematical Foundations of Computer Science, Vol. 345. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.MFCS.2025.30.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20291 |
Henzinger, Thomas A, Aditya Prakash, and K. S. Thejaswini. “Resolving Nondeterminism with Randomness.” In 50th International Symposium on Mathematical Foundations of Computer Science, Vol. 345. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.MFCS.2025.57.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 21281 |
Asadi, Ali, Leonard Brice, Krishnendu Chatterjee, and K. S. Thejaswini. “ε-Stationary Nash Equilibria in Multi-Player Stochastic Graph Games.” In 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 360:9:1-9:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/lipics.fsttcs.2025.9.
[Published Version]
View
| Files available
| DOI
| 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
| WoS
| arXiv
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