Stefan Kiefer | DeepAI

AI Chat

Featured Co-authors

James Worrell
37 publications
Guillermo A. Perez
32 publications
Christel Baier
32 publications
Petr Novotný
23 publications
Mika Göös
14 publications
Mahsa Shirmohammadi
14 publications
Patrick Totzke
12 publications
David Purser
12 publications
Dmitry Chistikov
11 publications
Florian Funke
11 publications
Simon Jantsch
11 publications

∙ 07/28/2022

On the Sequential Probability Ratio Test in Hidden Markov Models

We consider the Sequential Probability Ratio Test applied to Hidden Mark...

0 Oscar Darwin, et al. ∙

∙ 03/22/2022

Strategy Complexity of Reachability in Countable Stochastic 2-Player Games

We study countably infinite stochastic 2-player games with reachability ...

0 Stefan Kiefer, et al. ∙

∙ 10/01/2021

Approximate Bisimulation Minimisation

We propose polynomial-time algorithms to minimise labelled Markov chains...

0 Stefan Kiefer, et al. ∙

∙ 09/19/2021

Lower Bounds on Unambiguous Automata Complementation and Separation via Communication Complexity

We use results from communication complexity, both new and old ones, to ...

0 Mika Göös, et al. ∙

∙ 07/04/2021

Linear-Time Model Checking Branching Processes

(Multi-type) branching processes are a natural and well-studied model fo...

0 Stefan Kiefer, et al. ∙

∙ 02/12/2021

Responsibility and verification: Importance value in temporal logics

We aim at measuring the influence of the nondeterministic choices of a p...

0 Corto Mascle, et al. ∙

∙ 12/26/2020

Transience in Countable MDPs

The Transience objective is not to visit any state infinitely often. Whi...

0 Stefan Kiefer, et al. ∙

∙ 09/27/2020

Equivalence of Hidden Markov Models with Continuous Observations

We consider Hidden Markov Models that emit sequences of observations tha...

0 Oscar Darwin, et al. ∙

∙ 07/15/2020

The Big-O Problem for Labelled Markov Chains and Weighted Automata

Given two weighted automata, we consider the problem of whether one is b...

0 Dmitry Chistikov, et al. ∙

∙ 07/07/2020

Strategy Complexity of Parity Objectives in Countable MDPs

We study countably infinite MDPs with parity objectives. Unlike in finit...

0 Stefan Kiefer, et al. ∙

∙ 05/13/2019

On Semigroups of Two-Dimensional Upper-Triangular Integer Matrices

We analyze algorithmic problems in finitely generated semigroups of two-...

0 Stefan Jaax, et al. ∙

∙ 07/13/2018

On the Complexity of Value Iteration

Value iteration is a fundamental algorithm for solving Markov Decision P...

0 Nikhil Balaji, et al. ∙

∙ 07/13/2018

On the Complexity of Iterative Tropical Computation with Applications to Markov Decision Processes

We study the complexity of evaluating powered functions implemented by s...

0 Nikhil Balaji, et al. ∙

∙ 06/15/2018

Selective Monitoring

We study selective monitors for labelled Markov chains. Monitors observe...

0 Radu Grigore, et al. ∙

∙ 04/17/2018

On Computing the Total Variation Distance of Hidden Markov Models

We prove results on the decidability and complexity of computing the tot...

0 Stefan Kiefer, et al. ∙

∙ 11/16/2017

Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata

We study the bisimilarity problem for probabilistic pushdown automata (p...

0 Vojtech Forejt, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world