|
|
Paul Hunter
I am a postdoctoral research fellow at the Oxford University Computing Laboratory.
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 |
pdf | ps.gz |
| Complexity Bounds for Muller Games, P. Hunter and
A. Dawar, Submitted for publication in Theoretical Computer
Science, 2008 |
pdf | ps.gz |
Refereed Conferences
| Complexity Bounds for Regular Games (Extended
abstract), P. Hunter and A. Dawar, MFCS 2005 |
pdf | ps.gz |
| DAG-Width and Parity Games, D. Berwanger, A. Dawar,
P. Hunter and S. Kreutzer, STACS 2006 |
pdf | ps.gz |
| Digraph Measures: Kelly Decompositions, Games, and
Orderings, P. Hunter and S. Kreutzer, SODA 2007 |
pdf | ps.gz |
PhD Thesis
Miscellaneous
| DAG-Width and Parity Games, D. Berwanger, A. Dawar,
P. Hunter and S. Kreutzer, Full version |
pdf | ps.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 |
pdf | ps.gz |
| Unstable internet routing as oriented hypercubes, P. Hunter, An informal note on a
combinatorial perspective of abstracted internet routing policies |
pdf | ps.gz |
Talks
| Mitarbeiter seminar (May 27, 2005), Humboldt University, Berlin |
slides |
| MFCS (August 2005), Gdansk | slides | |
| GAMES'05 (September 2005), Paris | slides |
| STACS (February 2006), Marseille | slides |
| InfoSys seminar (October 28, 2008), Oxford University | slides |
|
|
|
|
