| Newtonian program analysis J Esparza, S Kiefer, M Luttenberger Journal of the ACM (JACM) 57 (6), 1-47, 2010 | 86 | 2010 |
| Parikhʼs theorem: A simple and direct automaton construction J Esparza, P Ganty, S Kiefer, M Luttenberger Information Processing Letters 111 (12), 614-619, 2011 | 75 | 2011 |
| Abstraction refinement with Craig interpolation and symbolic pushdown systems J Esparza, S Kiefer, S Schwoon International Conference on Tools and Algorithms for the Construction and …, 2006 | 74 | 2006 |
| Proving termination of probabilistic programs using patterns J Esparza, A Gaiser, S Kiefer International Conference on Computer Aided Verification, 123-138, 2012 | 70 | 2012 |
| Analyzing probabilistic pushdown automata T Brázdil, J Esparza, S Kiefer, A Kučera Formal Methods in System Design 43 (2), 124-163, 2013 | 64 | 2013 |
| The odds of staying on budget C Haase, S Kiefer International Colloquium on Automata, Languages, and Programming, 234-246, 2015 | 62 | 2015 |
| Language equivalence for probabilistic automata S Kiefer, AS Murawski, J Ouaknine, B Wachter, J Worrell International Conference on Computer Aided Verification, 526-540, 2011 | 56 | 2011 |
| On the total variation distance of labelled Markov chains T Chen, S Kiefer Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014 | 51 | 2014 |
| On fixed point equations over commutative semirings J Esparza, S Kiefer, M Luttenberger Annual Symposium on Theoretical Aspects of Computer Science, 296-307, 2007 | 51 | 2007 |
| On the convergence of Newton's method for monotone systems of polynomial equations S Kiefer, M Luttenberger, J Esparza Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007 | 50 | 2007 |
| BPA bisimilarity is EXPTIME-hard S Kiefer Information Processing Letters 113 (4), 101-106, 2013 | 46 | 2013 |
| Markov chains and unambiguous Büchi automata C Baier, S Kiefer, J Klein, S Klüppelholz, D Müller, J Worrell International Conference on Computer Aided Verification, 23-42, 2016 | 41 | 2016 |
| Efficient analysis of probabilistic programs with an unbounded counter T Brázdil, S Kiefer, A Kŭcera Journal of the ACM (JACM) 61 (6), 1-35, 2014 | 38 | 2014 |
| On the complexity of equivalence and minimisation for Q-weighted automata S Kiefer, A Murawski, J Ouaknine, B Wachter, J Worrell Logical Methods in Computer Science 9, 2013 | 36 | 2013 |
| Runtime analysis of probabilistic programs with unbounded recursion T Brázdil, S Kiefer, A Kučera, IH Vařeková Journal of Computer and System Sciences 81 (1), 288-310, 2015 | 33 | 2015 |
| Computing the least fixed point of positive polynomial systems J Esparza, S Kiefer, M Luttenberger SIAM Journal on Computing 39 (6), 2282-2335, 2010 | 33 | 2010 |
| On computing the total variation distance of hidden Markov models S Kiefer arXiv preprint arXiv:1804.06170, 2018 | 32 | 2018 |
| Convergence thresholds of Newton's method for monotone polynomial equations J Esparza, S Kiefer, M Luttenberger arXiv preprint arXiv:0802.2856, 2008 | 31 | 2008 |
| An Extension of Newton’s Method to ω-Continuous Semirings J Esparza, S Kiefer, M Luttenberger International Conference on Developments in Language Theory, 157-168, 2007 | 30 | 2007 |
| On the complexity of value iteration N Balaji, S Kiefer, P Novotný, GA Pérez, M Shirmohammadi arXiv preprint arXiv:1807.04920, 2018 | 29 | 2018 |
