| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 7650366 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
scientific article; zbMATH DE number 7561608 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| Analysis of probabilistic processes and automata theory | 2021-11-12 | Paper |
Qualitative multi-objective reachability for ordered branching MDPs
(available as arXiv preprint) | 2021-07-06 | Paper |
The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game
Games and Economic Behavior | 2021-02-23 | Paper |
Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations
Mathematics of Operations Research | 2020-04-30 | Paper |
Recursive stochastic games with positive rewards
Theoretical Computer Science | 2019-06-18 | Paper |
Upper bounds for Newton's method on monotone polynomial systems, and P-time model checking of probabilistic one-counter automata
Journal of the ACM | 2018-08-02 | Paper |
Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes
Information and Computation | 2018-06-14 | Paper |
A polynomial time algorithm for computing extinction probabilities of multitype branching processes
SIAM Journal on Computing | 2017-10-06 | Paper |
A note on a question of Peled and Wilke regarding stutter-invariant LTL
Information Processing Letters | 2016-06-16 | Paper |
Recursive Markov decision processes and recursive stochastic games
Journal of the ACM | 2016-03-24 | Paper |
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Journal of the ACM | 2015-11-11 | Paper |
Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes
Lecture Notes in Computer Science | 2015-11-04 | Paper |
Model checking of recursive probabilistic systems
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing
ACM Transactions on Computation Theory | 2015-09-03 | Paper |
The complexity of approximating a trembling hand perfect equilibrium of a multi-player game in strategic form
Algorithmic Game Theory | 2015-01-14 | Paper |
| One-counter Markov decision processes | 2014-05-22 | Paper |
Polynomial time algorithms for multi-type branching processes and stochastic context-free grammars
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations
Automata, Languages, and Programming | 2013-08-12 | Paper |
Stochastic context-free grammars, regular languages, and newton's method
Automata, Languages, and Programming | 2013-08-07 | Paper |
Approximating the termination value of one-counter MDPs and stochastic games
Information and Computation | 2013-06-06 | Paper |
| One-counter stochastic games | 2012-08-29 | Paper |
One-counter stochastic games
(available as arXiv preprint) | 2012-08-29 | Paper |
Approximating the termination value of one-counter MDPs and stochastic games
Automata, Languages and Programming | 2011-07-07 | Paper |
On the Complexity of Nash Equilibria and Other Fixed Points
SIAM Journal on Computing | 2011-01-17 | Paper |
CONCUR 2003 - Concurrency Theory
Lecture Notes in Computer Science | 2010-03-30 | Paper |
Verification, Model Checking, and Abstract Interpretation
Lecture Notes in Computer Science | 2009-05-15 | Paper |
Recursive Concurrent Stochastic Games
Logical Methods in Computer Science | 2009-04-29 | Paper |
Multi-Objective Model Checking of Markov Decision Processes
Logical Methods in Computer Science | 2009-04-29 | Paper |
First-Order and Temporal Logics for Nested Words
Logical Methods in Computer Science | 2009-04-29 | Paper |
An Abort-Aware Model of Transactional Programming
Lecture Notes in Computer Science | 2009-02-10 | Paper |
Parametric temporal logic for “model measuring”
ACM Transactions on Computational Logic | 2008-12-21 | Paper |
Recursive Stochastic Games with Positive Rewards
Automata, Languages and Programming | 2008-08-28 | Paper |
The computational complexity of evolutionarily stable strategies
International Journal of Game Theory | 2008-05-26 | Paper |
Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games
STACS 2006 | 2008-03-19 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Recursive Concurrent Stochastic Games
Automata, Languages and Programming | 2007-09-11 | Paper |
Multi-objective Model Checking of Markov Decision Processes
Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-03 | Paper |
First-order logic with two variables and unary temporal logic
Information and Computation | 2006-10-10 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
SIAM Journal on Computing | 2005-09-16 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-12 | Paper |
Realizability and verification of MSC graphs
Theoretical Computer Science | 2005-04-06 | Paper |
| scientific article; zbMATH DE number 2102709 (Why is no real title available?) | 2004-09-24 | Paper |
| scientific article; zbMATH DE number 1927559 (Why is no real title available?) | 2003-06-12 | Paper |
Tree canonization and transitive closure
Information and Computation | 2003-01-14 | Paper |
An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1759609 (Why is no real title available?) | 2002-11-28 | Paper |
| scientific article; zbMATH DE number 1796135 (Why is no real title available?) | 2002-09-04 | Paper |
| scientific article; zbMATH DE number 1754630 (Why is no real title available?) | 2002-06-12 | Paper |
| scientific article; zbMATH DE number 1754635 (Why is no real title available?) | 2002-06-12 | Paper |
| scientific article; zbMATH DE number 1405643 (Why is no real title available?) | 2000-04-25 | Paper |
| scientific article; zbMATH DE number 1414308 (Why is no real title available?) | 2000-03-16 | Paper |
Reachability and the power of local ordering
Theoretical Computer Science | 1997-09-29 | Paper |
Counting quantifiers, successor relations, and logarithmic space
Journal of Computer and System Sciences | 1997-01-01 | Paper |
