Stefan Kiefer

According to our database1, Stefan Kiefer authored at least 66 papers between 2006 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
On Finite Monoids over Nonnegative Integer Matrices and Short Killing Words.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

2018
Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata.
Logical Methods in Computer Science, 2018

On Computing the Total Variation Distance of Hidden Markov Models.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Selective Monitoring.
Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017
Minimisation of Multiplicity Tree Automata.
Logical Methods in Computer Science, 2017

On Rationality of Nonnegative Matrix Factorization.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Counting Problems for Parikh Images.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

On strong determinacy of countable stochastic games.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Parity objectives in countable MDPs.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Computing quantiles in Markov chains with multi-dimensional costs.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016
The complexity of the Kth largest subset problem and related problems.
Inf. Process. Lett., 2016

Distinguishing Hidden Markov Chains.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

On Restricted Nonnegative Matrix Factorization.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Proving the Herman-Protocol Conjecture.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Trace Refinement in Labelled Markov Decision Processes.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

Markov Chains and Unambiguous Büchi Automata.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015
Runtime analysis of probabilistic programs with unbounded recursion.
J. Comput. Syst. Sci., 2015

Long-Run Average Behaviour of Probabilistic Vector Addition Systems.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

The Odds of Staying on Budget.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Minimisation of Multiplicity Tree Automata.
Proceedings of the Foundations of Software Science and Computation Structures, 2015

Tree Buffers.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

2014
Efficient Analysis of Probabilistic Programs with an Unbounded Counter.
J. ACM, 2014

Language equivalence of probabilistic pushdown automata.
Inf. Comput., 2014

Stability and Complexity of Minimising Probabilistic Automata.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Analysis of Probabilistic Basic Parallel Processes.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

On the total variation distance of labelled Markov chains.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

Zero-reachability in probabilistic multi-counter automata.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013
BPA bisimilarity is EXPTIME-hard.
Inf. Process. Lett., 2013

A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars.
Inf. Process. Lett., 2013

Algorithmic probabilistic game semantics - Playing games with automata.
Formal Methods in System Design, 2013

Analyzing probabilistic pushdown automata.
Formal Methods in System Design, 2013

On the Complexity of Equivalence and Minimisation for Q-weighted Automata
Logical Methods in Computer Science, 2013

Bisimilarity of Pushdown Automata is Nonelementary.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

2012
Space-efficient scheduling of stochastically generated tasks.
Inf. Comput., 2012

Three tokens in Herman's algorithm.
Formal Asp. Comput., 2012

Stabilization of Branching Queueing Networks.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Model Checking Stochastic Branching Processes.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Bisimilarity of Probabilistic Pushdown Automata.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

On the Complexity of the Equivalence Problem for Probabilistic Automata.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

APEX: An Analyzer for Open Probabilistic Programs.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

Proving Termination of Probabilistic Programs Using Patterns.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

2011
Derivation tree analysis for accelerated fixed-point computation.
Theor. Comput. Sci., 2011

Parikhʼs theorem: A simple and direct automaton construction.
Inf. Process. Lett., 2011

On Probabilistic Parallel Programs with Process Creation and Synchronisation.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2011

On Stabilization in Herman's Algorithm.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Runtime Analysis of Probabilistic Programs with Unbounded Recursion.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Language Equivalence for Probabilistic Automata.
Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

Efficient Analysis of Probabilistic Programs with an Unbounded Counter.
Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

2010
Computing the Least Fixed Point of Positive Polynomial Systems.
SIAM J. Comput., 2010

Newtonian program analysis.
J. ACM, 2010

Computing Least Fixed Points of Probabilistic Systems of Polynomials.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Space-Efficient Scheduling of Stochastically Generated Tasks.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
On least fixed points of systems of positive polynomials.
ACM Comm. Computer Algebra, 2009

On the Memory Consumption of Probabilistic Pushdown Automata.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains.
Proceedings of the Foundations of Software Science and Computational Structures, 2009

Solving Fixed-Point Equations on omega-Continuous Semirings.
Proceedings of the 6th Workshop on Fixed Points in Computer Science, 2009

2008
Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems.
JSAT, 2008

Convergence Thresholds of Newton's Method for Monotone Polynomial Equations.
Proceedings of the STACS 2008, 2008

Solving Monotone Polynomial Equations.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Newton's Method for omega-Continuous Semirings.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Derivation Tree Analysis for Accelerated Fixed-Point Computation.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

2007
On the convergence of Newton's method for monotone systems of polynomial equations.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

On Fixed Point Equations over Commutative Semirings.
Proceedings of the STACS 2007, 2007

An Extension of Newton's Method to omega -Continuous Semirings.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006
Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2006


  Loading...