By Dr Paul Hunter

Book Chapters

Brenguier R; Clemente L; Hunter P; Perez GA; Randour M; Raskin J-F; Sankur O; Sassolas M, 2016, 'Non-Zero Sum Games for Reactive Synthesis', in Dediu AH; Janousek J; MartinVide C; Truthe B (ed.), , SPRINGER-VERLAG BERLIN, pp. 3 - 23, http://dx.doi.org/10.1007/978-3-319-30000-9_1

Hunter P; Perez GA; Raskin J-F, 2015, 'Looking at Mean-Payoff Through Foggy Windows', in Finkbeiner B; Pu G; Zhang L (ed.), , SPRINGER INTERNATIONAL PUBLISHING AG, pp. 429 - 445, http://dx.doi.org/10.1007/978-3-319-24953-7_31

Hunter P, 2015, 'Reachability in Succinct One-Counter Games', in Lecture Notes in Computer Science, Springer International Publishing, pp. 37 - 49, http://dx.doi.org/10.1007/978-3-319-24537-9_5

Antonopoulos T; Hunter P; Raza S; Worrell J, 2015, 'Three Variables Suffice for Real-Time Logic', in Pitts A (ed.), , SPRINGER-VERLAG BERLIN, pp. 361 - 374, http://dx.doi.org/10.1007/978-3-662-46678-0_23

Hunter P; Pérez GA; Raskin J-F, 2014, 'Mean-Payoff Games with Partial-Observation', in Lecture Notes in Computer Science, Springer International Publishing, pp. 163 - 175, http://dx.doi.org/10.1007/978-3-319-11439-2_13

Hunter P, 2011, 'LIFO-Search on Digraphs: A Searching Game for Cycle-Rank', in Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 217 - 228, http://dx.doi.org/10.1007/978-3-642-22953-4_19

Berwanger D; Dawar A; Hunter P; Kreutzer S, 2006, 'DAG-width and parity games', in Durand B; Thomas W (ed.), , SPRINGER-VERLAG BERLIN, pp. 524 - 536

Hunter P; Dawar A, 2005, 'Complexity Bounds for Regular Games', in Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 495 - 506, http://dx.doi.org/10.1007/11549345_43

Back to profile page