Paul Hunter

According to our database1, Paul Hunter
  • authored at least 34 papers between 1972 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Reactive synthesis without regret.
Acta Inf., 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
Minimizing Regret in Discounted-Sum Games.
CoRR, 2015

Looking at Mean-Payoff through Foggy Windows.
CoRR, 2015

Reactive Synthesis Without Regret.
CoRR, 2015

Non-Zero Sum Games for Reactive Synthesis.
CoRR, 2015

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

SmartMed: A Medication Management System to Improve Adherence.
Proceedings of the Driving Quality in Informatics: Fulfilling the Promise, 2015

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

Reactive Synthesis Without Regret.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

Looking at Mean-Payoff Through Foggy Windows.
Proceedings of the Automated Technology for Verification and Analysis, 2015

2014
Quantitative games with interval objectives.
CoRR, 2014

Reachability in succinct one-counter games.
CoRR, 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, Ser. B, 2012

LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth.
Discrete Applied Mathematics, 2012

The expressiveness of MTL with counting
CoRR, 2012

When is Metric Temporal Logic Expressively Complete?
CoRR, 2012

Expressive Completeness of Metric Temporal Logic
CoRR, 2012

2011
LIFO-search on digraphs: A searching game for cycle-rank
CoRR, 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

2009
Accommodating Real User and Organisational Requirements in the Human Centered Design Process: A Case Study from the Mobile Phone Industry.
Proceedings of the Human Centered Design, 2009

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

2007
Digraph measures: Kelly decompositions, games, and orderings.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 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

1972
Patent literature project.
JASIS, 1972


  Loading...