The following pages link to STACS 2004 (Q5309683):
Displaying 15 items.
- Finiteness in the Beggar-My-Neighbor card game (Q383179) (← links)
- Exploring the boundary of half-positionality (Q656821) (← links)
- On the positional determinacy of edge-labeled games (Q818128) (← links)
- Looking at mean payoff through foggy windows (Q1629743) (← links)
- Winning strategies for infinite games: from large cardinals to computer science extended abstract (Q1885038) (← links)
- Reasoning about memoryless strategies under partial observability and unconditional fairness constraints (Q2346410) (← links)
- On the determinacy of concurrent games on event structures with infinite winning sets (Q2453582) (← links)
- The Mate-in-n Problem of Infinite Chess Is Decidable (Q2904396) (← links)
- Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives (Q3519498) (← links)
- Half-Positional Determinacy of Infinite Games (Q3591410) (← links)
- Determinateness of certain almost-Borel games (Q3718707) (← links)
- Solving Infinite Games in the Baire Space (Q5038566) (← links)
- A Multi-Core Solver for Parity Games (Q5415659) (← links)
- (Q5742223) (← links)
- (Q5856414) (← links)