Stefan Kiefer - RankMe

171 papers A* 22A 9B 20C 2Journal 95Unranked 21

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	The Asymptotic Size of Finite Irreducible Semigroups of Rational Matrices. STACS Stefan Kiefer, Andrew Ryzhikov
2026	J	`jnl`	The asymptotic size of finite irreducible semigroups of rational matrices. CoRR Stefan Kiefer, Andrew Ryzhikov
2026	J	`jnl`	The complexity of computing the period and the exponent of a digraph. Inf. Process. Lett. Stefan Kiefer, Andrew Ryzhikov
2025	A	`conf`	Efficiently Computing the Minimum Rank of a Matrix in a Monoid of Zero-One Matrices. STACS Stefan Kiefer, Andrew Ryzhikov
2025	—	`conf`	Robust Probabilistic Bisimilarity for Labelled Markov Chains. CAV (2) Syyeda Zainab Fatmi, Stefan Kiefer, David Parker, Franck van Breugel
2025	J	`jnl`	Robust Probabilistic Bisimilarity for Labelled Markov Chains. CoRR Syyeda Zainab Fatmi, Stefan Kiefer, David Parker, Franck van Breugel
2025	J	`jnl`	Spectral and combinatorial methods for efficiently computing the rank of unambiguous finite automata. CoRR Stefan Kiefer, Andrew Ryzhikov
2025	A*	`conf`	Strategy Complexity of Büchi and Transience Objectives in Concurrent Stochastic Games. EC Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2025	J	`jnl`	Strategy Complexity of Reachability in Countable Stochastic 2-Player Games. Dyn. Games Appl. Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2025	B	`conf`	The Complexity of Reachability Problems in Strongly Connected Finite Automata. MFCS Stefan Kiefer, Andrew Ryzhikov
2025	J	`jnl`	The complexity of reachability problems in strongly connected finite automata. CoRR Stefan Kiefer, Andrew Ryzhikov
2024	—	`conf`	Memoryless Strategies in Stochastic Reachability Games. Taming the Infinities of Concurrency Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2024	J	`jnl`	Memoryless Strategies in Stochastic Reachability Games. CoRR Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2024	B	`conf`	Minimising the Probabilistic Bisimilarity Distance. CONCUR Stefan Kiefer, Qiyi Tang
2024	J	`jnl`	Minimising the Probabilistic Bisimilarity Distance. CoRR Stefan Kiefer, Qiyi Tang
2024	J	`jnl`	Strategy Complexity of B\"uchi Objectives in Concurrent Stochastic Games. CoRR Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2024	—	`ed.`	Taming the Infinities of Concurrency - Essays Dedicated to Javier Esparza on the Occasion of His 60th Birthday Taming the Infinities of Concurrency Stefan Kiefer, Jan Kretínský, Antonín Kucera
2024	J	`jnl`	The complexity of computing the period and the exponent of a digraph. CoRR Stefan Kiefer, Andrew Ryzhikov
2023	J	`jnl`	Markov chains and unambiguous automata. J. Comput. Syst. Sci. Christel Baier, Stefan Kiefer, Joachim Klein, David Müller, James Worrell
2022	A*	`conf`	Lower Bounds for Unambiguous Automata via Communication Complexity. ICALP Mika Göös, Stefan Kiefer, Weiqiang Yuan
2022	J	`jnl`	Lower Bounds for Unambiguous Automata via Communication Complexity. Electron. Colloquium Comput. Complex. Mika Göös, Stefan Kiefer, Weiqiang Yuan
2022	J	`jnl`	On complementing unambiguous automata and graphs with many cliques and cocliques. Inf. Process. Lett. Emil Indzhev, Stefan Kiefer
2022	B	`conf`	On the Sequential Probability Ratio Test in Hidden Markov Models. CONCUR Oscar Darwin, Stefan Kiefer
2022	J	`jnl`	On the Sequential Probability Ratio Test in Hidden Markov Models. CoRR Oscar Darwin, Stefan Kiefer
2022	B	`conf`	Strategies for MDP Bisimilarity Equivalence and Inequivalence. CONCUR Stefan Kiefer, Qiyi Tang
2022	J	`jnl`	Strategy Complexity of Reachability in Countable Stochastic 2-Player Games. CoRR Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2022	J	`jnl`	The Big-O Problem. Log. Methods Comput. Sci. Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser
2021	—	`conf`	Approximate Bisimulation Minimisation. FSTTCS Stefan Kiefer, Qiyi Tang
2021	J	`jnl`	Approximate Bisimulation Minimisation. CoRR Stefan Kiefer, Qiyi Tang
2021	B	`conf`	Enforcing ω-Regular Properties in Markov Chains by Restarting. CONCUR Javier Esparza, Stefan Kiefer, Jan Kretínský, Maximilian Weininger
2021	B	`ed.`	Foundations of Software Science and Computation Structures - 24th International Conference, FOSSACS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 - April 1, 2021, Proceedings FoSSaCS Stefan Kiefer, Christine Tasson
2021	—	`conf`	Image-Binary Automata. DCFS Stefan Kiefer, Cas Widdershoven
2021	J	`jnl`	Image-Binary Automata. CoRR Stefan Kiefer, Cas Widdershoven
2021	B	`conf`	Linear-Time Model Checking Branching Processes. CONCUR Stefan Kiefer, Pavel Semukhin, Cas Widdershoven
2021	J	`jnl`	Linear-Time Model Checking Branching Processes. CoRR Stefan Kiefer, Pavel Semukhin, Cas Widdershoven
2021	J	`jnl`	Lower Bounds on Unambiguous Automata Complementation and Separation via Communication Complexity. CoRR Mika Göös, Stefan Kiefer
2021	J	`jnl`	On Complementing Unambiguous Automata and Graphs With Many Cliques and Cocliques. CoRR Emil Indzhev, Stefan Kiefer
2021	J	`jnl`	On Nonnegative Integer Matrices and Short Killing Words. SIAM J. Discret. Math. Stefan Kiefer, Corto Mascle
2021	A*	`conf`	Responsibility and verification: Importance value in temporal logics. LICS Corto Mascle, Christel Baier, Florian Funke, Simon Jantsch, Stefan Kiefer
2021	J	`jnl`	Responsibility and verification: Importance value in temporal logics. CoRR Corto Mascle, Christel Baier, Florian Funke, Simon Jantsch, Stefan Kiefer
2021	J	`jnl`	Selective monitoring. J. Comput. Syst. Sci. Radu Grigore, Stefan Kiefer
2021	B	`conf`	Transience in Countable MDPs. CONCUR Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2020	—	`conf`	Comparing Labelled Markov Decision Processes. FSTTCS Stefan Kiefer, Qiyi Tang
2020	J	`jnl`	Comparing Labelled Markov Decision Processes. CoRR Stefan Kiefer, Qiyi Tang
2020	—	`conf`	Equivalence of Hidden Markov Models with Continuous Observations. FSTTCS Oscar Darwin, Stefan Kiefer
2020	J	`jnl`	Equivalence of Hidden Markov Models with Continuous Observations. CoRR Oscar Darwin, Stefan Kiefer
2020	A*	`conf`	How to Play in Infinite MDPs (Invited Talk). ICALP Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke, Dominik Wojtczak
2020	J	`jnl`	Notes on Equivalence and Minimization of Weighted Automata. CoRR Stefan Kiefer
2020	B	`conf`	On Affine Reachability Problems. MFCS Stefan Jaax, Stefan Kiefer
2020	A*	`conf`	On the Size of Finite Rational Matrix Semigroups. ICALP Georgina Bumpus, Christoph Haase, Stefan Kiefer, Paul-Ioan Stoienescu, Jonathan Tanner
2020	J	`jnl`	Online Monitoring ω-Regular Properties in Unknown Markov Chains. CoRR Javier Esparza, Stefan Kiefer, Jan Kretínský, Maximilian Weininger
2020	B	`conf`	Strategy Complexity of Parity Objectives in Countable MDPs. CONCUR Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2020	J	`jnl`	Strategy Complexity of Parity Objectives in Countable MDPs. CoRR Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2020	B	`conf`	The Big-O Problem for Labelled Markov Chains and Weighted Automata. CONCUR Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser
2020	J	`jnl`	The Big-O Problem for Labelled Markov Chains and Weighted Automata. CoRR Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, David Purser
2020	J	`jnl`	Trace Refinement in Labelled Markov Decision Processes. Log. Methods Comput. Sci. Nathanaël Fijalkow, Stefan Kiefer, Mahsa Shirmohammadi
2020	J	`jnl`	Transience in Countable MDPs. CoRR Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2019	A*	`conf`	Büchi Objectives in Countable MDPs. ICALP Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2019	J	`jnl`	Büchi Objectives in Countable MDPs. CoRR Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2019	B	`conf`	Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques. MFCS Stefan Kiefer, Cas Widdershoven
2019	J	`jnl`	Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques. CoRR Stefan Kiefer, Cas Widdershoven
2019	A	`conf`	On Finite Monoids over Nonnegative Integer Matrices and Short Killing Words. STACS Stefan Kiefer, Corto Mascle
2019	J	`jnl`	On Semigroups of Two-Dimensional Upper-Triangular Integer Matrices. CoRR Stefan Jaax, Stefan Kiefer
2019	A*	`conf`	On the Complexity of Value Iteration. ICALP Nikhil Balaji, Stefan Kiefer, Petr Novotný, Guillermo A. Pérez, Mahsa Shirmohammadi
2019	J	`jnl`	On the Size of Finite Rational Matrix Semigroups. CoRR Georgina Bumpus, Christoph Haase, Stefan Kiefer, Paul-Ioan Stoienescu, Jonathan Tanner
2018	J	`jnl`	Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata. Log. Methods Comput. Sci. Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell
2018	A*	`conf`	On Computing the Total Variation Distance of Hidden Markov Models. ICALP Stefan Kiefer
2018	J	`jnl`	On Computing the Total Variation Distance of Hidden Markov Models. CoRR Stefan Kiefer
2018	J	`jnl`	On Finite Monoids over Nonnegative Integer Matrices and Short Killing Words. CoRR Stefan Kiefer, Corto Mascle
2018	J	`jnl`	On the Complexity of Iterative Tropical Computation with Applications to Markov Decision Processes. CoRR Nikhil Balaji, Stefan Kiefer, Petr Novotný, Guillermo A. Pérez, Mahsa Shirmohammadi
2018	B	`conf`	Selective Monitoring. CONCUR Radu Grigore, Stefan Kiefer
2018	J	`jnl`	Selective Monitoring. CoRR Radu Grigore, Stefan Kiefer
2017	A*	`conf`	Computing quantiles in Markov chains with multi-dimensional costs. LICS Christoph Haase, Stefan Kiefer, Markus Lohrey
2017	B	`conf`	Counting Problems for Parikh Images. MFCS Christoph Haase, Stefan Kiefer, Markus Lohrey
2017	J	`jnl`	Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata. CoRR Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell
2017	J	`jnl`	Minimisation of Multiplicity Tree Automata. Log. Methods Comput. Sci. Stefan Kiefer, Ines Marusic, James Worrell
2017	J	`jnl`	Nonnegative Matrix Factorization Requires Irrationality. SIAM J. Appl. Algebra Geom. Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell
2017	A*	`conf`	On Rationality of Nonnegative Matrix Factorization. SODA Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell
2017	J	`jnl`	On Strong Determinacy of Countable Stochastic Games. CoRR Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak
2017	A*	`conf`	On strong determinacy of countable stochastic games. LICS Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak
2017	J	`jnl`	Parity Objectives in Countable MDPs. CoRR Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak
2017	A*	`conf`	Parity objectives in countable MDPs. LICS Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak
2016	A*	`conf`	Distinguishing Hidden Markov Chains. LICS Stefan Kiefer, A. Prasad Sistla
2016	J	`jnl`	Efficient Quantile Computation in Markov Chains via Counting Problems for Parikh Images. CoRR Christoph Haase, Stefan Kiefer, Markus Lohrey
2016	—	`conf`	Markov Chains and Unambiguous Büchi Automata. CAV (1) Christel Baier, Stefan Kiefer, Joachim Klein, Sascha Klüppelholz, David Müller, James Worrell
2016	J	`jnl`	Markov Chains and Unambiguous Büchi Automata. CoRR Christel Baier, Stefan Kiefer, Joachim Klein, Sascha Klüppelholz, David Müller, James Worrell
2016	J	`jnl`	Nonnegative Matrix Factorization Requires Irrationality. CoRR Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell
2016	A*	`conf`	On Restricted Nonnegative Matrix Factorization. ICALP Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell
2016	J	`jnl`	On Restricted Nonnegative Matrix Factorization. CoRR Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell
2016	A*	`conf`	Proving the Herman-Protocol Conjecture. ICALP Maria Bruna, Radu Grigore, Stefan Kiefer, Joël Ouaknine, James Worrell
2016	J	`jnl`	The complexity of the Kth largest subset problem and related problems. Inf. Process. Lett. Christoph Haase, Stefan Kiefer
2016	B	`conf`	Trace Refinement in Labelled Markov Decision Processes. FoSSaCS Nathanaël Fijalkow, Stefan Kiefer, Mahsa Shirmohammadi
2015	J	`jnl`	Distinguishing Hidden Markov Chains. CoRR Stefan Kiefer, A. Prasad Sistla
2015	A*	`conf`	Long-Run Average Behaviour of Probabilistic Vector Addition Systems. LICS Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný
2015	J	`jnl`	Long-Run Average Behaviour of Probabilistic Vector Addition Systems. CoRR Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný
2015	B	`conf`	Minimisation of Multiplicity Tree Automata. FoSSaCS Stefan Kiefer, Ines Marusic, James Worrell
2015	J	`jnl`	Proving the Herman-Protocol Conjecture. CoRR Maria Bruna, Radu Grigore, Stefan Kiefer, Joël Ouaknine, James Worrell
2015	J	`jnl`	Runtime analysis of probabilistic programs with unbounded recursion. J. Comput. Syst. Sci. Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Ivana Hutarová Vareková
2015	J	`jnl`	The Complexity of the Kth Largest Subset Problem and Related Problems. CoRR Christoph Haase, Stefan Kiefer
2015	—	`conf`	The Odds of Staying on Budget. ICALP (2) Christoph Haase, Stefan Kiefer
2015	J	`jnl`	Trace Refinement in Labelled Markov Decision Processes. CoRR Nathanaël Fijalkow, Stefan Kiefer, Mahsa Shirmohammadi
2015	—	`conf`	Tree Buffers. CAV (1) Radu Grigore, Stefan Kiefer
2015	J	`jnl`	Tree Buffers. CoRR Radu Grigore, Stefan Kiefer
2014	B	`conf`	Analysis of Probabilistic Basic Parallel Processes. FoSSaCS Rémi Bonnet, Stefan Kiefer, Anthony Widjaja Lin
2014	J	`jnl`	Analysis of Probabilistic Basic Parallel Processes. CoRR Rémi Bonnet, Stefan Kiefer, Anthony Widjaja Lin
2014	J	`jnl`	Efficient Analysis of Probabilistic Programs with an Unbounded Counter. J. ACM Tomás Brázdil, Stefan Kiefer, Antonín Kucera
2014	J	`jnl`	Language equivalence of probabilistic pushdown automata. Inf. Comput. Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell
2014	J	`jnl`	On the Total Variation Distance of Labelled Markov Chains. CoRR Taolue Chen, Stefan Kiefer
2014	—	`conf`	On the total variation distance of labelled Markov chains. CSL-LICS Taolue Chen, Stefan Kiefer
2014	—	`conf`	Stability and Complexity of Minimising Probabilistic Automata. ICALP (2) Stefan Kiefer, Björn Wachter
2014	J	`jnl`	Stability and Complexity of Minimising Probabilistic Automata. CoRR Stefan Kiefer, Björn Wachter
2014	J	`jnl`	The Odds of Staying on Budget. CoRR Christoph Haase, Stefan Kiefer
2014	J	`jnl`	Zero-Reachability in Probabilistic Multi-Counter Automata. CoRR Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný, Joost-Pieter Katoen
2014	—	`conf`	Zero-reachability in probabilistic multi-counter automata. CSL-LICS Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný, Joost-Pieter Katoen
2013	J	`jnl`	A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars. Inf. Process. Lett. Javier Esparza, Andreas Gaiser, Stefan Kiefer
2013	J	`jnl`	Algorithmic probabilistic game semantics - Playing games with automata. Formal Methods Syst. Des. Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell
2013	J	`jnl`	Analyzing probabilistic pushdown automata. Formal Methods Syst. Des. Tomás Brázdil, Javier Esparza, Stefan Kiefer, Antonín Kucera
2013	J	`jnl`	BPA bisimilarity is EXPTIME-hard. Inf. Process. Lett. Stefan Kiefer
2013	A*	`conf`	Bisimilarity of Pushdown Automata is Nonelementary. LICS Michael Benedikt, Stefan Göller, Stefan Kiefer, Andrzej S. Murawski
2013	J	`jnl`	On the Complexity of Equivalence and Minimisation for Q-weighted Automata Log. Methods Comput. Sci. Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell
2012	A*	`conf`	APEX: An Analyzer for Open Probabilistic Programs. CAV Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell
2012	J	`jnl`	BPA Bisimilarity is EXPTIME-hard CoRR Stefan Kiefer
2012	J	`jnl`	Bisimilarity of Probabilistic Pushdown Automata CoRR Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell
2012	—	`conf`	Bisimilarity of Probabilistic Pushdown Automata. FSTTCS Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell
2012	J	`jnl`	Bisimilarity of Pushdown Systems is Nonelementary CoRR Michael Benedikt, Stefan Göller, Stefan Kiefer, Andrzej S. Murawski
2012	J	`jnl`	Model Checking Stochastic Branching Processes CoRR Taolue Chen, Klaus Dräger, Stefan Kiefer
2012	B	`conf`	Model Checking Stochastic Branching Processes. MFCS Taolue Chen, Klaus Dräger, Stefan Kiefer
2012	B	`conf`	On the Complexity of the Equivalence Problem for Probabilistic Automata. FoSSaCS Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell
2012	J	`jnl`	Proving Termination of Probabilistic Programs Using Patterns CoRR Javier Esparza, Andreas Gaiser, Stefan Kiefer
2012	A*	`conf`	Proving Termination of Probabilistic Programs Using Patterns. CAV Javier Esparza, Andreas Gaiser, Stefan Kiefer
2012	J	`jnl`	Space-efficient scheduling of stochastically generated tasks. Inf. Comput. Tomás Brázdil, Javier Esparza, Stefan Kiefer, Michael Luttenberger
2012	A	`conf`	Stabilization of Branching Queueing Networks. STACS Tomás Brázdil, Stefan Kiefer
2012	J	`jnl`	Three tokens in Herman's algorithm. Formal Aspects Comput. Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell
2011	J	`jnl`	Derivation tree analysis for accelerated fixed-point computation. Theor. Comput. Sci. Javier Esparza, Stefan Kiefer, Michael Luttenberger
2011	J	`jnl`	Efficient Analysis of Probabilistic Programs with an Unbounded Counter CoRR Tomás Brázdil, Stefan Kiefer, Antonín Kucera
2011	A*	`conf`	Efficient Analysis of Probabilistic Programs with an Unbounded Counter. CAV Tomás Brázdil, Stefan Kiefer, Antonín Kucera
2011	A*	`conf`	Language Equivalence for Probabilistic Automata. CAV Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell
2011	A	`conf`	On Probabilistic Parallel Programs with Process Creation and Synchronisation. TACAS Stefan Kiefer, Dominik Wojtczak
2011	J	`jnl`	On Stabilization in Herman's Algorithm CoRR Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang
2011	—	`conf`	On Stabilization in Herman's Algorithm. ICALP (2) Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang
2011	J	`jnl`	On the Complexity of the Equivalence Problem for Probabilistic Automata CoRR Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell
2011	J	`jnl`	Parikhʼs theorem: A simple and direct automaton construction. Inf. Process. Lett. Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger
2011	—	`conf`	Runtime Analysis of Probabilistic Programs with Unbounded Recursion. ICALP (2) Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Ivana Hutarová Vareková
2011	J	`jnl`	Stabilization of Branching Queueing Networks CoRR Tomás Brázdil, Stefan Kiefer
2010	A	`conf`	Computing Least Fixed Points of Probabilistic Systems of Polynomials. STACS Javier Esparza, Andreas Gaiser, Stefan Kiefer
2010	J	`jnl`	Computing the Least Fixed Point of Positive Polynomial Systems CoRR Javier Esparza, Stefan Kiefer, Michael Luttenberger
2010	J	`jnl`	Computing the Least Fixed Point of Positive Polynomial Systems. SIAM J. Comput. Javier Esparza, Stefan Kiefer, Michael Luttenberger
2010	J	`jnl`	Newtonian program analysis. J. ACM Javier Esparza, Stefan Kiefer, Michael Luttenberger
2010	J	`jnl`	On Probabilistic Parallel Programs with Process Creation and Synchronisation CoRR Stefan Kiefer, Dominik Wojtczak
2010	J	`jnl`	Parikh's Theorem: A simple and direct construction CoRR Javier Esparza, Pierre Ganty, Stefan Kiefer, Michael Luttenberger
2010	J	`jnl`	Runtime Analysis of Probabilistic Programs with Unbounded Recursion CoRR Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Ivana Hutarová Vareková
2010	—	`—`	Solving Systems of Positive Polynomial Equations (Lösung positiver polynomieller Gleichungssysteme) Stefan Kiefer
2010	—	`conf`	Space-Efficient Scheduling of Stochastically Generated Tasks. ICALP (2) Tomás Brázdil, Javier Esparza, Stefan Kiefer, Michael Luttenberger
2010	J	`jnl`	Space-efficient scheduling of stochastically generated tasks CoRR Tomás Brázdil, Javier Esparza, Stefan Kiefer, Michael Luttenberger
2009	J	`jnl`	Computing Least Fixed Points of Probabilistic Systems of Polynomials CoRR Javier Esparza, Andreas Gaiser, Stefan Kiefer
2009	J	`jnl`	Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains CoRR Morten Kühnrich, Stefan Schwoon, Jirí Srba, Stefan Kiefer
2009	B	`conf`	Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains. FoSSaCS Morten Kühnrich, Stefan Schwoon, Jirí Srba, Stefan Kiefer
2009	J	`jnl`	On least fixed points of systems of positive polynomials. ACM Commun. Comput. Algebra Javier Esparza, Andreas Gaiser, Stefan Kiefer
2009	—	`conf`	On the Memory Consumption of Probabilistic Pushdown Automata. FSTTCS Tomás Brázdil, Javier Esparza, Stefan Kiefer
2009	—	`conf`	Solving Fixed-Point Equations on omega-Continuous Semirings. FICS Javier Esparza, Stefan Kiefer, Michael Luttenberger
2008	J	`jnl`	Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems. J. Satisf. Boolean Model. Comput. Javier Esparza, Stefan Kiefer, Stefan Schwoon
2008	—	`conf`	Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations. ICALP (1) Javier Esparza, Thomas Gawlitza, Stefan Kiefer, Helmut Seidl
2008	J	`jnl`	Convergence Thresholds of Newton's Method for Monotone Polynomial Equations CoRR Javier Esparza, Stefan Kiefer, Michael Luttenberger
2008	A	`conf`	Convergence Thresholds of Newton's Method for Monotone Polynomial Equations. STACS Javier Esparza, Stefan Kiefer, Michael Luttenberger
2008	C	`conf`	Derivation Tree Analysis for Accelerated Fixed-Point Computation. Developments in Language Theory Javier Esparza, Stefan Kiefer, Michael Luttenberger
2008	—	`conf`	Newton's Method for omega-Continuous Semirings. ICALP (2) Javier Esparza, Stefan Kiefer, Michael Luttenberger
2008	—	`conf`	Solving Monotone Polynomial Equations. IFIP TCS Javier Esparza, Stefan Kiefer, Michael Luttenberger
2007	C	`conf`	An Extension of Newton's Method to Developments in Language Theory Javier Esparza, Stefan Kiefer, Michael Luttenberger
2007	A	`conf`	On Fixed Point Equations over Commutative Semirings. STACS Javier Esparza, Stefan Kiefer, Michael Luttenberger
2007	A*	`conf`	On the convergence of Newton's method for monotone systems of polynomial equations. STOC Stefan Kiefer, Michael Luttenberger, Javier Esparza
2006	A	`conf`	Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems. TACAS Javier Esparza, Stefan Kiefer, Stefan Schwoon