Stefan Kiefer

1.2k total citations
41 papers, 210 citations indexed

About

Stefan Kiefer is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Software. According to data from OpenAlex, Stefan Kiefer has authored 41 papers receiving a total of 210 indexed citations (citations by other indexed papers that have themselves been cited), including 34 papers in Computational Theory and Mathematics, 24 papers in Artificial Intelligence and 8 papers in Software. Recurrent topics in Stefan Kiefer's work include Formal Methods in Verification (22 papers), semigroups and automata theory (17 papers) and Machine Learning and Algorithms (8 papers). Stefan Kiefer is often cited by papers focused on Formal Methods in Verification (22 papers), semigroups and automata theory (17 papers) and Machine Learning and Algorithms (8 papers). Stefan Kiefer collaborates with scholars based in United Kingdom, Germany and Czechia. Stefan Kiefer's co-authors include Javier Esparza, Michael Luttenberger, Antonı́n Kučera, Tomǎš Brázdil, James Worrell, Pierre Ganty, Andrzej S. Murawski, Ivana Hutařová Vařeková, Klaus Wolf and Christoph Haase and has published in prestigious journals such as SHILAP Revista de lepidopterología, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Stefan Kiefer

35 papers receiving 208 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Stefan Kiefer United Kingdom 9 165 144 44 27 22 41 210
Benjamin Aminof Italy 9 132 0.8× 133 0.9× 31 0.7× 15 0.6× 6 0.3× 27 175
Florian Lonsing Austria 8 134 0.8× 102 0.7× 38 0.9× 27 1.0× 10 0.5× 16 176
Uli Fahrenberg France 9 160 1.0× 110 0.8× 72 1.6× 25 0.9× 8 0.4× 42 211
Carlos Olarte Brazil 7 92 0.6× 96 0.7× 23 0.5× 18 0.7× 34 1.5× 40 151
Prasanna Thati United States 5 118 0.7× 118 0.8× 46 1.0× 40 1.5× 6 0.3× 6 174
Bas Luttik Netherlands 9 209 1.3× 151 1.0× 50 1.1× 35 1.3× 10 0.5× 44 244
Bernard Boigelot Belgium 7 166 1.0× 104 0.7× 74 1.7× 10 0.4× 10 0.5× 15 185
Alban Ponse Netherlands 9 202 1.2× 185 1.3× 21 0.5× 22 0.8× 8 0.4× 46 243
Anton Wijs Netherlands 9 112 0.7× 68 0.5× 77 1.8× 23 0.9× 8 0.4× 37 176
Marcus Größer Germany 6 121 0.7× 78 0.5× 51 1.2× 17 0.6× 4 0.2× 11 150

Countries citing papers authored by Stefan Kiefer

Since Specialization
Citations

This map shows the geographic impact of Stefan Kiefer's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Stefan Kiefer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stefan Kiefer more than expected).

Fields of papers citing papers by Stefan Kiefer

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Stefan Kiefer. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Stefan Kiefer. The network helps show where Stefan Kiefer may publish in the future.

Co-authorship network of co-authors of Stefan Kiefer

This figure shows the co-authorship network connecting the top 25 collaborators of Stefan Kiefer. A scholar is included among the top collaborators of Stefan Kiefer based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Stefan Kiefer. Stefan Kiefer is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Kiefer, Stefan, et al.. (2024). Strategy Complexity of Reachability in Countable Stochastic 2-Player Games. Dynamic Games and Applications. 15(3). 980–1036.
2.
Kiefer, Stefan, et al.. (2022). On complementing unambiguous automata and graphs with many cliques and cocliques. Information Processing Letters. 177. 106270–106270. 3 indexed citations
3.
Baier, Christel, et al.. (2021). Responsibility and verification: importance value in temporal logics. Oxford University Research Archive (ORA) (University of Oxford). 3 indexed citations
4.
Haase, Christoph, et al.. (2020). On the Size of Finite Rational Matrix Semigroups. UCL Discovery (University College London). 13. 1 indexed citations
5.
Forejt, Vojtěch, Petr Jančar, Stefan Kiefer, & James Worrell. (2018). Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata. SHILAP Revista de lepidopterología. 2 indexed citations
6.
Kiefer, Stefan. (2018). On Computing the Total Variation Distance of Hidden Markov Models.. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 13. 2 indexed citations
7.
Kiefer, Stefan, et al.. (2017). Parity objectives in countable MDPs. 1–11. 1 indexed citations
8.
Kiefer, Stefan, et al.. (2017). On rationality of nonnegative matrix factorization. Symposium on Discrete Algorithms. 1290–1305.
9.
Forejt, Vojtěch, Petr Jančar, Stefan Kiefer, & James Worrell. (2014). Language equivalence of probabilistic pushdown automata. Information and Computation. 237. 1–11. 3 indexed citations
10.
Brázdil, Tomǎš, Stefan Kiefer, Antonı́n Kučera, & Ivana Hutařová Vařeková. (2014). Runtime analysis of probabilistic programs with unbounded recursion. Journal of Computer and System Sciences. 81(1). 288–310. 16 indexed citations
11.
Brázdil, Tomǎš, Stefan Kiefer, & Antonı́n Kučera. (2014). Efficient Analysis of Probabilistic Programs with an Unbounded Counter. Journal of the ACM. 61(6). 1–35. 8 indexed citations
12.
Brázdil, Tomǎš, Stefan Kiefer, Antonı́n Kučera, Petr Novotný, & Joost-Pieter Katoen. (2014). Zero-reachability in probabilistic multi-counter automata. 1601. 1–10. 5 indexed citations
13.
Kiefer, Stefan, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, & James Worrell. (2012). Algorithmic probabilistic game semantics. Formal Methods in System Design. 43(2). 285–312. 6 indexed citations
14.
Esparza, Javier, Stefan Kiefer, & Michael Luttenberger. (2011). Derivation tree analysis for accelerated fixed-point computation. Theoretical Computer Science. 412(28). 3226–3241.
15.
Esparza, Javier, Pierre Ganty, Stefan Kiefer, & Michael Luttenberger. (2011). Parikhʼs theorem: A simple and direct automaton construction. Information Processing Letters. 111(12). 614–619. 23 indexed citations
16.
Esparza, Javier, Stefan Kiefer, & Michael Luttenberger. (2010). Computing the Least Fixed Point of Positive Polynomial Systems. SIAM Journal on Computing. 39(6). 2282–2335. 7 indexed citations
17.
Brázdil, Tomǎš, Javier Esparza, & Stefan Kiefer. (2009). On the Memory Consumption of Probabilistic Pushdown Automata. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations
18.
Esparza, Javier, Stefan Kiefer, & Michael Luttenberger. (2008). Newton's Method for omega-Continuous Semirings.. International Colloquium on Automata, Languages and Programming. 14–26. 2 indexed citations
19.
Esparza, Javier, Stefan Kiefer, & Stefan Schwoon. (2008). Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems1. 5(1-4). 27–56. 2 indexed citations
20.
Kiefer, Stefan, et al.. (1995). Nucleotide sequence of the Schizosaccharomyces japonicus var. versatilis ribosomal RNA gene cluster and its phylogenetic implications. Current Genetics. 28(4). 353–359. 9 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Benjamin Aminof Breakdown of academic impact, for papers by Florian Lonsing Breakdown of academic impact, for papers by Uli Fahrenberg Breakdown of academic impact, for papers by Carlos Olarte Breakdown of academic impact, for papers by Prasanna Thati Breakdown of academic impact, for papers by Bas Luttik Breakdown of academic impact, for papers by Bernard Boigelot Breakdown of academic impact, for papers by Alban Ponse Breakdown of academic impact, for papers by Anton Wijs Breakdown of academic impact, for papers by Marcus Größer
Rankless by CCL
2026