| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5875712 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091277 | 2022-07-21 | Paper |
| Analysis of probabilistic processes and automata theory | 2021-11-12 | Paper |
| Qualitative multi-objective reachability for ordered branching MDPs | 2021-07-06 | Paper |
| The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game | 2021-02-23 | Paper |
| Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations | 2020-04-30 | Paper |
| Recursive stochastic games with positive rewards | 2019-06-18 | Paper |
| Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata | 2018-08-02 | Paper |
| Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes | 2018-06-14 | Paper |
| A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes | 2017-10-06 | Paper |
| A note on a question of Peled and Wilke regarding stutter-invariant LTL | 2016-06-16 | Paper |
| Recursive Markov Decision Processes and Recursive Stochastic Games | 2016-03-24 | Paper |
| Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations | 2015-11-11 | Paper |
| Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes | 2015-11-04 | Paper |
| Model Checking of Recursive Probabilistic Systems | 2015-09-17 | Paper |
| A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing | 2015-09-03 | Paper |
| The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form | 2015-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417673 | 2014-05-22 | Paper |
| Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars | 2014-05-13 | Paper |
| Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations | 2013-08-12 | Paper |
| Stochastic Context-Free Grammars, Regular Languages, and Newton’s Method | 2013-08-07 | Paper |
| Approximating the termination value of one-counter MDPs and stochastic games | 2013-06-06 | Paper |
| One-Counter Stochastic Games | 2012-08-29 | Paper |
| Approximating the Termination Value of One-Counter MDPs and Stochastic Games | 2011-07-07 | Paper |
| On the Complexity of Nash Equilibria and Other Fixed Points | 2011-01-17 | Paper |
| CONCUR 2003 - Concurrency Theory | 2010-03-30 | Paper |
| Verification, Model Checking, and Abstract Interpretation | 2009-05-15 | Paper |
| Multi-Objective Model Checking of Markov Decision Processes | 2009-04-29 | Paper |
| First-Order and Temporal Logics for Nested Words | 2009-04-29 | Paper |
| Recursive Concurrent Stochastic Games | 2009-04-29 | Paper |
| An Abort-Aware Model of Transactional Programming | 2009-02-10 | Paper |
| Parametric temporal logic for “model measuring” | 2008-12-21 | Paper |
| Recursive Stochastic Games with Positive Rewards | 2008-08-28 | Paper |
| The computational complexity of evolutionarily stable strategies | 2008-05-26 | Paper |
| Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games | 2008-03-19 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-28 | Paper |
| Recursive Concurrent Stochastic Games | 2007-09-11 | Paper |
| Multi-objective Model Checking of Markov Decision Processes | 2007-09-03 | Paper |
| First-order logic with two variables and unary temporal logic | 2006-10-10 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2005-11-10 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2005-11-10 | Paper |
| Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata | 2005-09-16 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| Realizability and verification of MSC graphs | 2005-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4817547 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4484483 | 2003-06-12 | Paper |
| Tree canonization and transitive closure | 2003-01-14 | Paper |
| An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536600 | 2002-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551151 | 2002-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535058 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535063 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938622 | 2000-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942645 | 2000-03-16 | Paper |
| Reachability and the power of local ordering | 1997-09-29 | Paper |
| Counting quantifiers, successor relations, and logarithmic space | 1997-01-01 | Paper |
