University of Oxford Logo University of OxfordDepartment of Computer Science - Home
On Facebook
Facebook
Follow us on twitter
Twitter
Linked in
Linked in
Flickr
Flickr
Google plus
Google plus
Digg
Digg
Pinterest
Pinterest
Stumble Upon
Stumble Upon

Paul Hunter

I am a postdoctoral research fellow at the Department of Computer Science, University of Oxford.

My research is primarily centred on the use of mathematical games in theoretical computer science, in particular games for formal verification and pursuit-evasion games defining structural and algorithmic complexity.


Publications

Journals
Digraph Measures: Kelly Decompositions, Games, and Orderings, P. Hunter and S. Kreutzer, Theoretical Computer Science, Volume 399, pages 206-219, 2008 pdfps.gz
Complexity Bounds for Muller Games, A. Dawar, F. Horn and P. Hunter, Submitted for publication in Theoretical Computer Science, 2010 pdfps.gz
DAG-Width and Parity Games, D. Berwanger, A. Dawar, P. Hunter, S. Kreutzer and J. Obdrzalek, Submitted for publication in Journal of Combinatorial Theory, Series B, 2010
LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth, A. Giannopoulou, P. Hunter and D. Thilikos, Submitted for publication in Discrete Mathematics, 2011 pdf

Refereed Conferences
Complexity Bounds for Regular Games (Extended abstract), P. Hunter and A. Dawar, MFCS 2005 pdfps.gz
DAG-Width and Parity Games, D. Berwanger, A. Dawar, P. Hunter and S. Kreutzer, STACS 2006 pdfps.gz
Digraph Measures: Kelly Decompositions, Games, and Orderings, P. Hunter and S. Kreutzer, SODA 2007 pdfps.gz
Computing Rational Radical Sums in Uniform TC0, P. Hunter, P. Bouyer, N. Markey, J. Ouaknine and J. Worrell, FSTTCS 2010 pdf
LIFO-search on digraphs: A searching game for cycle-rank, P. Hunter, To be presented at FCT2011 pdf

PhD Thesis
Complexity and Infinite Games on Finite Graphs (online friendly version) pdf

Miscellaneous
DAG-Width and Parity Games, D. Berwanger, A. Dawar, P. Hunter and S. Kreutzer, Full version pdfps.gz
Losing the +1: Directed path-width games are monotone, P. Hunter, A result to complete the proof of Barát on the monotonicity of directed path-width games pdfps.gz
Unstable internet routing as oriented hypercubes, P. Hunter, An informal note on a combinatorial perspective of abstracted internet routing policies pdfps.gz

Talks

Mitarbeiter seminar (May 27, 2005), Humboldt University, Berlin slides
MFCS (August 2005), Gdanskslides
GAMES'05 (September 2005), Parisslides
STACS (February 2006), Marseilleslides
InfoSys seminar (October 28, 2008), Oxford Universityslides

Teaching

I am a lecturer in Computer Science for St John's College. I tutor all core subjects in the first and second year.

In Michaelmas 2010 I lectured the Models of Computation course.

In 2008-09 I taught classes for Randomised Algorithms.

Contact

Contact details can be found from my personnel page.