The following pages link to Paul Hunter (Q444379):
Displaying 22 items.
- The dag-width of directed graphs (Q444380) (← links)
- Reactive synthesis without regret (Q520338) (← links)
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth (Q713301) (← links)
- Digraph measures: Kelly decompositions, games, and orderings (Q930893) (← links)
- Looking at mean payoff through foggy windows (Q1629743) (← links)
- Reachability in succinct one-counter games (Q1675146) (← links)
- Mean-payoff games with partial observation (Q2636514) (← links)
- Correction to: ``Reactive synthesis without regret'' (Q2675812) (← links)
- Non-Zero Sum Games for Reactive Synthesis (Q2798706) (← links)
- (Q2908860) (← links)
- (Q2934648) (← links)
- Three Variables Suffice for Real-Time Logic (Q2949451) (← links)
- (Q2958534) (← links)
- Quantitative games with interval objectives (Q2978528) (← links)
- LIFO-Search on Digraphs: A Searching Game for Cycle-Rank (Q3088285) (← links)
- Mean-Payoff Games with Partial-Observation (Q3447703) (← links)
- Looking at Mean-Payoff Through Foggy Windows (Q3460583) (← links)
- Expressive Completeness for Metric Temporal Logic (Q5271072) (← links)
- Minimizing Regret in Discounted-Sum Games (Q5278417) (← links)
- Reactive Synthesis Without Regret (Q5357698) (← links)
- DAG-Width and Parity Games (Q5449827) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492884) (← links)
