default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul Hunter 0001
Person information
- affiliation: Université Libre de Bruxelles, ULB, Bruxelles, Belgium
- affiliation: University of Oxford, Department of Computer Science, UK
- affiliation (PhD 2007): University of Cambridge, UK
- affiliation (2005-2006): Humboldt-Universität zu Berlin, Logic and Discrete Systems group, Germany
Other persons with the same name
- Paul Hunter — disambiguation page
- Paul Hunter 0002 — University of Victoria, British Columbia, Canada
- Paul Hunter 0003 — Telco, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j7]Paul Hunter
, Guillermo A. Pérez, Jean-François Raskin:
Correction to: Reactive synthesis without regret. Acta Informatica 59(5): 671 (2022)
2010 – 2019
- 2018
- [j6]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Looking at mean payoff through foggy windows. Acta Informatica 55(8): 627-647 (2018) - [j5]Paul Hunter, Arno Pauly, Guillermo A. Pérez, Jean-François Raskin:
Mean-payoff games with partial observation. Theor. Comput. Sci. 735: 82-110 (2018) - 2017
- [j4]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Reactive synthesis without regret. Acta Informatica 54(1): 3-39 (2017) - 2016
- [c15]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Minimizing Regret in Discounted-Sum Games. CSL 2016: 30:1-30:17 - [c14]Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas:
Non-Zero Sum Games for Reactive Synthesis. LATA 2016: 3-23 - 2015
- [c13]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Looking at Mean-Payoff Through Foggy Windows. ATVA 2015: 429-445 - [c12]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Reactive Synthesis Without Regret. CONCUR 2015: 114-127 - [c11]Timos Antonopoulos, Paul Hunter, Shahab Raza, James Worrell:
Three Variables Suffice for Real-Time Logic. FoSSaCS 2015: 361-374 - [c10]Paul Hunter:
Reachability in Succinct One-Counter Games. RP 2015: 37-49 - [i12]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Reactive Synthesis Without Regret. CoRR abs/1504.01708 (2015) - [i11]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Looking at Mean-Payoff through Foggy Windows. CoRR abs/1504.02947 (2015) - [i10]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Minimizing Regret in Discounted-Sum Games. CoRR abs/1511.00523 (2015) - [i9]Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas:
Non-Zero Sum Games for Reactive Synthesis. CoRR abs/1512.05568 (2015) - 2014
- [c9]Paul Hunter, Jean-François Raskin:
Quantitative Games with Interval Objectives. FSTTCS 2014: 365-377 - [c8]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Mean-Payoff Games with Partial-Observation - (Extended Abstract). RP 2014: 163-175 - [i8]Paul Hunter, Jean-François Raskin:
Quantitative games with interval objectives. CoRR abs/1404.4856 (2014) - [i7]Paul Hunter:
Reachability in succinct one-counter games. CoRR abs/1407.1996 (2014) - [i6]Timos Antonopoulos, Paul Hunter, Shahab Raza, James Worrell:
Three Variables are Enough for Real-Time Specification. CoRR abs/1408.1851 (2014) - 2013
- [c7]Paul Hunter:
When is Metric Temporal Logic Expressively Complete?. CSL 2013: 380-394 - [c6]Paul Hunter, Joël Ouaknine, James Worrell:
Expressive Completeness for Metric Temporal Logic. LICS 2013: 349-357 - [i5]Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Mean-payoff Games with Incomplete Information. CoRR abs/1309.5462 (2013) - 2012
- [j3]Archontia C. Giannopoulou, Paul Hunter, Dimitrios M. Thilikos:
LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth. Discret. Appl. Math. 160(15): 2089-2097 (2012) - [j2]Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer, Jan Obdrzálek:
The dag-width of directed graphs. J. Comb. Theory B 102(4): 900-923 (2012) - [i4]Paul Hunter, Joël Ouaknine, James Worrell:
Expressive Completeness of Metric Temporal Logic. CoRR abs/1208.4993 (2012) - [i3]Paul Hunter, Joël Ouaknine, James Worrell:
When is Metric Temporal Logic Expressively Complete? CoRR abs/1209.0516 (2012) - [i2]Paul Hunter:
The expressiveness of MTL with counting. CoRR abs/1209.0518 (2012) - 2011
- [c5]Paul Hunter:
LIFO-Search on Digraphs: A Searching Game for Cycle-Rank. FCT 2011: 217-228 - [i1]Paul Hunter:
LIFO-search on digraphs: A searching game for cycle-rank. CoRR abs/1103.6019 (2011) - 2010
- [c4]Paul Hunter, Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell:
Computing Rational Radical Sums in Uniform TC^0. FSTTCS 2010: 308-316
2000 – 2009
- 2008
- [j1]Paul Hunter, Stephan Kreutzer:
Digraph measures: Kelly decompositions, games, and orderings. Theor. Comput. Sci. 399(3): 206-219 (2008) - 2007
- [b1]Paul W. Hunter:
Complexity and infinite games on finite graphs. University of Cambridge, UK, 2007 - [c3]Paul Hunter, Stephan Kreutzer:
Digraph measures: Kelly decompositions, games, and orderings. SODA 2007: 637-644 - 2006
- [c2]Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer:
DAG-Width and Parity Games. STACS 2006: 524-536 - 2005
- [c1]Paul Hunter, Anuj Dawar:
Complexity Bounds for Regular Games. MFCS 2005: 495-506
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-28 02:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
