Paul Hunter

Available identifiers

Publication	Date of Publication	Type
Correction to: ``Reactive synthesis without regret	2022-09-26	Paper
Looking at mean payoff through foggy windows	2018-12-12	Paper
Mean-payoff games with partial observation	2018-06-05	Paper
Reachability in succinct one-counter games	2017-10-27	Paper
Reactive Synthesis Without Regret	2017-09-12	Paper
Minimizing regret in discounted-sum games	2017-07-19	Paper
Expressive completeness for metric temporal logic	2017-07-03	Paper
Quantitative games with interval objectives	2017-04-25	Paper
Reactive synthesis without regret	2017-04-03	Paper
When is metric temporal logic expressively complete?	2017-02-02	Paper
Non-zero sum games for reactive synthesis	2016-04-13	Paper
Looking at mean-payoff through foggy windows	2016-01-08	Paper
Mean-payoff games with partial-observation (extended abstract)	2015-10-28	Paper
Three variables suffice for real-time logic	2015-10-01	Paper
Digraph measures: Kelly decompositions, games, and orderings	2014-12-18	Paper
LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth	2012-10-26	Paper
Computing rational radical sums in uniform \(\mathrm{TC}^0\)	2012-08-29	Paper
The dag-width of directed graphs	2012-08-14	Paper
LIFO-search on digraphs: a searching game for cycle-rank	2011-08-19	Paper
Digraph measures: Kelly decompositions, games, and orderings	2008-06-24	Paper
DAG-Width and Parity Games	2008-03-19	Paper
Mathematical Foundations of Computer Science 2005	2006-10-20	Paper

This page was built for person: Paul Hunter