Author Description

Login to generate an author description

Ask a Question About This Mathematician

All published works (13)

Action Title Date Authors
Resolving Nondeterminism with Randomness 2025-02-18 Thomas A. Henzinger Aditya Prakash K. S. Thejaswini
Finding equilibria: simpler for pessimists, simplest for optimists 2025-02-07 Léonard Brice Thomas A. Henzinger K. S. Thejaswini
Simple and tight complexity lower bounds for solving Rabin games 2024-01-01 Antonio Casares Marcin Pilipczuk MichaƂ Pilipczuk UĂ©verton S. Souza K. S. Thejaswini
Rabin Games and Colourful Universal Trees 2024-01-01 Rupak Majumdar Irmak Sağlam K. S. Thejaswini
Solving Two-Player Games under Progress Assumptions 2023-01-01 Anne-Kathrin Schmuck K. S. Thejaswini Irmak Sağlam Satya Prakash Nayak
Simple and tight complexity lower bounds for solving Rabin games 2023-01-01 Antonio Casares Marcin Pilipczuk MichaƂ Pilipczuk UĂ©verton S. Souza K. S. Thejaswini
On History-Deterministic One-Counter Nets 2022-01-01 Aditya Prakash K. S. Thejaswini
Universal Algorithms for Parity Games and Nested Fixpoints 2022-01-01 Marcin JurdziƄski RĂ©mi Morvan K. S. Thejaswini
Adaptive Synchronisation of Pushdown Automata 2021-08-13 A. R. Balasubramanian K. S. Thejaswini
Adaptive Synchronisation of Pushdown Automata 2021-01-01 A. R. Balasubramanian K. S. Thejaswini
The Strahler number of a parity game 2020-01-01 Laure Daviaud Marcin JurdziƄski K. S. Thejaswini
A symmetric attractor-decomposition lifting algorithm for parity games 2020-01-01 Marcin JurdziƄski RĂ©mi Morvan Pierre Ohlmann K. S. Thejaswini
Universal Algorithms for Parity Games and Nested Fixpoints 2020-01-01 Marcin JurdziƄski RĂ©mi Morvan K. S. Thejaswini

Commonly Cited References

Action Title Date Authors # of times referenced
A pseudo-quasi-polynomial algorithm for mean-payoff parity games 2018-06-27 Laure Daviaud Marcin JurdziƄski Ranko Lazić 3
Fixpoint games on continuous lattices 2019-01-02 Paolo Baldan Barbara König Christina Mika-Michalski Tommaso Padoan 3
Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time 2019-01-01 PaweƂ Parys 3
Quasipolynomial Computation of Nested Fixpoints 2021-03-25 Daniel Hausmann Lutz Schröder 2
Computing Nested Fixpoints in Quasipolynomial Time. 2019-07-16 Daniel Hausmann Lutz Schröder 2
Succinct progress measures for solving parity games 2017-06-20 Marcin JurdziƄski Ranko Lazić 2
Improving the complexity of Parys' recursive algorithm 2019-04-26 Karoliina Lehtinen Sven Schewe Dominik Wojtczak 2
Practical synthesis of reactive systems from LTL specifications via parity games 2019-11-21 Michael Luttenberger Philipp J. Meyer Salomon Sickert 2
Exponential Lower Bounds for Policy Iteration 2010-01-01 John Fearnley 2
A Universal Attractor Decomposition Algorithm for Parity Games. 2020-01-13 Marcin JurdziƄski RĂ©mi Morvan 2
Alternating Weak Automata from Universal Trees 2019-01-01 Laure Daviaud Marcin JurdziƄski Karoliina Lehtinen 2
Quasipolynomial Set-Based Symbolic Algorithms for Parity Games 2018-10-23 Krishnendu Chatterjee Wolfgang Dvoƙák Monika Henzinger Alexander Svozil 1
Improving the complexity of Parys' recursive algorithm 2019-01-01 Karoliina Lehtinen Sven Schewe Dominik Wojtczak 1
+
Fast and simple nested fixpoints 1996-09-01 Helmut Seidl 1
Oink: An Implementation and Evaluation of Modern Parity Game Solvers 2018-01-01 Tom van Dijk 1
+
An Optimal Value Iteration Algorithm for Parity Games 2018-01-29 Nathanaël Fijalkow 1
Parity games and universal graphs 2018-01-01 Thomas Colcombet Nathanaël Fijalkow 1
An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space 2019-02-25 John Fearnley Sanjay Jain Bart de Keijzer Sven Schewe Frank Stephan Dominik Wojtczak 1
Synchronizing Data Words for Register Automata 2019-03-27 Karin Quaas Mahsa Shirmohammadi 1
Succinct progress measures for solving parity games 2017-06-01 Marcin JurdziƄski Ranko Lazić 1
The complexity of synchronizing Markov decision processes 2018-10-09 Laurent Doyen Thierry Massart Mahsa Shirmohammadi 1
Register Games 2019-01-01 Karoliina Lehtinen Udi Boker 1
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games 2019-01-01 Wojciech CzerwiƄski Laure Daviaud NathanaĂ«l Fijalkow Marcin JurdziƄski Ranko Lazić PaweƂ Parys 1