We stand with Ukraine  

Michael Ummels

According to our database1, Michael Ummels authored at least 16 papers between 2006 and 2015.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
Pure Nash Equilibria in Concurrent Deterministic Games.
[BibTeX]
[DOI]
Patricia Bouyer
,
Romain Brenguier
,
Nicolas Markey
,
Michael Ummels
Log. Methods Comput. Sci., 2015

2013
Computing Quantiles in Markov Reward Models.
[BibTeX]
[DOI]
Michael Ummels
,
Christel Baier
Proceedings of the Foundations of Software Science and Computation Structures, 2013

2012
The Complexity of Quantitative Information Flow in Recursive Programs.
[BibTeX]
[DOI]
Rohit Chadha
,
Michael Ummels
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Concurrent Games with Ordered Objectives.
[BibTeX]
[DOI]
Patricia Bouyer
,
Romain Brenguier
,
Nicolas Markey
,
Michael Ummels
Proceedings of the Foundations of Software Science and Computational Structures, 2012

Playing Stochastic Games Precisely.
[BibTeX]
[DOI]
Taolue Chen
,
Vojtech Forejt
,
Marta Z. Kwiatkowska
,
Aistis Simaitis
,
Ashutosh Trivedi
,
Michael Ummels
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011
Stochastic multiplayer games: theory and algorithms.
[BibTeX]
[DOI]
Michael Ummels
PhD thesis, 2011

The Complexity of Nash Equilibria in Stochastic Multiplayer Games
[BibTeX]
[DOI]
Michael Ummels
,
Dominik Wojtczak
Log. Methods Comput. Sci., 2011

Nash Equilibria in Concurrent Games with Büchi Objectives.
[BibTeX]
[DOI]
Patricia Bouyer
,
Romain Brenguier
,
Nicolas Markey
,
Michael Ummels
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

The Complexity of Nash Equilibria in Limit-Average Games.
[BibTeX]
[DOI]
Michael Ummels
,
Dominik Wojtczak
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited.
[BibTeX]
[DOI]
Patricia Bouyer
,
Nicolas Markey
,
Jörg Olschewski
,
Michael Ummels
Proceedings of the Automated Technology for Verification and Analysis, 2011

2010
The Complexity of Finding Reset Words in Finite Automata.
[BibTeX]
[DOI]
Jörg Olschewski
,
Michael Ummels
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009
DFG Research Training Group "Algorithmic Synthesis of Reactive and Discrete-Continuous Systems (AlgoSyn)" (DFG-Graduiertenkolleg "Algorithmische Synthese reaktiver und diskret-kontinuierlicher Systeme (AlgoSyn)").
[BibTeX]
[DOI]
Wolfgang Thomas
,
Kai Bollue
,
Dominique Gückel
,
Gustavo Quiros
,
Michaela Slaats
,
Michael Ummels
it Inf. Technol., 2009

The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games.
[BibTeX]
[DOI]
Michael Ummels
,
Dominik Wojtczak
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

Decision Problems for Nash Equilibria in Stochastic Games.
[BibTeX]
[DOI]
Michael Ummels
,
Dominik Wojtczak
Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

2008
The Complexity of Nash Equilibria in Infinite Multiplayer Games.
[BibTeX]
[DOI]
Michael Ummels
Proceedings of the Foundations of Software Science and Computational Structures, 2008

2006
Rational Behaviour and Strategy Construction in Infinite Multiplayer Games.
[BibTeX]
[DOI]
Michael Ummels
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006


  Loading...