Paul Hunter
|
Dr
Paul
Hunter
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
| Complexity Bounds for Muller Games Paul Hunter and Anuj Dawar Theoretical Computer Science (TCS). 2008. Submitted 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) |
| Complexity Bounds for Regular Games (Extended Abstract) Paul Hunter and Anuj Dawar In Symposium on Mathematical Foundations of Computer Science (MFCS). 2005. Details | BibTeX | Link (pdf) |
Info
|
Themes |
|
|
Projects |