Paul Hunter
|
Dr
Paul
Hunter
Research Fellow
Tutorial Fellow,
St John's College
paul.hunter @ cs.ox.ac.uk
01865 (2) 73864
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
Further work-related information (talk slides, teaching, unpublished results, etc)
Personal page
Selected Publications
| The DAG−Width of Directed Graphs Dietmar Berwanger‚ Anuj Dawar‚ Paul Hunter‚ Stephan Kreutzer and Jan Obdržalek In Journal of Combinatorial Theory‚ Series B. 2012. Accepted for publication |
| Complexity Bounds for Muller Games Anuj Dawar‚ Florian Horn and Paul Hunter In Theoretical Computer Science. 2011. Submitted |
| LIFO−search: A min−max theorem and a searching game for cycle−rank and tree−depth. Archontia Giannopoulou‚ Paul Hunter and Dimitrios Thilikos In Discrete Mathematics. 2011. Submitted |
Info
|
Themes |
|
|
Completed Projects |
