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

Journal articles

Hunter P; Pérez GA; Raskin J-F, 2022, 'Correction to: Reactive synthesis without regret', Acta Informatica, 59, pp. 671 - 671, http://dx.doi.org/10.1007/s00236-021-00410-0

Hunter P; Perez GA; Raskin J-F, 2018, 'Looking at mean payoff through foggy windows', ACTA INFORMATICA, 55, pp. 627 - 647, http://dx.doi.org/10.1007/s00236-017-0304-7

Hunter P; Perez GA; Raskin J-F, 2017, 'Reactive synthesis without regret', ACTA INFORMATICA, 54, pp. 3 - 39, http://dx.doi.org/10.1007/s00236-016-0268-z

Giannopoulou AC; Hunter P; Thilikos DM, 2012, 'LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth', DISCRETE APPLIED MATHEMATICS, 160, pp. 2089 - 2097, http://dx.doi.org/10.1016/j.dam.2012.03.015

Berwanger D; Dawar A; Hunter P; Kreutzer S; Obdrzalek J, 2012, 'The DAG-width of directed graphs', JOURNAL OF COMBINATORIAL THEORY SERIES B, 102, pp. 900 - 923, http://dx.doi.org/10.1016/j.jctb.2012.04.004

Hunter P; Kreutzer S, 2008, 'Digraph measures: Kelly decompositions, games, and orderings', THEORETICAL COMPUTER SCIENCE, 399, pp. 206 - 219, http://dx.doi.org/10.1016/j.tcs.2008.02.038

Conference Papers

Hunter P; Ouaknine J; Worrell J, 2013, 'Expressive Completeness for Metric Temporal Logic', in 2013 28TH ANNUAL IEEE/ACM SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), IEEE, LA, Tulane Univ, New Orleans, pp. 349 - 357, presented at 28th Annual IEEE/ACM Symposium on Logic in Computer Science (LICS), LA, Tulane Univ, New Orleans, 25 June 2013 - 28 June 2013, http://dx.doi.org/10.1109/LICS.2013.41

Hunter P; Bouyer P; Markey N; Ouaknine J; Worrell J, 2010, 'Computing Rational Radical Sums in Uniform TC⁰', in Lodaya K; Mahajan M (ed.), IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2010), SCHLOSS DAGSTUHL, LEIBNIZ CENTER INFORMATICS, INDIA, Inst Math Sci, Chennai, pp. 308 - 316, presented at 30th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), INDIA, Inst Math Sci, Chennai, 15 December 2010 - 18 December 2012, http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2010.308

Hunter P; Kreutzer S, 2007, 'Digraph Measures: Kelly Decompositions, Games, and Orderings', in PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SIAM, LA, New Orleans, pp. 637 - 644, presented at 18th ACM-SIAM Symposium on Discrete Algorithms, LA, New Orleans, 07 January 2007 - 09 January 2007

Hunter P; Dawar A, 2005, 'Complexity bounds for regular games (Extended abstract)', in Jedrzejowicz J; Szepietowski A (ed.), MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2005, PROCEEDINGS, SPRINGER-VERLAG BERLIN, POLAND, Gdansk, pp. 495 - 506, presented at 30th International Symposium on Mathematical Foundations of Computer Science, POLAND, Gdansk, 29 August 2005 - 02 September 2005

Back to profile page