Jörg Endrullis

831 total citations
36 papers, 197 citations indexed

About

Jörg Endrullis is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Jörg Endrullis has authored 36 papers receiving a total of 197 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Artificial Intelligence, 27 papers in Computational Theory and Mathematics and 5 papers in Computer Networks and Communications. Recurrent topics in Jörg Endrullis's work include Logic, programming, and type systems (23 papers), semigroups and automata theory (16 papers) and Formal Methods in Verification (13 papers). Jörg Endrullis is often cited by papers focused on Logic, programming, and type systems (23 papers), semigroups and automata theory (16 papers) and Formal Methods in Verification (13 papers). Jörg Endrullis collaborates with scholars based in Netherlands, United States and Germany. Jörg Endrullis's co-authors include Hans Zantema, Johannes Waldmann, Jan Willem Klop, Lawrence S. Moss, Andrew Polonsky, Rena Bakhshi, Wan Fokkink, Helle Hvid Hansen, Alexandra Silva and Boudewijn R. Haverkort and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Proceedings of the American Mathematical Society.

In The Last Decade

Jörg Endrullis

31 papers receiving 182 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Jörg Endrullis Netherlands 8 153 142 32 20 13 36 197
Sophie Tison France 7 161 1.1× 148 1.0× 41 1.3× 18 0.9× 10 0.8× 30 199
Radu Mardare Denmark 8 137 0.9× 139 1.0× 12 0.4× 19 0.9× 30 2.3× 56 195
Stefan Kiefer United Kingdom 9 144 0.9× 165 1.2× 27 0.8× 44 2.2× 22 1.7× 41 210
Thomas Colcombet France 9 192 1.3× 170 1.2× 41 1.3× 14 0.7× 29 2.2× 35 255
Witold Charatonik Poland 8 139 0.9× 127 0.9× 36 1.1× 13 0.7× 7 0.5× 31 166
Irène Guessarian France 7 155 1.0× 155 1.1× 29 0.9× 11 0.6× 5 0.4× 28 213
Dietmar Berwanger France 8 78 0.5× 100 0.7× 23 0.7× 8 0.4× 5 0.4× 15 126
Panos Rondogiannis Greece 8 130 0.8× 119 0.8× 30 0.9× 8 0.4× 17 1.3× 41 172
Olaf Beyersdorff Germany 9 189 1.2× 210 1.5× 32 1.0× 8 0.4× 7 0.5× 64 256
Temur Kutsia Austria 7 175 1.1× 105 0.7× 47 1.5× 27 1.4× 6 0.5× 53 205

Countries citing papers authored by Jörg Endrullis

Since Specialization
Citations

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

Fields of papers citing papers by Jörg Endrullis

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Jörg Endrullis

This figure shows the co-authorship network connecting the top 25 collaborators of Jörg Endrullis. A scholar is included among the top collaborators of Jörg Endrullis 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 Jörg Endrullis. Jörg Endrullis 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.
Endrullis, Jörg, et al.. (2023). A PBPO+ Graph Rewriting Tutorial. Electronic Proceedings in Theoretical Computer Science. 377. 45–63. 1 indexed citations
2.
Endrullis, Jörg, et al.. (2021). From Linear Term Rewriting to Graph Rewriting with Preservation of Termination. Electronic Proceedings in Theoretical Computer Science. 350. 19–34.
3.
Endrullis, Jörg, et al.. (2018). Coinductive foundations of infinitary rewriting and infinitary equational logic. SHILAP Revista de lepidopterología.
4.
Endrullis, Jörg & Jan Willem Klop. (2018). Braids via term rewriting. Theoretical Computer Science. 777. 260–295.
5.
Endrullis, Jörg, et al.. (2018). Decreasing Diagrams with Two Labels Are Complete for Confluence of Countable Systems. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 15. 2 indexed citations
6.
Endrullis, Jörg, et al.. (2018). Degrees of Infinite Words, Polynomials and Atoms. International Journal of Foundations of Computer Science. 29(5). 825–843. 1 indexed citations
7.
Lai, Tri, Jörg Endrullis, & Lawrence S. Moss. (2016). Majority Digraphs. Proceedings of the American Mathematical Society. 144(9). 3701–3715. 1 indexed citations
8.
Endrullis, Jörg, et al.. (2015). A Coinductive Framework for Infinitary Rewriting and Equational Reasoning. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 8 indexed citations
9.
Endrullis, Jörg & Hans Zantema. (2015). Proving non-termination by finite automata. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 36. 160–176. 4 indexed citations
10.
Endrullis, Jörg, et al.. (2014). Discriminating Lambda-Terms Using Clocked Boehm Trees. Logical Methods in Computer Science. Volume 10, Issue 2. 2 indexed citations
11.
Endrullis, Jörg, et al.. (2014). On periodically iterated morphisms. 1–10.
12.
Endrullis, Jörg, et al.. (2012). Highlights in infinitary rewriting and lambda calculus. Theoretical Computer Science. 464. 48–71. 7 indexed citations
13.
Endrullis, Jörg, et al.. (2012). On the complexity of equivalence of specifications of infinite objects. Data Archiving and Networked Services (DANS). 153–164. 1 indexed citations
14.
Endrullis, Jörg, et al.. (2011). On equal μ-terms. Theoretical Computer Science. 412(28). 3175–3202. 2 indexed citations
15.
Endrullis, Jörg, et al.. (2011). Lazy productivity via termination. Theoretical Computer Science. 412(28). 3203–3225. 12 indexed citations
16.
Zantema, Hans & Jörg Endrullis. (2011). Proving Equality of Streams Automatically. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 10. 393–408. 5 indexed citations
17.
Endrullis, Jörg, Herman Geuvers, Jakob Grue Simonsen, & Hans Zantema. (2010). Levels of undecidability in rewriting. Information and Computation. 209(2). 227–245. 8 indexed citations
18.
Endrullis, Jörg, et al.. (2010). Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations
19.
Endrullis, Jörg, et al.. (2009). LOCAL TERMINATION: THEORY AND PRACTICE. 5 indexed citations
20.
Endrullis, Jörg, Johannes Waldmann, & Hans Zantema. (2007). Matrix Interpretations for Proving Termination of Term Rewriting. Journal of Automated Reasoning. 40(2-3). 195–220. 69 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