default search action
Axel Haddad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j5]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege:
One-Clock Priced Timed Games with Negative Weights. Log. Methods Comput. Sci. 18(3) (2022) - 2020
- [i5]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege:
One-Clock Priced Timed Games with Arbitrary Weights. CoRR abs/2009.03074 (2020)
2010 – 2019
- 2017
- [j4]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
:
Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games. Acta Informatica 54(1): 85-125 (2017) - 2016
- [c7]Thomas Brihaye, Amit Kumar Dhar, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
Efficient Energy Distribution in a Smart Grid using Multi-Player Games. Cassting/SynCoP 2016: 1-12 - 2015
- [j3]Thomas Brihaye, Axel Haddad, Quentin Menet:
Simple strategies for Banach-Mazur games and sets of probability 1. Inf. Comput. 245: 17-35 (2015) - [j2]Arnaud Carayol, Axel Haddad, Olivier Serre:
Erratum for "Randomization in Automata on Infinite Trees". ACM Trans. Comput. Log. 16(4): 36:1-36:2 (2015) - [c6]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. CONCUR 2015: 297-310 - [c5]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege:
Simple Priced Timed Games are not That Simple. FSTTCS 2015: 278-292 - [c4]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
Quantitative Games under Failures. FSTTCS 2015: 293-306 - [i4]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault:
Quantitative Games under Failures. CoRR abs/1504.06744 (2015) - [i3]Arnaud Carayol, Axel Haddad, Olivier Serre:
Counting Branches in Trees Using Games. CoRR abs/1505.03852 (2015) - [i2]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege:
Simple Priced Timed Games Are Not That Simple. CoRR abs/1507.03786 (2015) - 2014
- [j1]Arnaud Carayol, Axel Haddad, Olivier Serre:
Randomization in Automata on Infinite Trees. ACM Trans. Comput. Log. 15(3): 24:1-24:33 (2014) - [i1]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege:
To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. CoRR abs/1407.5030 (2014) - 2013
- [c3]Axel Haddad:
Model Checking and Functional Program Transformations. FSTTCS 2013: 115-126 - 2012
- [c2]Axel Haddad:
IO vs OI in Higher-Order Recursion Schemes. FICS 2012: 23-30 - 2011
- [c1]Arnaud Carayol, Axel Haddad, Olivier Serre:
Qualitative Tree Languages. LICS 2011: 13-22
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-04-25 05:46 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: