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 
Other 

Links

On csauthors.net:

Bibliography

2015
Pure Nash Equilibria in Concurrent Deterministic Games.
Logical Methods in Computer Science, 2015

2013
Computing Quantiles in Markov Reward Models.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

2012
The Complexity of Quantitative Information Flow in Recursive Programs.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Concurrent Games with Ordered Objectives.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

Playing Stochastic Games Precisely.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011
Stochastic multiplayer games: theory and algorithms.
PhD thesis, 2011

The Complexity of Nash Equilibria in Stochastic Multiplayer Games
Logical Methods in Computer Science, 2011

Nash Equilibria in Concurrent Games with Büchi Objectives.
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.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited.
Proceedings of the Automated Technology for Verification and Analysis, 2011

2010
The Complexity of Finding Reset Words in Finite Automata.
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)").
it - Information Technology, 2009

The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

Decision Problems for Nash Equilibria in Stochastic Games.
Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

2008
The Complexity of Nash Equilibria in Infinite Multiplayer Games.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

2006
Rational Behaviour and Strategy Construction in Infinite Multiplayer Games.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006


  Loading...