No. |
Title |
Author |
Year |
---|

1 |
Algorithms and Hardness Results for Computing Cores of Markov Chains |
Ahmadi, Ali et al. |
2022 |

2 |
Complexity of Spatial Games |
Chatterjee, Krishnendu et al. |
2022 |

3 |
Faster Algorithms for Bounded Liveness in Graphs and Game Graphs |
Chatterjee, Krishnendu et al. |
2021 |

4 |
Quantitative Verification on Product Graphs of Small Treewidth |
Chatterjee, Krishnendu et al. |
2021 |

5 |
Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States |
Chatterjee, Krishnendu et al. |
2020 |

6 |
Simplified Game of Life: Algorithms and Complexity |
Chatterjee, Krishnendu et al. |
2020 |

7 |
The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game |
Schmid, Laura et al. |
2020 |

8 |
Combinations of Qualitative Winning for Stochastic Parity Games |
Chatterjee, Krishnendu et al. |
2019 |

9 |
Long-Run Average Behavior of Vector Addition Systems with States |
Chatterjee, Krishnendu et al. |
2019 |

10 |
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs |
Chatterjee, Krishnendu et al. |
2019 |

11 |
Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies |
Chatterjee, Krishnendu et al. |
2018 |

12 |
Bidirectional Nested Weighted Automata |
Chatterjee, Krishnendu et al. |
2017 |

13 |
Faster Algorithms for Mean-Payoff Parity Games |
Chatterjee, Krishnendu et al. |
2017 |

14 |
Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs |
Chatterjee, Krishnendu et al. |
2017 |

15 |
Improved Set-Based Symbolic Algorithms for Parity Games |
Chatterjee, Krishnendu et al. |
2017 |

16 |
Strategy Complexity of Concurrent Safety Games |
Chatterjee, Krishnendu et al. |
2017 |

17 |
Computation Tree Logic for Synchronization Properties |
Chatterjee, Krishnendu et al. |
2016 |

18 |
Conditionally Optimal Algorithms for Generalized Büchi Games |
Chatterjee, Krishnendu et al. |
2016 |

19 |
Nested Weighted Limit-Average Automata of Bounded Width |
Chatterjee, Krishnendu et al. |
2016 |

20 |
Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs |
Chatterjee, Krishnendu et al. |
2016 |

21 |
Non-Zero-Sum-Games and Control (Dagstuhl Seminar 15061) |
Chatterjee, Krishnendu et al. |
2015 |

22 |
Games and Decisions for Rigorous Systems Engineering (Dagstuhl Seminar 12461) |
Bjorner, Nikolaj et al. |
2013 |

23 |
Infinite-state games with finitary conditions |
Chatterjee, Krishnendu et al. |
2013 |

24 |
What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives |
Chatterjee, Krishnendu et al. |
2013 |

25 |
Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives |
Chatterjee, Krishnendu et al. |
2012 |

26 |
Faster Algorithms for Alternating Refinement Relations |
Chatterjee, Krishnendu et al. |
2012 |

27 |
Generalized Mean-payoff and Energy Games |
Chatterjee, Krishnendu et al. |
2010 |

28 |
Algorithms for Game Metrics |
Chatterjee, Krishnendu et al. |
2008 |