Christof Löding

1.6k total citations
42 papers, 296 citations indexed

About

Christof Löding is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Christof Löding has authored 42 papers receiving a total of 296 indexed citations (citations by other indexed papers that have themselves been cited), including 31 papers in Computational Theory and Mathematics, 26 papers in Artificial Intelligence and 4 papers in Computer Networks and Communications. Recurrent topics in Christof Löding's work include Formal Methods in Verification (23 papers), semigroups and automata theory (21 papers) and Logic, programming, and type systems (15 papers). Christof Löding is often cited by papers focused on Formal Methods in Verification (23 papers), semigroups and automata theory (21 papers) and Logic, programming, and type systems (15 papers). Christof Löding collaborates with scholars based in Germany, France and United States. Christof Löding's co-authors include Thomas Colcombet, Erich Grädel, Marcin Jurdziński, Krzysztof R. Apt, Laurent Doyen, Antonı́n Kučera, Stephan Kreutzer, P. Madhusudan, Joseph Y. Halpern and Pierre‐Yves Schobbens and has published in prestigious journals such as SHILAP Revista de lepidopterología, Journal of the ACM and ACM Transactions on Programming Languages and Systems.

In The Last Decade

Christof Löding

37 papers receiving 280 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Christof Löding Germany 10 227 203 49 28 20 42 296
Sasha Rubin Italy 12 310 1.4× 278 1.4× 52 1.1× 44 1.6× 25 1.3× 55 420
Ernst–Erich Doberkat Germany 9 163 0.7× 200 1.0× 22 0.4× 55 2.0× 11 0.6× 59 282
Mila Majster-Cederbaum Germany 10 261 1.1× 190 0.9× 45 0.9× 66 2.4× 11 0.6× 45 309
Yoram Hirshfeld Israel 11 243 1.1× 212 1.0× 55 1.1× 19 0.7× 4 0.2× 21 305
Thomas Brihaye Belgium 9 175 0.8× 96 0.5× 57 1.2× 14 0.5× 28 1.4× 40 249
Wiesław Zielonka France 6 299 1.3× 226 1.1× 40 0.8× 46 1.6× 17 0.8× 12 351
Arie Matsliah Israel 9 254 1.1× 123 0.6× 32 0.7× 77 2.8× 26 1.3× 26 319
Damian Niwiński Poland 12 311 1.4× 264 1.3× 18 0.4× 45 1.6× 17 0.8× 36 374
Raffaella Gentilini Italy 7 148 0.7× 90 0.4× 32 0.7× 39 1.4× 11 0.6× 18 198
R.J. vanGlabbeek United States 6 296 1.3× 247 1.2× 50 1.0× 61 2.2× 5 0.3× 10 349

Countries citing papers authored by Christof Löding

Since Specialization
Citations

This map shows the geographic impact of Christof Löding'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 Christof Löding with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Christof Löding more than expected).

Fields of papers citing papers by Christof Löding

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Christof Löding. 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 Christof Löding. The network helps show where Christof Löding may publish in the future.

Co-authorship network of co-authors of Christof Löding

This figure shows the co-authorship network connecting the top 25 collaborators of Christof Löding. A scholar is included among the top collaborators of Christof Löding 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 Christof Löding. Christof Löding 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.
Löding, Christof, et al.. (2024). Constructing Deterministic Parity Automata from Positive and Negative Examples. SHILAP Revista de lepidopterología. Volume 3. 2 indexed citations
2.
Murali, Adithya, et al.. (2023). A First-order Logic with Frames. ACM Transactions on Programming Languages and Systems. 45(2). 1–44.
3.
Murali, Adithya, et al.. (2022). Model-guided synthesis of inductive lemmas for FOL with least fixpoints. Proceedings of the ACM on Programming Languages. 6(OOPSLA2). 1873–1902. 4 indexed citations
4.
Löding, Christof, et al.. (2021). Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 18. 1 indexed citations
5.
Grohe, Martin, et al.. (2017). Learning MSO-definable hypotheses on strings. RWTH Publications (RWTH Aachen). 434–451. 6 indexed citations
6.
Löding, Christof, et al.. (2016). Synthesis of deterministic top-down tree transducers from automatic tree relations. Information and Computation. 253. 336–354. 1 indexed citations
7.
Jacobs, Bart & Christof Löding. (2016). Foundations of Software Science and Computation Structures. Lecture notes in computer science. 8 indexed citations
8.
Filiot, Emmanuel, et al.. (2016). On Equivalence and Uniformisation Problems for Finite Transducers (ICALP'16). Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 14. 1 indexed citations
9.
Thomas, Wolfgang, et al.. (2014). Simplification problems for automata and games. RWTH Publications (RWTH Aachen).
10.
Löding, Christof, et al.. (2014). Guaranteeing Stability and Delay in Dynamic Networks Based on Infinite Games. KTH Publication Database DiVA (KTH Royal Institute of Technology). 2500. 461–469.
11.
Neider, Daniel, Wolfgang Thomas, Christof Löding, & Martin Leucker. (2014). Applications of automata learning in verification and synthesis. RWTH Publications (RWTH Aachen). 9 indexed citations
12.
Löding, Christof, et al.. (2013). Modeling and Verification of Infinite Systems with Resources. Logical Methods in Computer Science. Volume 9, Issue 4. 2 indexed citations
13.
Chatterjee, Krishnendu, et al.. (2010). Obliging games. 284–296. 3 indexed citations
14.
Colcombet, Thomas & Christof Löding. (2008). Automata, Languages and Programming. Lecture notes in computer science. 31 indexed citations
15.
Löding, Christof. (2007). Ground Tree Rewriting Graphs of Bounded Tree Width. RWTH Publications (RWTH Aachen). 1 indexed citations
16.
Löding, Christof, Carsten Lutz, & Olivier Serre. (2007). Propositional dynamic logic with recursive programs. The Journal of Logic and Algebraic Programming. 73(1-2). 51–69. 7 indexed citations
17.
Bárány, Vince, Christof Löding, & Olivier Serre. (2006). Regularity Problems for Visibly Pushdown Languages. HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations
18.
Thomas, Wolfgang, et al.. (2005). Deterministic Automata on Unranked Trees. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 0. 1 indexed citations
19.
Bontemps, Yves, Pierre‐Yves Schobbens, & Christof Löding. (2004). Synthesis of Open Reactive Systems from Scenario-Based Specifications. Fundamenta Informaticae. 62(2). 139–169. 20 indexed citations
20.
Löding, Christof, P. Madhusudan, & Olivier Serre. (2004). Visibly pushdown games. Lecture notes in computer science. 3328. 408–420. 6 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

Rankless by CCL
2026