Paul Hunter : Publications
|
[1] |
Complexity Bounds for Muller Games Paul Hunter and Anuj Dawar Theoretical Computer Science (TCS). 2008. Submitted Details | BibTeX | Link (pdf) |
|
[2] |
Digraph Measures: Kelly Decompositions, Games, and Orderings Paul Hunter and Stephan Kreutzer Theoretical Computer Science (TCS). Vol. 399. Pages 206-219. 2008. Details | BibTeX | Link (pdf) |
|
[3] |
Digraph Measures: Kelly Decompositions, Games, and Orderings Paul Hunter and Stephan Kreutzer In ACM-SIAM Symposium on Discrete Algorithms (SODA). 2007. |
|
[4] |
Complexity and Infinite Games on Finite Graphs Paul Hunter PhD Thesis Computer Laboratory, University of Cambridge. 2007. Details | BibTeX | Link (pdf) |
|
[5] |
DAG-Width and Parity Games Dietmar Berwanger, Anuj Dawar, Paul Hunter and Stephan Kreutzer In Symposium on Theoretical Aspects of Computer Science (STACS). 2006. Details | BibTeX | Link (pdf) |
|
[6] |
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) |