default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Ummels
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j3]Patricia Bouyer, Romain Brenguier, Nicolas Markey
, Michael Ummels:
Pure Nash Equilibria in Concurrent Deterministic Games. Log. Methods Comput. Sci. 11(2) (2015)- 2013
- [c12]Michael Ummels, Christel Baier:
Computing Quantiles in Markov Reward Models. FoSSaCS 2013: 353-368 - [i6]Michael Ummels, Christel Baier:
Computing Quantiles in Markov Reward Models. CoRR abs/1301.1818 (2013) - 2012
- [c11]Taolue Chen, Vojtech Forejt, Marta Z. Kwiatkowska, Aistis Simaitis, Ashutosh Trivedi, Michael Ummels:
Playing Stochastic Games Precisely. CONCUR 2012: 348-363 - [c10]Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels:
Concurrent Games with Ordered Objectives. FoSSaCS 2012: 301-315 - [c9]Rohit Chadha, Michael Ummels:
The Complexity of Quantitative Information Flow in Recursive Programs. FSTTCS 2012: 534-545 - 2011
- [b1]Michael Ummels:
Stochastic multiplayer games: theory and algorithms. RWTH Aachen University, 2011 - [j2]Michael Ummels, Dominik Wojtczak:
The Complexity of Nash Equilibria in Stochastic Multiplayer Games. Log. Methods Comput. Sci. 7(3) (2011) - [c8]Patricia Bouyer, Nicolas Markey, Jörg Olschewski, Michael Ummels:
Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited. ATVA 2011: 135-149 - [c7]Michael Ummels, Dominik Wojtczak:
The Complexity of Nash Equilibria in Limit-Average Games. CONCUR 2011: 482-496 - [c6]Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels:
Nash Equilibria in Concurrent Games with Büchi Objectives. FSTTCS 2011: 375-386 - [i5]Patricia Bouyer, Nicolas Markey, Jörg Olschewski, Michael Ummels:
Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited. CoRR abs/1102.3615 (2011) - [i4]Michael Ummels, Dominik Wojtczak:
The Complexity of Nash Equilibria in Limit-Average Games. CoRR abs/1109.6220 (2011) - 2010
- [c5]Jörg Olschewski, Michael Ummels:
The Complexity of Finding Reset Words in Finite Automata. MFCS 2010: 568-579 - [i3]Jörg Olschewski, Michael Ummels:
The Complexity of Finding Reset Words in Finite Automata. CoRR abs/1004.3246 (2010)
2000 – 2009
- 2009
- [j1]Wolfgang Thomas, Kai Bollue, Dominique Gückel, Gustavo Quiros, Michaela Slaats, Michael Ummels:
DFG Research Training Group "Algorithmic Synthesis of Reactive and Discrete-Continuous Systems (AlgoSyn)" (DFG-Graduiertenkolleg "Algorithmische Synthese reaktiver und diskret-kontinuierlicher Systeme (AlgoSyn)"). it Inf. Technol. 51(4): 222-230 (2009) - [c4]Michael Ummels, Dominik Wojtczak:
Decision Problems for Nash Equilibria in Stochastic Games. CSL 2009: 515-529 - [c3]Michael Ummels, Dominik Wojtczak:
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games. ICALP (2) 2009: 297-308 - [i2]Michael Ummels, Dominik Wojtczak:
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games. CoRR abs/0902.0101 (2009) - [i1]Michael Ummels, Dominik Wojtczak:
Decision Problems for Nash Equilibria in Stochastic Games. CoRR abs/0904.3325 (2009) - 2008
- [c2]Michael Ummels:
The Complexity of Nash Equilibria in Infinite Multiplayer Games. FoSSaCS 2008: 20-34 - 2006
- [c1]Michael Ummels:
Rational Behaviour and Strategy Construction in Infinite Multiplayer Games. FSTTCS 2006: 212-223
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-04 00:31 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:
