The following pages link to Florian Horn (Q2379983):
Displaying 23 items.
- Dicing on the Streett (Q2379984) (← links)
- Two Recursively Inseparable Problems for Probabilistic Automata (Q2922022) (← links)
- Finitary winning in ω-regular games (Q2946587) (← links)
- Playing Safe (Q2978529) (← links)
- SELF-STABILIZING k-out-of-ℓ EXCLUSION IN TREE NETWORKS (Q2997926) (← links)
- The Complexity of Request-Response Games (Q3004582) (← links)
- Graph Games on Ordinals (Q3165954) (← links)
- Explicit Muller Games are PTIME (Q3165962) (← links)
- Stochastic Games with Finitary Objectives (Q3182912) (← links)
- Trading Bounds for Memory in Games with Counters (Q3449476) (← links)
- Optimal strategy synthesis for request-response games (Q3465629) (← links)
- Solving Simple Stochastic Games (Q3507435) (← links)
- Obliging Games (Q3584937) (← links)
- Solving Simple Stochastic Games with Few Random Vertices (Q3636809) (← links)
- Entropy Games and Matrix Multiplication Games (Q4601862) (← links)
- (Q5089313) (← links)
- (Q5150998) (← links)
- Random Fruits on the Zielonka Tree (Q5390006) (← links)
- (Q5417672) (← links)
- On Reachability Games of Ordinal Length (Q5448648) (← links)
- Simple Stochastic Games with Few Random Vertices Are Easy to Solve (Q5458347) (← links)
- Faster Algorithms for Finitary Games (Q5758126) (← links)
- Playing Safe, Ten Years Later (Q6151559) (← links)
