The Strahler Number of a Parity Game. - Laure Daviaud; Marcin Jurdzinski; K. S. Thejaswini (ICALP, 2020)

A symmetric attractor-decomposition lifting algorithm for parity games. - Marcin Jurdzinski; Rémi Morvan; Pierre Ohlmann; K. S. Thejaswini (CoRR, 2020)

Adaptive Synchronisation of Pushdown Automata. - A. R. Balasubramanian; K. S. Thejaswini (CONCUR, 2021)

Universal Algorithms for Parity Games and Nested Fixpoints. - Marcin Jurdzinski; Rémi Morvan; K. S. Thejaswini (Principles of Systems Design, 2022)

A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games. - K. S. Thejaswini; Pierre Ohlmann; Marcin Jurdzinski (FSTTCS, 2022)

On History-Deterministic One-Counter Nets. - Aditya Prakash 002; K. S. Thejaswini (FoSSaCS, 2023)

Simple and tight complexity lower bounds for solving Rabin games. - Antonio Casares; Marcin Pilipczuk; Michal Pilipczuk; Uéverton S. Souza; K. S. Thejaswini (SOSA, 2024)

Rabin Games and Colourful Universal Trees. - Rupak Majumdar; Irmak Saglam; K. S. Thejaswini (TACAS (3), 2024)

Solving Two-Player Games Under Progress Assumptions. - Anne-Kathrin Schmuck; K. S. Thejaswini; Irmak Saglam; Satya Prakash Nayak (VMCAI (1), 2024)

Finding Equilibria: Simpler for Pessimists, Simplest for Optimists. - Léonard Brice; Thomas A. Henzinger; K. S. Thejaswini (MFCS, 2025)

Resolving Nondeterminism with Randomness. - Thomas A. Henzinger; Aditya Prakash 002; K. S. Thejaswini (MFCS, 2025)

Privacy-Preserving Runtime Verification. - Thomas A. Henzinger; Mahyar Karimi 001; K. S. Thejaswini (CoRR, 2025)

ε-Stationary Nash Equilibria in Multi-player Stochastic Graph Games. - Ali Asadi; Léonard Brice; Krishnendu Chatterjee; K. S. Thejaswini (CoRR, 2025)