Paul Hunter

Orcid: 0000-0002-5767-3375

Affiliations:
  • Université Libre de Bruxelles, ULB, Bruxelles, Belgium
  • University of Oxford, Department of Computer Science, UK
  • University of Cambridge, UK (PhD 2007)
  • Humboldt-Universität zu Berlin, Logic and Discrete Systems group, Germany (2005-2006)


According to our database1, Paul Hunter authored at least 24 papers between 2005 and 2022.

Collaborative distances:

Timeline

2006
2008
2010
2012
2014
2016
2018
2020
2022
0
1
2
3
4
5
1
2
1
1
1
4
1
2
2
2
2
1
1
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Correction to: Reactive synthesis without regret.
Acta Informatica, 2022

2018
Mean-payoff games with partial observation.
Theor. Comput. Sci., 2018

Looking at mean payoff through foggy windows.
Acta Informatica, 2018

2017
Reactive synthesis without regret.
Acta Informatica, 2017

2016
Non-Zero Sum Games for Reactive Synthesis.
Proceedings of the Language and Automata Theory and Applications, 2016

Minimizing Regret in Discounted-Sum Games.
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015
Reachability in Succinct One-Counter Games.
Proceedings of the Reachability Problems - 9th International Workshop, 2015

Three Variables Suffice for Real-Time Logic.
Proceedings of the Foundations of Software Science and Computation Structures, 2015

2014
Three Variables are Enough for Real-Time Specification.
CoRR, 2014

Mean-Payoff Games with Partial-Observation - (Extended Abstract).
Proceedings of the Reachability Problems - 8th International Workshop, 2014

Quantitative Games with Interval Objectives.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013
Mean-payoff Games with Incomplete Information.
CoRR, 2013

Expressive Completeness for Metric Temporal Logic.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

When is Metric Temporal Logic Expressively Complete?.
Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012
The dag-width of directed graphs.
J. Comb. Theory B, 2012

LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth.
Discret. Appl. Math., 2012

The expressiveness of MTL with counting
CoRR, 2012

When is Metric Temporal Logic Expressively Complete?
CoRR, 2012

2011
LIFO-Search on Digraphs: A Searching Game for Cycle-Rank.
Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

2010
Computing Rational Radical Sums in Uniform TC^0.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2008
Digraph measures: Kelly decompositions, games, and orderings.
Theor. Comput. Sci., 2008

2007
Complexity and infinite games on finite graphs.
PhD thesis, 2007

2006
DAG-Width and Parity Games.
Proceedings of the STACS 2006, 2006

2005
Complexity Bounds for Regular Games.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005


  Loading...