Scholar
K. S. Thejaswini
Google Scholar ID: VK_o3yMAAAAJ
Institute of Science and Technology, Austria
Citations & Impact
Citations
51
H-index
4
i10-index
2
Publications
14
Co-authors
14
list available
Publications
Resume (English only)
Academic Achievements
- - Privacy-preserving runtime verification (CCS 2025): Joint work with Thomas A. Henzinger and Mahyar Karimi.
- - Finding Equilibria: Simple with optimists and simpler with pessimists (MFCS 2025): Joint work with Léonard Brice and Thomas A. Henzinger.
- - Resolving nondeterminism with randomness (MFCS 2025): Joint work with Thomas A. Henzinger and Aditya Prakash.
- - Simple and tight complexity lower bounds for solving Rabin games (SOSA 2024).
Research Experience
- - Postdoctoral researcher at the Institute of Science and Technology Austria (ISTA) in the group headed by Thomas A. Henzinger.
- - Soon to be joining as a Lecturer (Chargée de cours) at Université Libre de Bruxelles (ULB) in Brussels.
Education
- - PhD (2019-2023): University of Warwick, supervised by Marcin Jurdziński.
- - B.Sc (Hons.) in Mathematics and Computer Science (2014-2017) and M.Sc in Computer Science (2017-2019): Chennai Mathematical Institute (CMI).
Background
- Research interests: logic, automata theory, infinite games, reactive synthesis, and formal verification. Particularly interested in verification and synthesis in privacy-preserving settings.
Miscellany
- Prefers to be addressed as Thejaswini.
