Paul Hunter
Title
Cited by
Cited by
Year
DAG-width and parity games
D Berwanger, A Dawar, P Hunter, S Kreutzer
Annual Symposium on Theoretical Aspects of Computer Science, 524-536, 2006
1572006
Digraph measures: Kelly decompositions, games, and orderings
P Hunter, S Kreutzer
Theoretical Computer Science 399 (3), 206-219, 2008
1562008
The dag-width of directed graphs
D Berwanger, A Dawar, P Hunter, S Kreutzer, J Obdržálek
Journal of Combinatorial Theory, Series B 102 (4), 900-923, 2012
922012
Complexity bounds for regular games
P Hunter, A Dawar
International Symposium on Mathematical Foundations of Computer Science, 495-506, 2005
412005
Expressive completeness for metric temporal logic
P Hunter, J Ouaknine, J Worrell
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 349-357, 2013
352013
Complexity and infinite games on finite graphs
PW Hunter
University of Cambridge, Computer Laboratory, 2007
322007
Non-zero sum games for reactive synthesis
R Brenguier, L Clemente, P Hunter, GA Pérez, M Randour, JF Raskin, ...
Language and Automata Theory and Applications, 3-23, 2016
282016
When is Metric Temporal Logic Expressively Complete?
P Hunter, J Ouaknine, J Worrell
arXiv preprint arXiv:1209.0516, 2012
202012
LIFO-search: A min–max theorem and a searching game for cycle-rank and tree-depth
AC Giannopoulou, P Hunter, DM Thilikos
Discrete Applied Mathematics 160 (15), 2089-2097, 2012
192012
Reachability in succinct one-counter games
P Hunter
International Workshop on Reachability Problems, 37-49, 2015
172015
Mean-payoff games with partial-observation
P Hunter, GA Pérez, JF Raskin
International Workshop on Reachability Problems, 163-175, 2014
102014
Losing the+ 1 or directed path-width games are monotone
P Hunter
102006
Quantitative games with interval objectives
P Hunter, JF Raskin
34th International Conference on Foundations of Software Technology and …, 2014
92014
D-width and cops and robbers
W Evans, P Hunter, MA Safari
Research report, 2013. unpublished, 2007
72007
Looking at mean payoff through foggy windows
P Hunter, GA Pérez, JF Raskin
Acta Informatica 55 (8), 627-647, 2018
62018
Reactive synthesis without regret
P Hunter, GA Pérez, JF Raskin
Acta informatica 54 (1), 3-39, 2017
62017
Mean-payoff games with partial observation
P Hunter, A Pauly, GA Pérez, JF Raskin
Theoretical Computer Science 735, 82-110, 2018
42018
Complexity bounds for Muller games
A Dawar, F Horn, P Hunter
Theoretical Computer Science, 2011
42011
Minimizing regret in discounted-sum games
P Hunter, GA Pérez, JF Raskin
arXiv preprint arXiv:1511.00523, 2015
32015
Three variables suffice for real-time logic
T Antonopoulos, P Hunter, S Raza, J Worrell
International Conference on Foundations of Software Science and Computation …, 2015
32015
The system can't perform the operation now. Try again later.
Articles 1–20