Paul Hunter : Publications
-
[2]
Complexity Bounds for Muller Games
Anuj Dawar‚ Florian Horn and Paul Hunter
In Theoretical Computer Science. 2011.
Submitted
Details about Complexity Bounds for Muller Games | BibTeX data for Complexity Bounds for Muller Games
-
[3]
Computing Rational Radical Sums in Uniform TC0
Paul Hunter‚ Patricia Bouyer‚ Nicolas Markey‚ Joël Ouaknine and James Worrell
In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). 2010.
Details about Computing Rational Radical Sums in Uniform TC0 | BibTeX data for Computing Rational Radical Sums in Uniform TC0 | Download (pdf) of Computing Rational Radical Sums in Uniform TC0
-
[4]
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
Details about LIFO−search: A min−max theorem and a searching game for cycle−rank and tree−depth. | BibTeX data for LIFO−search: A min−max theorem and a searching game for cycle−rank and tree−depth. | Download (pdf) of LIFO−search: A min−max theorem and a searching game for cycle−rank and tree−depth.
-
[6]
Digraph Measures: Kelly Decompositions‚ Games‚ and Orderings
Paul Hunter and Stephan Kreutzer
In Theoretical Computer Science (TCS). Vol. 399. Pages 206−219. 2008.
Details about Digraph Measures: Kelly Decompositions‚ Games‚ and Orderings | BibTeX data for Digraph Measures: Kelly Decompositions‚ Games‚ and Orderings | Download (pdf) of Digraph Measures: Kelly Decompositions‚ Games‚ and Orderings
-
[7]
Digraph Measures: Kelly Decompositions‚ Games‚ and Orderings
Paul Hunter and Stephan Kreutzer
In ACM−SIAM Symposium on Discrete Algorithms (SODA). 2007.
Details about Digraph Measures: Kelly Decompositions‚ Games‚ and Orderings | BibTeX data for Digraph Measures: Kelly Decompositions‚ Games‚ and Orderings
-
[8]
Complexity and Infinite Games on Finite Graphs
Paul Hunter
PhD Thesis Computer Laboratory‚ University of Cambridge. 2007.
Details about Complexity and Infinite Games on Finite Graphs | BibTeX data for Complexity and Infinite Games on Finite Graphs | Download (pdf) of Complexity and Infinite Games on Finite Graphs
-
[9]
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 about DAG−Width and Parity Games | BibTeX data for DAG−Width and Parity Games | Download (pdf) of DAG−Width and Parity Games
-
[10]
Complexity Bounds for Regular Games (Extended Abstract)
Paul Hunter and Anuj Dawar
In Symposium on Mathematical Foundations of Computer Science (MFCS). 2005.
Details about Complexity Bounds for Regular Games (Extended Abstract) | BibTeX data for Complexity Bounds for Regular Games (Extended Abstract) | Download (pdf) of Complexity Bounds for Regular Games (Extended Abstract)