Johannes Waldmann

848 total citations
17 papers, 194 citations indexed

About

Johannes Waldmann is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Molecular Biology. According to data from OpenAlex, Johannes Waldmann has authored 17 papers receiving a total of 194 indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Artificial Intelligence, 13 papers in Computational Theory and Mathematics and 4 papers in Molecular Biology. Recurrent topics in Johannes Waldmann's work include Logic, programming, and type systems (10 papers), semigroups and automata theory (9 papers) and Natural Language Processing Techniques (7 papers). Johannes Waldmann is often cited by papers focused on Logic, programming, and type systems (10 papers), semigroups and automata theory (9 papers) and Natural Language Processing Techniques (7 papers). Johannes Waldmann collaborates with scholars based in Germany, Netherlands and United States. Johannes Waldmann's co-authors include Dieter Hofbauer, Hans Zantema, Jörg Endrullis, Alfons Geser and Georg Moser and has published in prestigious journals such as Theoretical Computer Science, Information and Computation and Information Processing Letters.

In The Last Decade

Johannes Waldmann

16 papers receiving 173 citations

Peers

Johannes Waldmann

AI

CTM

MB

SOFTW

CNC

Didier Caucal France

Jörg Endrullis Netherlands

Dieter Hofbauer Germany

Peter Burmeister Germany

Radu Mardare Denmark

Sophie Tison France

Uwe Waldmann Germany

Peter Habermehl France

Kamal Lodaya India

Carlos Olarte Brazil

Didier Caucal France

Johannes Waldmann

91 ×0.5

AI

122 ×0.9

CTM

22 ×1.0

MB

16 ×0.9

SOFTW

12 ×0.9

CNC

Citations per year, relative to Johannes Waldmann Johannes Waldmann (= 1×) peers Didier Caucal

Countries citing papers authored by Johannes Waldmann

Since Specialization

Citations

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

Fields of papers citing papers by Johannes Waldmann

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Johannes Waldmann

This figure shows the co-authorship network connecting the top 25 collaborators of Johannes Waldmann. A scholar is included among the top collaborators of Johannes Waldmann 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 Johannes Waldmann. Johannes Waldmann is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

17 of 17 papers shown

1.

Waldmann, Johannes. (2015). Matrix Interpretations on Polyhedral Domains. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 36. 318–333. 2 indexed citations

2.

Waldmann, Johannes. (2014). Automated Exercises for Constraint Programming.. 66–80.

3.

Waldmann, Johannes, et al.. (2009). Max/plus tree automata for termination of term rewriting. Acta Cybernetica. 19(2). 357–392. 11 indexed citations

4.

Endrullis, Jörg, et al.. (2009). LOCAL TERMINATION: THEORY AND PRACTICE. 5 indexed citations

5.

Moser, Georg, et al.. (2008). Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 18 indexed citations

6.

Geser, Alfons, Dieter Hofbauer, Johannes Waldmann, & Hans Zantema. (2007). On tree automata that certify termination of left-linear term rewriting systems. Information and Computation. 205(4). 512–534. 14 indexed citations

7.

Waldmann, Johannes. (2007). Weighted Automata for Proving Termination of String Rewriting. Journal of automata, languages and combinatorics. 12(4). 545–570. 5 indexed citations

8.

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

9.

Hofbauer, Dieter & Johannes Waldmann. (2006). Termination of. Information Processing Letters. 98(4). 156–158. 7 indexed citations

10.

Endrullis, Jörg, Dieter Hofbauer, & Johannes Waldmann. (2006). Decomposing terminating rewrite relations. Data Archiving and Networked Services (DANS). 39–43. 3 indexed citations

11.

Geser, Alfons, Dieter Hofbauer, & Johannes Waldmann. (2005). Deciding Termination for Ancestor Match- Bounded String Rewriting Systems. NASA Technical Reports Server (NASA). 2 indexed citations

12.

Geser, Alfons, Dieter Hofbauer, Johannes Waldmann, & Hans Zantema. (2005). FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS. International Journal of Foundations of Computer Science. 16(3). 471–486. 3 indexed citations

13.

Geser, Alfons, Dieter Hofbauer, & Johannes Waldmann. (2005). Termination Proofs for String Rewriting Systems via Inverse Match-Bounds. Journal of Automated Reasoning. 34(4). 365–385. 5 indexed citations

14.

Hofbauer, Dieter & Johannes Waldmann. (2004). Deleting string rewriting systems preserve regularity. Theoretical Computer Science. 327(3). 301–317. 18 indexed citations

15.

Geser, Alfons, Dieter Hofbauer, Johannes Waldmann, & Hans Zantema. (2004). Tree automata that certify termination of term rewriting systems. TU/e Research Portal (Eindhoven University of Technology). 14–17. 1 indexed citations

16.

Geser, Alfons, Dieter Hofbauer, & Johannes Waldmann. (2004). Match-Bounded String Rewriting Systems. Applicable Algebra in Engineering Communication and Computing. 15(3-4). 149–171. 26 indexed citations

17.

Waldmann, Johannes. (2000). The Combinator S. Information and Computation. 159(1-2). 2–21. 5 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