Paul Hunter

Acta Informatica, 2022

2018

Mean-payoff games with partial observation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Looking at mean payoff through foggy windows.

[BibT_eX]

[DOI]

Acta Informatica, 2018

2017

Reactive synthesis without regret.

[BibT_eX]

[DOI]

Acta Informatica, 2017

2016

Non-Zero Sum Games for Reactive Synthesis.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2016

Minimizing Regret in Discounted-Sum Games.

[BibT_eX]

[DOI]

Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015

Reachability in Succinct One-Counter Games.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 9th International Workshop, 2015

SmartMed: A Medication Management System to Improve Adherence.

[BibT_eX]

[DOI]

Proceedings of the Driving Quality in Informatics: Fulfilling the Promise, 2015

Three Variables Suffice for Real-Time Logic.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2015

2014

Three Variables are Enough for Real-Time Specification.

[BibT_eX]

[DOI]

CoRR, 2014

Mean-Payoff Games with Partial-Observation - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 8th International Workshop, 2014

Quantitative Games with Interval Objectives.

[BibT_eX]

[DOI]

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013

Mean-payoff Games with Incomplete Information.

[BibT_eX]

[DOI]

CoRR, 2013

Expressive Completeness for Metric Temporal Logic.

[BibT_eX]

[DOI]

Joël Ouaknine

James Worrell

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

When is Metric Temporal Logic Expressively Complete?.

[BibT_eX]

[DOI]

Archontia C. Giannopoulou

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012

The dag-width of directed graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2012

LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth.

[BibT_eX]

[DOI]

Dimitrios M. Thilikos

Discret. Appl. Math., 2012

The expressiveness of MTL with counting

[BibT_eX]

[DOI]

CoRR, 2012

When is Metric Temporal Logic Expressively Complete?

[BibT_eX]

[DOI]

Joël Ouaknine

James Worrell

CoRR, 2012

2011

LIFO-Search on Digraphs: A Searching Game for Cycle-Rank.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

2010

Computing Rational Radical Sums in Uniform TC^0.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Steve Love

Michael Anaman

Proceedings of the Human Centered Design, 2009

2008

Digraph measures: Kelly decompositions, games, and orderings.

[BibT_eX]

[DOI]

Stephan Kreutzer

Theor. Comput. Sci., 2008

2006

DAG-Width and Parity Games.

[BibT_eX]

[DOI]

Proceedings of the STACS 2006, 2006

2005

Complexity Bounds for Regular Games.

[BibT_eX]

[DOI]

Anuj Dawar

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

1972

Patent literature project.

[BibT_eX]

[DOI]