K. S. Thejaswini

6 Publications

Mark all

[6]
2025 | Published | Conference Paper | IST-REx-ID: 21020 | OA
Henzinger, Thomas A., et al. “Privacy-Preserving Runtime Verification.” Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, Association for Computing Machinery, 2025, pp. 2774–87, doi:10.1145/3719027.3765137.
[Published Version] View | Files available | DOI | arXiv
 
[5]
2025 | Published | Conference Paper | IST-REx-ID: 21281 | OA
Asadi, Ali, et al. “ε-Stationary Nash Equilibria in Multi-Player Stochastic Graph Games.” 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 360, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 9:1-9:17, doi:10.4230/lipics.fsttcs.2025.9.
[Published Version] View | Files available | DOI | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 20290 | OA
Brice, Léonard, et al. “Finding Equilibria: Simpler for Pessimists, Simplest for Optimists.” 50th International Symposium on Mathematical Foundations of Computer Science, vol. 345, 30, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.MFCS.2025.30.
[Published Version] View | Files available | DOI | arXiv
 
[3]
2025 | Published | Conference Paper | IST-REx-ID: 20291 | OA
Henzinger, Thomas A., et al. “Resolving Nondeterminism with Randomness.” 50th International Symposium on Mathematical Foundations of Computer Science, vol. 345, 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.MFCS.2025.57.
[Published Version] View | Files available | DOI | arXiv
 
[2]
2024 | Published | Conference Paper | IST-REx-ID: 15377 | OA
Majumdar, Rupak, et al. “Rabin Games and Colourful Universal Trees.” 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 14572, Springer Nature, 2024, pp. 213–31, doi:10.1007/978-3-031-57256-2_11.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 18955 | OA
Casares, Antonio, et al. “Simple and Tight Complexity Lower Bounds for Solving Rabin Games.” 2024 Symposium on Simplicity in Algorithms, Society for Industrial and Applied Mathematics, 2024, pp. 160–67, doi:10.1137/1.9781611977936.16.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed

Grants


6 Publications

Mark all

[6]
2025 | Published | Conference Paper | IST-REx-ID: 21020 | OA
Henzinger, Thomas A., et al. “Privacy-Preserving Runtime Verification.” Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, Association for Computing Machinery, 2025, pp. 2774–87, doi:10.1145/3719027.3765137.
[Published Version] View | Files available | DOI | arXiv
 
[5]
2025 | Published | Conference Paper | IST-REx-ID: 21281 | OA
Asadi, Ali, et al. “ε-Stationary Nash Equilibria in Multi-Player Stochastic Graph Games.” 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 360, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 9:1-9:17, doi:10.4230/lipics.fsttcs.2025.9.
[Published Version] View | Files available | DOI | arXiv
 
[4]
2025 | Published | Conference Paper | IST-REx-ID: 20290 | OA
Brice, Léonard, et al. “Finding Equilibria: Simpler for Pessimists, Simplest for Optimists.” 50th International Symposium on Mathematical Foundations of Computer Science, vol. 345, 30, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.MFCS.2025.30.
[Published Version] View | Files available | DOI | arXiv
 
[3]
2025 | Published | Conference Paper | IST-REx-ID: 20291 | OA
Henzinger, Thomas A., et al. “Resolving Nondeterminism with Randomness.” 50th International Symposium on Mathematical Foundations of Computer Science, vol. 345, 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.MFCS.2025.57.
[Published Version] View | Files available | DOI | arXiv
 
[2]
2024 | Published | Conference Paper | IST-REx-ID: 15377 | OA
Majumdar, Rupak, et al. “Rabin Games and Colourful Universal Trees.” 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 14572, Springer Nature, 2024, pp. 213–31, doi:10.1007/978-3-031-57256-2_11.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 18955 | OA
Casares, Antonio, et al. “Simple and Tight Complexity Lower Bounds for Solving Rabin Games.” 2024 Symposium on Simplicity in Algorithms, Society for Industrial and Applied Mathematics, 2024, pp. 160–67, doi:10.1137/1.9781611977936.16.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed