Paul Hunter

Dr Paul Hunter

EPSRC Post-Doctoral Research Fellow

+44 (0)1865 283515

Room 407, Wolfson Building, Parks Road, Oxford OX1 3QD

interests

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.

links

publications

Complexity Bounds for Muller Games

Paul Hunter, Anuj Dawar

Theoretical Computer Science (TCS), 2008.

Submitted.

Details | BibTeX | Link (pdf)

Digraph Measures: Kelly Decompositions, Games, and Orderings

Paul Hunter, Stephan Kreutzer

Theoretical Computer Science (TCS), Vol. 399, pages 206-219. 2008.

Details | BibTeX | Link (pdf)

Complexity and Infinite Games on Finite Graphs

Paul Hunter

PhD Thesis, Computer Laboratory, University of Cambridge. 2007.

Details | BibTeX | Link (pdf)

View all

info

themes	Foundations, Logic and Structures
projects	Notions of width for directed graphs and hypergraphs