Paul Hunter

34 papers A* 2A 1B 7C 1Journal 19Unranked 4
YearRankTypeTitle / Venue / Authors
2022 J jnl
Correction to: Reactive synthesis without regret.
Acta Informatica
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
2018 J jnl
Looking at mean payoff through foggy windows.
Acta Informatica
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
2018 J jnl
Mean-payoff games with partial observation.
Theor. Comput. Sci.
Paul Hunter, Arno Pauly, Guillermo A. Pérez, Jean-François Raskin
2017 J jnl
Reactive synthesis without regret.
Acta Informatica
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
2016 B conf
Minimizing Regret in Discounted-Sum Games.
CSL
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
2016 C conf
Non-Zero Sum Games for Reactive Synthesis.
LATA
Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas
2015 B conf
Looking at Mean-Payoff Through Foggy Windows.
ATVA
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
2015 J jnl
Looking at Mean-Payoff through Foggy Windows.
CoRR
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
2015 J jnl
Minimizing Regret in Discounted-Sum Games.
CoRR
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
2015 J jnl
Non-Zero Sum Games for Reactive Synthesis.
CoRR
Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas
2015 — conf
Reachability in Succinct One-Counter Games.
RP
Paul Hunter
2015 B conf
Reactive Synthesis Without Regret.
CONCUR
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
2015 J jnl
Reactive Synthesis Without Regret.
CoRR
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
2015 B conf
Three Variables Suffice for Real-Time Logic.
FoSSaCS
Timos Antonopoulos, Paul Hunter, Shahab Raza, James Worrell
2014 — conf
Mean-Payoff Games with Partial-Observation - (Extended Abstract).
RP
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
2014 — conf
Quantitative Games with Interval Objectives.
FSTTCS
Paul Hunter, Jean-François Raskin
2014 J jnl
Quantitative games with interval objectives.
CoRR
Paul Hunter, Jean-François Raskin
2014 J jnl
Reachability in succinct one-counter games.
CoRR
Paul Hunter
2014 J jnl
Three Variables are Enough for Real-Time Specification.
CoRR
Timos Antonopoulos, Paul Hunter, Shahab Raza, James Worrell
2013 A* conf
Expressive Completeness for Metric Temporal Logic.
LICS
Paul Hunter, Joël Ouaknine, James Worrell
2013 J jnl
Mean-payoff Games with Incomplete Information.
CoRR
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
2013 B conf
When is Metric Temporal Logic Expressively Complete?.
CSL
Paul Hunter
2012 J jnl
Expressive Completeness of Metric Temporal Logic
CoRR
Paul Hunter, Joël Ouaknine, James Worrell
2012 J jnl
LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth.
Discret. Appl. Math.
Archontia C. Giannopoulou, Paul Hunter, Dimitrios M. Thilikos
2012 J jnl
The dag-width of directed graphs.
J. Comb. Theory B
Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer, Jan Obdrzálek
2012 J jnl
The expressiveness of MTL with counting
CoRR
Paul Hunter
2012 J jnl
When is Metric Temporal Logic Expressively Complete?
CoRR
Paul Hunter, Joël Ouaknine, James Worrell
2011 B conf
LIFO-Search on Digraphs: A Searching Game for Cycle-Rank.
FCT
Paul Hunter
2011 J jnl
LIFO-search on digraphs: A searching game for cycle-rank
CoRR
Paul Hunter
2010 — conf
Computing Rational Radical Sums in Uniform TC^0.
FSTTCS
Paul Hunter, Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell
2008 J jnl
Digraph measures: Kelly decompositions, games, and orderings.
Theor. Comput. Sci.
Paul Hunter, Stephan Kreutzer
2007 A* conf
Digraph measures: Kelly decompositions, games, and orderings.
SODA
Paul Hunter, Stephan Kreutzer
2006 A conf
DAG-Width and Parity Games.
STACS
Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer
2005 B conf
Complexity Bounds for Regular Games.
MFCS
Paul Hunter, Anuj Dawar