No. Title Author Year
1 How to Play in Infinite MDPs (Invited Talk) Kiefer, Stefan et al. 2020
2 On Affine Reachability Problems Jaax, Stefan et al. 2020
3 On the Size of Finite Rational Matrix Semigroups Bumpus, Georgina et al. 2020
4 Strategy Complexity of Parity Objectives in Countable MDPs Kiefer, Stefan et al. 2020
5 The Big-O Problem for Labelled Markov Chains and Weighted Automata Chistikov, Dmitry et al. 2020
6 Büchi Objectives in Countable MDPs Kiefer, Stefan et al. 2019
7 Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques Kiefer, Stefan et al. 2019
8 On Finite Monoids over Nonnegative Integer Matrices and Short Killing Words Kiefer, Stefan et al. 2019
9 On the Complexity of Value Iteration Balaji, Nikhil et al. 2019
10 On Computing the Total Variation Distance of Hidden Markov Models Kiefer, Stefan 2018
11 Selective Monitoring Grigore, Radu et al. 2018
12 Counting Problems for Parikh Images Haase, Christoph et al. 2017
13 On Restricted Nonnegative Matrix Factorization Chistikov, Dmitry et al. 2016
14 Proving the Herman-Protocol Conjecture Bruna, Maria et al. 2016
15 Bisimilarity of Probabilistic Pushdown Automata Forejt, Vojtech et al. 2012
16 Stabilization of Branching Queueing Networks Brázdil, Tomáš et al. 2012
17 Computing Least Fixed Points of Probabilistic Systems of Polynomials Esparza, Javier et al. 2010
18 On the Memory Consumption of Probabilistic Pushdown Automata Brazdil, Tomas et al. 2009
19 Convergence Thresholds of Newton's Method for Monotone Polynomial Equations Esparza, Javier et al. 2008
Current Page :
Number of result pages: 1
Number of documents: 19


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI