K. S. Thejaswini

Orcid: 0000-0001-6077-7514

According to our database1, K. S. Thejaswini authored at least 13 papers between 2020 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
ε-Stationary Nash Equilibria in Multi-player Stochastic Graph Games.
CoRR, August, 2025

Privacy-Preserving Runtime Verification.
CoRR, May, 2025

Resolving Nondeterminism with Randomness.
Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

Finding Equilibria: Simpler for Pessimists, Simplest for Optimists.
Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

2024
Solving Two-Player Games Under Progress Assumptions.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2024

Rabin Games and Colourful Universal Trees.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2024

Simple and tight complexity lower bounds for solving Rabin games.
Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

2023
On History-Deterministic One-Counter Nets.
Proceedings of the Foundations of Software Science and Computation Structures, 2023

2022
A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games.
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.
Proceedings of the Principles of Systems Design, 2022

2021
Adaptive Synchronisation of Pushdown Automata.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020
A symmetric attractor-decomposition lifting algorithm for parity games.
CoRR, 2020

The Strahler Number of a Parity Game.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020


  Loading...