The following pages link to One-counter stochastic games (Q2908841):
Displaying 19 items.
- Games with 1-backtracking (Q636360) (← links)
- Runtime analysis of probabilistic programs with unbounded recursion (Q743128) (← links)
- The Viterbi algorithm for subsets of stochastic context-free languages (Q1708272) (← links)
- One-pile Nim games with arbitrarily many random players (Q1727724) (← links)
- Approximating the termination value of one-counter MDPs and stochastic games (Q1951577) (← links)
- On decidability and complexity of low-dimensional robot games (Q2009641) (← links)
- Simple stochastic games with almost-sure energy-parity objectives are in NP and conp (Q2233425) (← links)
- Analyzing probabilistic pushdown automata (Q2248071) (← links)
- Computing expected runtimes for constant probability programs (Q2305420) (← links)
- Qualitative Analysis of VASS-Induced MDPs (Q2811349) (← links)
- Runtime Analysis of Probabilistic Programs with Unbounded Recursion (Q3012930) (← links)
- Approximating the Termination Value of One-Counter MDPs and Stochastic Games (Q3012931) (← links)
- (Q4452102) (← links)
- Probabilistic Model Checking for Energy-Utility Analysis (Q5418957) (← links)
- Efficient Analysis of Probabilistic Programs with an Unbounded Counter (Q5501946) (← links)
- 1½-Player Stochastic StopWatch Games (Q6080284) (← links)
- (Q6134270) (← links)
- Submixing and shift-invariant stochastic games (Q6183353) (← links)
- Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs (Q6566586) (← links)
