The following pages link to Krishnendu Chatterjee (Q253965):
Displayed 50 items.
- Optimal cost almost-sure reachability in POMDPs (Q253969) (← links)
- What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives (Q269509) (← links)
- Trading performance for stability in Markov decision processes (Q340568) (← links)
- Strategy improvement for concurrent reachability and turn-based stochastic safety games (Q355506) (← links)
- Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems (Q388224) (← links)
- A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
- The complexity of stochastic Müller games (Q418128) (← links)
- Probabilistic opacity for Markov decision processes (Q458386) (← links)
- Polynomial-time algorithms for energy games with special weight structures (Q487011) (← links)
- Quantitative fair simulation games (Q528184) (← links)
- Doomsday equilibria for omega-regular games (Q528193) (← links)
- Stack size analysis for interrupt-driven programs (Q703848) (← links)
- Assume-guarantee synthesis for digital contract signing (Q736809) (← links)
- CEGAR for compositional analysis of qualitative properties in Markov decision processes (Q746785) (← links)
- Stateless model checking under a reads-value-from equivalence (Q832184) (← links)
- Games with secure equilibria (Q854165) (← links)
- Randomness for free (Q897644) (← links)
- Stochastic limit-average games are in EXPTIME (Q933752) (← links)
- Reduction of stochastic parity to stochastic mean-payoff games (Q963321) (← links)
- Strategy logic (Q979080) (← links)
- Evolution of decisions in population games with sequentially searching individuals (Q1651815) (← links)
- Quantitative monitor automata (Q1664379) (← links)
- Pushdown reachability with constant treewidth (Q1675921) (← links)
- Automated competitive analysis of real-time scheduling with graph games (Q1698779) (← links)
- Faster algorithms for quantitative verification in constant treewidth graphs (Q1702915) (← links)
- Counterexample explanation by learning small strategies in Markov decision processes (Q1702916) (← links)
- Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma (Q1749007) (← links)
- Energy parity games (Q1758152) (← links)
- Evolutionary game dynamics in populations with different learners (Q1784331) (← links)
- Density games (Q1790804) (← links)
- A branching time temporal framework for quantitative reasoning (Q1810854) (← links)
- Strategy construction for parity games with imperfect information (Q1959483) (← links)
- On satisficing in quantitative games (Q2044188) (← links)
- Faster algorithms for quantitative verification in bounded treewidth graphs (Q2058390) (← links)
- Automated recurrence analysis for almost-linear expected-runtime bounds (Q2151240) (← links)
- Value iteration for long-run average reward in Markov decision processes (Q2151247) (← links)
- Non-polynomial worst-case analysis of recursive programs (Q2164209) (← links)
- Optimal strategies for selecting coordinators (Q2217494) (← links)
- Stochastic games with lexicographic reachability-safety objectives (Q2226751) (← links)
- Algorithms and conditional lower bounds for planning problems (Q2238604) (← links)
- Code aware resource management (Q2248054) (← links)
- Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives (Q2248060) (← links)
- A survey of partial-observation stochastic parity games (Q2248075) (← links)
- Strategy synthesis for multi-dimensional quantitative objectives (Q2249657) (← links)
- Synthesizing robust systems (Q2249662) (← links)
- Approximating the minimum cycle mean (Q2253203) (← links)
- Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives (Q2257302) (← links)
- Evolutionary dynamics of biological auctions (Q2261847) (← links)
- Termination of nondeterministic probabilistic programs (Q2287109) (← links)
- Quantitative analysis of smart contracts (Q2324004) (← links)