K. S. Thejaswini

According to our database, K. S. Thejaswini authored at least 18 papers between 2020 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Decoupled Planning for Multiple Omega-Regular Objectives.

Guy Avni, Thomas A. Henzinger, Kaushik Mallik, Suman Sadhukhan, K. S. Thejaswini

CoRR, May, 2026

Sharing The Secret: Distributed Privacy-Preserving Monitoring.

Mahyar Karimi, K. S. Thejaswini, Roderick Bloem, Thomas A. Henzinger

CoRR, March, 2026

Randomise Alone, Reach as a Team.

Léonard Brice, Thomas A. Henzinger, Alipasha Montaseri, Ali Shafiee, K. S. Thejaswini

CoRR, March, 2026

History-Deterministic Büchi Automata are Succinct.

Antonio Casares, Aditya Prakash, K. S. Thejaswini

CoRR, March, 2026

Dicey Games: Shared Sources of Randomness in Distributed Systems.

Léonard Brice, Thomas A. Henzinger, K. S. Thejaswini

CoRR, January, 2026

2025

Resolving Nondeterminism with Randomness.

Thomas A. Henzinger, Aditya Prakash, K. S. Thejaswini

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

Finding Equilibria: Simpler for Pessimists, Simplest for Optimists.

Léonard Brice, Thomas A. Henzinger, K. S. Thejaswini

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

ε-Stationary Nash Equilibria in Multi-Player Stochastic Graph Games.

Ali Asadi, Léonard Brice, Krishnendu Chatterjee, K. S. Thejaswini

Proceedings of the 45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2025

Privacy-Preserving Runtime Verification.

Thomas A. Henzinger, Mahyar Karimi, K. S. Thejaswini

Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, 2025

2024

Solving Two-Player Games Under Progress Assumptions.

Anne-Kathrin Schmuck, K. S. Thejaswini, Irmak Saglam, Satya Prakash Nayak

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2024

Rabin Games and Colourful Universal Trees.

Rupak Majumdar, Irmak Saglam, K. S. Thejaswini

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2024

Simple and tight complexity lower bounds for solving Rabin games.

Antonio Casares, Marcin Pilipczuk, Michal Pilipczuk, Uéverton S. Souza, K. S. Thejaswini

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

2023

On History-Deterministic One-Counter Nets.

Aditya Prakash, K. S. Thejaswini

Proceedings of the Foundations of Software Science and Computation Structures, 2023

2022

A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games.

K. S. Thejaswini, Pierre Ohlmann, Marcin Jurdzinski

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Universal Algorithms for Parity Games and Nested Fixpoints.

Marcin Jurdzinski, Rémi Morvan, K. S. Thejaswini

Proceedings of the Principles of Systems Design, 2022

2021

Adaptive Synchronisation of Pushdown Automata.

A. R. Balasubramanian, K. S. Thejaswini

Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020

A symmetric attractor-decomposition lifting algorithm for parity games.

Marcin Jurdzinski, Rémi Morvan, Pierre Ohlmann, K. S. Thejaswini

CoRR, 2020

The Strahler Number of a Parity Game.

Laure Daviaud, Marcin Jurdzinski, K. S. Thejaswini

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020