An Extension of Newton's Method to omega -Continuous Semirings. - Javier Esparza; Stefan Kiefer; Michael Luttenberger (Developments in Language Theory, 2007)

On Fixed Point Equations over Commutative Semirings. - Javier Esparza; Stefan Kiefer; Michael Luttenberger (STACS, 2007)

On the convergence of Newton's method for monotone systems of polynomial equations. - Stefan Kiefer; Michael Luttenberger; Javier Esparza (STOC, 2007)

Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations. - Javier Esparza; Thomas Gawlitza; Stefan Kiefer; Helmut Seidl (ICALP (1), 2008)

Newton's Method for omega-Continuous Semirings. - Javier Esparza; Stefan Kiefer; Michael Luttenberger (ICALP (2), 2008)

Solving Monotone Polynomial Equations. - Javier Esparza; Stefan Kiefer; Michael Luttenberger (IFIP TCS, 2008)

Convergence Thresholds of Newton's Method for Monotone Polynomial Equations. - Javier Esparza; Stefan Kiefer; Michael Luttenberger (STACS, 2008)

Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems. - Javier Esparza; Stefan Kiefer; Stefan Schwoon (J. Satisf. Boolean Model. Comput., 2008)

Solving Fixed-Point Equations on omega-Continuous Semirings. - Javier Esparza; Stefan Kiefer; Michael Luttenberger (FICS, 2009)

Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains. - Morten Kühnrich; Stefan Schwoon; Jirí Srba; Stefan Kiefer (FoSSaCS, 2009)

On the Memory Consumption of Probabilistic Pushdown Automata. - Tomás Brázdil; Javier Esparza; Stefan Kiefer (FSTTCS, 2009)

On least fixed points of systems of positive polynomials. - Javier Esparza; Andreas Gaiser; Stefan Kiefer (ACM Commun. Comput. Algebra, 2009)

Computing Least Fixed Points of Probabilistic Systems of Polynomials. - Javier Esparza; Andreas Gaiser; Stefan Kiefer (STACS, 2010)

Parikh's Theorem: A simple and direct construction - Javier Esparza; Pierre Ganty; Stefan Kiefer; Michael Luttenberger (CoRR, 2010)

Newtonian program analysis. - Javier Esparza; Stefan Kiefer; Michael Luttenberger (J. ACM, 2010)

Computing the Least Fixed Point of Positive Polynomial Systems. - Javier Esparza; Stefan Kiefer; Michael Luttenberger (SIAM J. Comput., 2010)

Solving Systems of Positive Polynomial Equations (Lösung positiver polynomieller Gleichungssysteme) - Stefan Kiefer (2010)

Language Equivalence for Probabilistic Automata. - Stefan Kiefer; Andrzej S. Murawski; Joël Ouaknine; Björn Wachter; James Worrell 001 (CAV, 2011)

On Stabilization in Herman's Algorithm. - Stefan Kiefer; Andrzej S. Murawski; Joël Ouaknine; James Worrell 001; Lijun Zhang 001 (ICALP (2), 2011)

On Probabilistic Parallel Programs with Process Creation and Synchronisation. - Stefan Kiefer; Dominik Wojtczak (TACAS, 2011)

Parikhʼs theorem: A simple and direct automaton construction. - Javier Esparza; Pierre Ganty; Stefan Kiefer; Michael Luttenberger (Inf. Process. Lett., 2011)

Derivation tree analysis for accelerated fixed-point computation. - Javier Esparza; Stefan Kiefer; Michael Luttenberger (Theor. Comput. Sci., 2011)

Proving Termination of Probabilistic Programs Using Patterns. - Javier Esparza; Andreas Gaiser; Stefan Kiefer (CAV, 2012)

APEX: An Analyzer for Open Probabilistic Programs. - Stefan Kiefer; Andrzej S. Murawski; Joël Ouaknine; Björn Wachter; James Worrell 001 (CAV, 2012)

On the Complexity of the Equivalence Problem for Probabilistic Automata. - Stefan Kiefer; Andrzej S. Murawski; Joël Ouaknine; Björn Wachter; James Worrell 001 (FoSSaCS, 2012)

Bisimilarity of Probabilistic Pushdown Automata. - Vojtech Forejt; Petr Jancar; Stefan Kiefer; James Worrell 001 (FSTTCS, 2012)

Model Checking Stochastic Branching Processes. - Taolue Chen 001; Klaus Dräger; Stefan Kiefer (MFCS, 2012)

Stabilization of Branching Queueing Networks. - Tomás Brázdil; Stefan Kiefer (STACS, 2012)

Bisimilarity of Pushdown Systems is Nonelementary - Michael Benedikt; Stefan Göller; Stefan Kiefer; Andrzej S. Murawski (CoRR, 2012)

Three tokens in Herman's algorithm. - Stefan Kiefer; Andrzej S. Murawski; Joël Ouaknine; Björn Wachter; James Worrell 001 (Formal Aspects Comput., 2012)

Space-efficient scheduling of stochastically generated tasks. - Tomás Brázdil; Javier Esparza; Stefan Kiefer; Michael Luttenberger (Inf. Comput., 2012)

Bisimilarity of Pushdown Automata is Nonelementary. - Michael Benedikt; Stefan Göller; Stefan Kiefer; Andrzej S. Murawski (LICS, 2013)

On the Complexity of Equivalence and Minimisation for Q-weighted Automata - Stefan Kiefer; Andrzej S. Murawski; Joël Ouaknine; Björn Wachter; James Worrell 001 (Log. Methods Comput. Sci., 2013)

Analyzing probabilistic pushdown automata. - Tomás Brázdil; Javier Esparza; Stefan Kiefer; Antonín Kucera 001 (Formal Methods Syst. Des., 2013)

Algorithmic probabilistic game semantics - Playing games with automata. - Stefan Kiefer; Andrzej S. Murawski; Joël Ouaknine; Björn Wachter; James Worrell 001 (Formal Methods Syst. Des., 2013)

A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars. - Javier Esparza; Andreas Gaiser; Stefan Kiefer (Inf. Process. Lett., 2013)

BPA bisimilarity is EXPTIME-hard. - Stefan Kiefer (Inf. Process. Lett., 2013)

Zero-reachability in probabilistic multi-counter automata. - Tomás Brázdil; Stefan Kiefer; Antonín Kucera 001; Petr Novotný 001; Joost-Pieter Katoen (CSL-LICS, 2014)

On the total variation distance of labelled Markov chains. - Taolue Chen 001; Stefan Kiefer (CSL-LICS, 2014)

Analysis of Probabilistic Basic Parallel Processes. - Rémi Bonnet; Stefan Kiefer; Anthony Widjaja Lin (FoSSaCS, 2014)

Stability and Complexity of Minimising Probabilistic Automata. - Stefan Kiefer; Björn Wachter (ICALP (2), 2014)

Language equivalence of probabilistic pushdown automata. - Vojtech Forejt; Petr Jancar; Stefan Kiefer; James Worrell 001 (Inf. Comput., 2014)

Efficient Analysis of Probabilistic Programs with an Unbounded Counter. - Tomás Brázdil; Stefan Kiefer; Antonín Kucera 001 (J. ACM, 2014)

Tree Buffers. - Radu Grigore; Stefan Kiefer (CAV (1), 2015)

The Odds of Staying on Budget. - Christoph Haase; Stefan Kiefer (ICALP (2), 2015)

Long-Run Average Behaviour of Probabilistic Vector Addition Systems. - Tomás Brázdil; Stefan Kiefer; Antonín Kucera 001; Petr Novotný 001 (LICS, 2015)

Runtime analysis of probabilistic programs with unbounded recursion. - Tomás Brázdil; Stefan Kiefer; Antonín Kucera 001; Ivana Hutarová Vareková (J. Comput. Syst. Sci., 2015)

Markov Chains and Unambiguous Büchi Automata. - Christel Baier; Stefan Kiefer; Joachim Klein 001; Sascha Klüppelholz; David Müller 001; James Worrell 001 (CAV (1), 2016)

Proving the Herman-Protocol Conjecture. - Maria Bruna; Radu Grigore; Stefan Kiefer; Joël Ouaknine; James Worrell 001 (ICALP, 2016)

On Restricted Nonnegative Matrix Factorization. - Dmitry Chistikov 001; Stefan Kiefer; Ines Marusic; Mahsa Shirmohammadi; James Worrell 001 (ICALP, 2016)

Distinguishing Hidden Markov Chains. - Stefan Kiefer; A. Prasad Sistla (LICS, 2016)

Efficient Quantile Computation in Markov Chains via Counting Problems for Parikh Images. - Christoph Haase; Stefan Kiefer; Markus Lohrey (CoRR, 2016)

The complexity of the Kth largest subset problem and related problems. - Christoph Haase; Stefan Kiefer (Inf. Process. Lett., 2016)

Computing quantiles in Markov chains with multi-dimensional costs. - Christoph Haase; Stefan Kiefer; Markus Lohrey (LICS, 2017)

Parity objectives in countable MDPs. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Dominik Wojtczak (LICS, 2017)

On strong determinacy of countable stochastic games. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Dominik Wojtczak (LICS, 2017)

Counting Problems for Parikh Images. - Christoph Haase; Stefan Kiefer; Markus Lohrey (MFCS, 2017)

On Rationality of Nonnegative Matrix Factorization. - Dmitry Chistikov 001; Stefan Kiefer; Ines Marusic; Mahsa Shirmohammadi; James Worrell 001 (SODA, 2017)

Minimisation of Multiplicity Tree Automata. - Stefan Kiefer; Ines Marusic; James Worrell 001 (Log. Methods Comput. Sci., 2017)

Nonnegative Matrix Factorization Requires Irrationality. - Dmitry Chistikov 001; Stefan Kiefer; Ines Marusic; Mahsa Shirmohammadi; James Worrell 001 (SIAM J. Appl. Algebra Geom., 2017)

On Computing the Total Variation Distance of Hidden Markov Models. - Stefan Kiefer (ICALP, 2018)

On the Complexity of Iterative Tropical Computation with Applications to Markov Decision Processes. - Nikhil Balaji; Stefan Kiefer; Petr Novotný 001; Guillermo A. Pérez 001; Mahsa Shirmohammadi (CoRR, 2018)

Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata. - Vojtech Forejt; Petr Jancar; Stefan Kiefer; James Worrell 001 (Log. Methods Comput. Sci., 2018)

On the Complexity of Value Iteration. - Nikhil Balaji; Stefan Kiefer; Petr Novotný 001; Guillermo A. Pérez 001; Mahsa Shirmohammadi (ICALP, 2019)

Büchi Objectives in Countable MDPs. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Patrick Totzke (ICALP, 2019)

Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques. - Stefan Kiefer; Cas Widdershoven (MFCS, 2019)

On Finite Monoids over Nonnegative Integer Matrices and Short Killing Words. - Stefan Kiefer; Corto Mascle (STACS, 2019)

On Semigroups of Two-Dimensional Upper-Triangular Integer Matrices. - Stefan Jaax; Stefan Kiefer (CoRR, 2019)

The Big-O Problem for Labelled Markov Chains and Weighted Automata. - Dmitry Chistikov 001; Stefan Kiefer; Andrzej S. Murawski; David Purser (CONCUR, 2020)

Strategy Complexity of Parity Objectives in Countable MDPs. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Patrick Totzke (CONCUR, 2020)

Equivalence of Hidden Markov Models with Continuous Observations. - Oscar Darwin; Stefan Kiefer (FSTTCS, 2020)

Comparing Labelled Markov Decision Processes. - Stefan Kiefer; Qiyi Tang 001 (FSTTCS, 2020)

On the Size of Finite Rational Matrix Semigroups. - Georgina Bumpus; Christoph Haase; Stefan Kiefer; Paul-Ioan Stoienescu; Jonathan Tanner (ICALP, 2020)

How to Play in Infinite MDPs (Invited Talk). - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Patrick Totzke; Dominik Wojtczak (ICALP, 2020)

On Affine Reachability Problems. - Stefan Jaax; Stefan Kiefer (MFCS, 2020)

Notes on Equivalence and Minimization of Weighted Automata. - Stefan Kiefer (CoRR, 2020)

Online Monitoring ω-Regular Properties in Unknown Markov Chains. - Javier Esparza; Stefan Kiefer; Jan Kretínský; Maximilian Weininger (CoRR, 2020)

Trace Refinement in Labelled Markov Decision Processes. - Nathanaël Fijalkow; Stefan Kiefer; Mahsa Shirmohammadi (Log. Methods Comput. Sci., 2020)

Enforcing ω-Regular Properties in Markov Chains by Restarting. - Javier Esparza; Stefan Kiefer; Jan Kretínský; Maximilian Weininger (CONCUR, 2021)

Transience in Countable MDPs. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Patrick Totzke (CONCUR, 2021)

Linear-Time Model Checking Branching Processes. - Stefan Kiefer; Pavel Semukhin; Cas Widdershoven (CONCUR, 2021)

Image-Binary Automata. - Stefan Kiefer; Cas Widdershoven (DCFS, 2021)

Approximate Bisimulation Minimisation. - Stefan Kiefer; Qiyi Tang 001 (FSTTCS, 2021)

Responsibility and verification: Importance value in temporal logics. - Corto Mascle; Christel Baier; Florian Funke 002; Simon Jantsch; Stefan Kiefer (LICS, 2021)

Lower Bounds on Unambiguous Automata Complementation and Separation via Communication Complexity. - Mika Göös; Stefan Kiefer (CoRR, 2021)

Selective monitoring. - Radu Grigore; Stefan Kiefer (J. Comput. Syst. Sci., 2021)

On Nonnegative Integer Matrices and Short Killing Words. - Stefan Kiefer; Corto Mascle (SIAM J. Discret. Math., 2021)

On the Sequential Probability Ratio Test in Hidden Markov Models. - Oscar Darwin; Stefan Kiefer (CONCUR, 2022)

Strategies for MDP Bisimilarity Equivalence and Inequivalence. - Stefan Kiefer; Qiyi Tang 001 (CONCUR, 2022)

Lower Bounds for Unambiguous Automata via Communication Complexity. - Mika Göös; Stefan Kiefer; Weiqiang Yuan 002 (Electron. Colloquium Comput. Complex., 2022)

On complementing unambiguous automata and graphs with many cliques and cocliques. - Emil Indzhev; Stefan Kiefer (Inf. Process. Lett., 2022)

The Big-O Problem. - Dmitry Chistikov 001; Stefan Kiefer; Andrzej S. Murawski; David Purser (Log. Methods Comput. Sci., 2022)

Markov chains and unambiguous automata. - Christel Baier; Stefan Kiefer; Joachim Klein 001; David Müller 001; James Worrell 001 (J. Comput. Syst. Sci., 2023)

Memoryless Strategies in Stochastic Reachability Games. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Patrick Totzke (Taming the Infinities of Concurrency, 2024)

Minimising the Probabilistic Bisimilarity Distance. - Stefan Kiefer; Qiyi Tang 001 (CONCUR, 2024)

Strategy Complexity of B "uchi Objectives in Concurrent Stochastic Games. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Patrick Totzke (CoRR, 2024)

Robust Probabilistic Bisimilarity for Labelled Markov Chains. - Syyeda Zainab Fatmi; Stefan Kiefer; David Parker 001; Franck van Breugel (CAV (2), 2025)

The Complexity of Reachability Problems in Strongly Connected Finite Automata. - Stefan Kiefer; Andrew Ryzhikov (MFCS, 2025)

Strategy Complexity of Büchi and Transience Objectives in Concurrent Stochastic Games. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Patrick Totzke (EC, 2025)

Efficiently Computing the Minimum Rank of a Matrix in a Monoid of Zero-One Matrices. - Stefan Kiefer; Andrew Ryzhikov (STACS, 2025)

Strategy Complexity of Reachability in Countable Stochastic 2-Player Games. - Stefan Kiefer; Richard Mayr; Mahsa Shirmohammadi; Patrick Totzke (Dyn. Games Appl., 2025)

The complexity of computing the period and the exponent of a digraph. - Stefan Kiefer; Andrew Ryzhikov (Inf. Process. Lett., 2026)