No. |
Title |
Author |
Year |
---|

1 |
Lower Bounds for Unambiguous Automata via Communication Complexity |
Göös, Mika et al. |
2022 |

2 |
On the Sequential Probability Ratio Test in Hidden Markov Models |
Darwin, Oscar et al. |
2022 |

3 |
Strategies for MDP Bisimilarity Equivalence and Inequivalence |
Kiefer, Stefan et al. |
2022 |

4 |
Approximate Bisimulation Minimisation |
Kiefer, Stefan et al. |
2021 |

5 |
Enforcing ω-Regular Properties in Markov Chains by Restarting |
Esparza, Javier et al. |
2021 |

6 |
Linear-Time Model Checking Branching Processes |
Kiefer, Stefan et al. |
2021 |

7 |
Transience in Countable MDPs |
Kiefer, Stefan et al. |
2021 |

8 |
Comparing Labelled Markov Decision Processes |
Kiefer, Stefan et al. |
2020 |

9 |
Equivalence of Hidden Markov Models with Continuous Observations |
Darwin, Oscar et al. |
2020 |

10 |
How to Play in Infinite MDPs (Invited Talk) |
Kiefer, Stefan et al. |
2020 |

11 |
On Affine Reachability Problems |
Jaax, Stefan et al. |
2020 |

12 |
On the Size of Finite Rational Matrix Semigroups |
Bumpus, Georgina et al. |
2020 |

13 |
Strategy Complexity of Parity Objectives in Countable MDPs |
Kiefer, Stefan et al. |
2020 |

14 |
The Big-O Problem for Labelled Markov Chains and Weighted Automata |
Chistikov, Dmitry et al. |
2020 |

15 |
Büchi Objectives in Countable MDPs |
Kiefer, Stefan et al. |
2019 |

16 |
Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques |
Kiefer, Stefan et al. |
2019 |

17 |
On Finite Monoids over Nonnegative Integer Matrices and Short Killing Words |
Kiefer, Stefan et al. |
2019 |

18 |
On the Complexity of Value Iteration |
Balaji, Nikhil et al. |
2019 |

19 |
On Computing the Total Variation Distance of Hidden Markov Models |
Kiefer, Stefan |
2018 |

20 |
Selective Monitoring |
Grigore, Radu et al. |
2018 |

21 |
Counting Problems for Parikh Images |
Haase, Christoph et al. |
2017 |

22 |
On Restricted Nonnegative Matrix Factorization |
Chistikov, Dmitry et al. |
2016 |

23 |
Proving the Herman-Protocol Conjecture |
Bruna, Maria et al. |
2016 |

24 |
Bisimilarity of Probabilistic Pushdown Automata |
Forejt, Vojtech et al. |
2012 |

25 |
Stabilization of Branching Queueing Networks |
Brázdil, Tomáš et al. |
2012 |

26 |
Computing Least Fixed Points of Probabilistic Systems of Polynomials |
Esparza, Javier et al. |
2010 |

27 |
On the Memory Consumption of Probabilistic Pushdown Automata |
Brazdil, Tomas et al. |
2009 |

28 |
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations |
Esparza, Javier et al. |
2008 |