default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenjamin Bordais
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
From Local to Global Optimality in Concurrent Parity Games. CSL 2024: 18:1-18:21- [c8]Benjamin Bordais, Daniel Neider, Rajarshi Roy:
Learning Branching-Time Properties in CTL and ATL via Constraint Solving. FM (1) 2024: 304-323 - [i10]Benjamin Bordais, Daniel Neider, Rajarshi Roy:
Learning Branching-Time Properties in CTL and ATL via Constraint Solving. CoRR abs/2406.19890 (2024) - [i9]Benjamin Bordais, Daniel Neider, Rajarshi Roy:
The Complexity of Learning Temporal Properties. CoRR abs/2408.04486 (2024) - 2023
- [b1]Benjamin Bordais:
Concurrent two-player antagonistic games on graphs. (Jeux concurrents à deux joueurs antagonistes sur les graphes). University of Paris-Saclay, France, 2023 - [c7]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
Subgame Optimal Strategies in Finite Concurrent Games with Prefix-Independent Objectives. FoSSaCS 2023: 541-560 - [i8]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
Sub-game optimal strategies in concurrent games with prefix-independent objectives. CoRR abs/2301.10697 (2023) - [i7]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
From Local To Global Optimality in Concurrent Parity Games. CoRR abs/2311.14373 (2023) - [i6]Benjamin Bordais, Daniel Neider, Rajarshi Roy:
Learning Temporal Properties is NP-hard. CoRR abs/2312.11403 (2023) - 2022
- [c6]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
Optimal Strategies in Concurrent Reachability Games. CSL 2022: 7:1-7:17 - [c5]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
Playing (Almost-)Optimally in Concurrent Büchi and Co-Büchi Games. FSTTCS 2022: 33:1-33:18 - [c4]Benjamin Bordais, Damien Busatto-Gaston
, Shibashis Guha, Jean-François Raskin:
Strategy Synthesis for Global Window PCTL. ICALP 2022: 115:1-115:20 - [i5]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
Playing (Almost-)Optimally in Concurrent Büchi and co-Büchi Games. CoRR abs/2203.06966 (2022) - [i4]Benjamin Bordais, Damien Busatto-Gaston, Shibashis Guha, Jean-François Raskin:
Strategy Synthesis for Global Window PCTL. CoRR abs/2204.14107 (2022) - 2021
- [c3]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
From Local to Global Determinacy in Concurrent Graph Games. FSTTCS 2021: 41:1-41:14 - [i3]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
From local to global determinacy in concurrent graph games. CoRR abs/2107.04081 (2021) - [i2]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
Optimal strategies in concurrent reachability games. CoRR abs/2110.14724 (2021)
2010 – 2019
- 2019
- [c2]Benjamin Bordais, Shibashis Guha, Jean-François Raskin:
Expected Window Mean-Payoff. FSTTCS 2019: 32:1-32:15 - [c1]Nathalie Bertrand, Benjamin Bordais, Loïc Hélouët, Thomas Mari, Julie Parreaux, Ocan Sankur:
Performance Evaluation of Metro Regulations Using Probabilistic Model-Checking. RSSRail 2019: 59-76 - 2018
- [i1]Benjamin Bordais, Shibashis Guha, Jean-François Raskin:
Expected Window Mean-Payoff. CoRR abs/1812.09298 (2018)
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-12-10 21:45 CET 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:
