Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDYoussouf Oualhadj
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i8]Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove:
Arena-Independent Finite-Memory Determinacy in Stochastic Games. CoRR abs/2102.10104 (2021)- 2020
- [j2]Thomas Brihaye, Florent Delgrange, Youssouf Oualhadj, Mickael Randour:
Life is Random, Time is Not: Markov Decision Processes with Window Objectives. Log. Methods Comput. Sci. 16(4) (2020) - [c10]Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove:
Games Where You Can Play Optimally with Arena-Independent Finite Memory. CONCUR 2020: 24:1-24:22 - [i7]Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove:
Games Where You Can Play Optimally with Finite Memory. CoRR abs/2001.03894 (2020)
2010 – 2019
- 2019
- [c9]Thomas Brihaye, Florent Delgrange
, Youssouf Oualhadj, Mickael Randour:
Life Is Random, Time Is Not: Markov Decision Processes with Window Objectives. CONCUR 2019: 8:1-8:18 - [i6]Thomas Brihaye, Florent Delgrange, Youssouf Oualhadj, Mickael Randour:
Life is Random, Time is Not: Markov Decision Processes with Window Objectives. CoRR abs/1901.03571 (2019) - 2018
- [c8]Rodica Condurache, Youssouf Oualhadj, Nicolas Troquard:
The Complexity of Rational Synthesis for Concurrent Games. CONCUR 2018: 38:1-38:15 - [i5]Youssouf Oualhadj, Léo Tible, Daniele Varacca:
Banach-Mazur Parity Games and Almost-sure Winning Strategies. CoRR abs/1806.10025 (2018) - 2017
- [i4]Rodica Condurache, Youssouf Oualhadj:
The Complexity of Concurrent Rational Synthesis. CoRR abs/1707.06936 (2017) - [i3]Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Youssouf Oualhadj:
Two Recursively Inseparable Problems for Probabilistic Automata. CoRR abs/1709.03122 (2017) - 2016
- [c7]Youssouf Oualhadj, Nicolas Troquard:
Rational verification in Iterated Electric Boolean Games. SR 2016: 41-51 - 2015
- [j1]Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Youssouf Oualhadj:
Deciding the value 1 problem for probabilistic leaktight automata. Log. Methods Comput. Sci. 11(2) (2015) - 2014
- [c6]Youssouf Oualhadj, Pierre-Alain Reynier, Ocan Sankur:
Probabilistic Robust Timed Games. CONCUR 2014: 203-217 - [c5]Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Youssouf Oualhadj:
Perfect-Information Stochastic Mean-Payoff Parity Games. FoSSaCS 2014: 210-225 - [c4]Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Youssouf Oualhadj:
Two Recursively Inseparable Problems for Probabilistic Automata. MFCS (1) 2014: 267-278 - [c3]Hugo Gimbert, Youssouf Oualhadj:
Deciding the Value 1 Problem for $\sharp$ -acyclic Partially Observable Markov Decision Processes. SOFSEM 2014: 281-292 - 2012
- [b1]Youssouf Oualhadj:
The value problem in stochastic games. (Le problème de la valeur dans les jeux stochastiques). University of Bordeaux, France, 2012 - [c2]Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj:
Deciding the Value 1 Problem for Probabilistic Leaktight Automata. LICS 2012: 295-304 - 2011
- [i2]Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj:
Pushing undecidability of the isolation problem for probabilistic automata. CoRR abs/1104.3054 (2011) - [i1]Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj:
A Class of Probabilistic Automata with a Decidable Value 1 Problem. CoRR abs/1104.3055 (2011) - 2010
- [c1]Hugo Gimbert, Youssouf Oualhadj:
Probabilistic Automata on Finite Words: Decidable and Undecidable Problems. ICALP (2) 2010: 527-538
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2021-04-08 11:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
