Dr Paul Hunter

Dr Paul Hunter

Computer Science and Engineering

Paul completed a BSc in mathematics at the University of Tasmania, before moving to the UK to do a PhD in Theoretical Computer Science at the University of Cambridge. In 2008 he was awarded an EPSRC Postdoctoral Fellowship, which took him to the University of Oxford for five years. Following this, Paul worked as a postdoc at the Université Libre de Bruxelles for three years, before returning to Australia in 2016.  His area of expertise is (unsurprisingly) Theoretical CS, in particular formal verification, graph theory, and algorithms.

  • Book Chapters | 2016
    Brenguier R; Clemente L; Hunter P; Pérez GA; Randour M; Raskin J-F; Sankur O; Sassolas M, 2016, 'Non-Zero Sum Games for Reactive Synthesis', in Language and Automata Theory and Applications, Springer International Publishing, pp. 3 - 23, http://dx.doi.org/10.1007/978-3-319-30000-9_1
    Book Chapters | 2015
    Antonopoulos T; Hunter P; Raza S; Worrell J, 2015, 'Three Variables Suffice for Real-Time Logic', in Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 361 - 374, http://dx.doi.org/10.1007/978-3-662-46678-0_23
    Book Chapters | 2015
    Hunter P; Pérez GA; Raskin J-F, 2015, 'Looking at Mean-Payoff Through Foggy Windows', in Automated Technology for Verification and Analysis, Springer International Publishing, pp. 429 - 445, http://dx.doi.org/10.1007/978-3-319-24953-7_31
    Book Chapters | 2015
    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
    Book Chapters | 2014
    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
    Book Chapters | 2011
    Hunter P, 2011, 'LIFO-Search on Digraphs: A Searching Game for Cycle-Rank', in Fundamentals of Computation Theory, Springer Berlin Heidelberg, pp. 217 - 228, http://dx.doi.org/10.1007/978-3-642-22953-4_19
    Book Chapters | 2006
    Berwanger D; Dawar A; Hunter P; Kreutzer S, 2006, 'DAG-Width and Parity Games', in STACS 2006, Springer Berlin Heidelberg, pp. 524 - 536, http://dx.doi.org/10.1007/11672142_43
    Book Chapters | 2005
    Hunter P; Dawar A, 2005, 'Complexity Bounds for Regular Games', in Mathematical Foundations of Computer Science 2005, Springer Berlin Heidelberg, pp. 495 - 506, http://dx.doi.org/10.1007/11549345_43
  • Journal articles | 2022
    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
    Journal articles | 2018
    Hunter P; Pérez 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
    Journal articles | 2017
    Hunter P; Pérez 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
    Journal articles | 2012
    Berwanger D; Dawar A; Hunter P; Kreutzer S; Obdržálek 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
    Journal articles | 2012
    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
    Journal articles | 2008
    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 | 2013
    Hunter P; Ouaknine J; Worrell J, 2013, 'Expressive Completeness for Metric Temporal Logic', in 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, presented at 2013 Twenty-Eighth Annual IEEE/ACM Symposium on Logic in Computer Science (LICS 2013), 25 June 2013 - 28 June 2013, http://dx.doi.org/10.1109/lics.2013.41