Uwe Waldmann

989 total citations
30 papers, 174 citations indexed

About

Uwe Waldmann is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Uwe Waldmann has authored 30 papers receiving a total of 174 indexed citations (citations by other indexed papers that have themselves been cited), including 20 papers in Computational Theory and Mathematics, 18 papers in Artificial Intelligence and 4 papers in Computer Networks and Communications. Recurrent topics in Uwe Waldmann's work include Logic, programming, and type systems (15 papers), Logic, Reasoning, and Knowledge (12 papers) and Formal Methods in Verification (12 papers). Uwe Waldmann is often cited by papers focused on Logic, programming, and type systems (15 papers), Logic, Reasoning, and Knowledge (12 papers) and Formal Methods in Verification (12 papers). Uwe Waldmann collaborates with scholars based in Germany, Netherlands and France. Uwe Waldmann's co-authors include Harald Ganzinger, Leo Bachmair, Viorica Sofronie-Stokkermans, Jasmin Christian Blanchette, Christoph Scholl, Werner Damm, Henning Dierks, Michaël Rusinowitch, Swen Jacobs and David Basin and has published in prestigious journals such as Communications of the ACM, Theoretical Computer Science and Lecture notes in computer science.

In The Last Decade

Uwe Waldmann

26 papers receiving 159 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Uwe Waldmann Germany	7	148	125	25	19	15	30	174
Michel Parigot France	7	175 1.2×	152 1.2×	15 0.6×	16 0.8×	14 0.9×	15	199
Temur Kutsia Austria	7	175 1.2×	105 0.8×	27 1.1×	47 2.5×	19 1.3×	53	205
Sophie Tison France	7	161 1.1×	148 1.2×	18 0.7×	41 2.2×	11 0.7×	30	199
Witold Charatonik Poland	8	139 0.9×	127 1.0×	13 0.5×	36 1.9×	11 0.7×	31	166
Fairouz Kamareddine United Kingdom	10	246 1.7×	167 1.3×	17 0.7×	28 1.5×	8 0.5×	48	260
Vincent van Oostrom Netherlands	9	174 1.2×	145 1.2×	25 1.0×	23 1.2×	10 0.7×	26	201
Gian Luca Cattani United Kingdom	10	148 1.0×	143 1.1×	11 0.4×	36 1.9×	4 0.3×	18	193
Bartek Klin Poland	9	241 1.6×	247 2.0×	12 0.5×	21 1.1×	4 0.3×	37	292
Corina Ĉırstea United Kingdom	9	200 1.4×	168 1.3×	12 0.5×	11 0.6×	15 1.0×	40	224
Kevin Millikin Denmark	8	139 0.9×	83 0.7×	12 0.5×	13 0.7×	19 1.3×	15	143

Countries citing papers authored by Uwe Waldmann

Since Specialization

Citations

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

Fields of papers citing papers by Uwe Waldmann

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Uwe Waldmann

This figure shows the co-authorship network connecting the top 25 collaborators of Uwe Waldmann. A scholar is included among the top collaborators of Uwe 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 Uwe Waldmann. Uwe 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:

20 of 20 papers shown

Tóth, Balázs, et al.. (2024). A Modular Formalization of Superposition in Isabelle/HOL. SPIRE - Sciences Po Institutional REpository.

Blanchette, Jasmin Christian, et al.. (2023). Mechanical Mathematicians. Communications of the ACM. 66(4). 80–90. 2 indexed citations

Waldmann, Uwe, et al.. (2022). A Comprehensive Framework for Saturation Theorem Proving. Journal of Automated Reasoning. 66(4). 499–539. 3 indexed citations

Blanchette, Jasmin Christian, et al.. (2021). Superposition with Lambdas. Journal of Automated Reasoning. 65(7). 893–940. 6 indexed citations

Blanchette, Jasmin Christian, Pascal Fontaine, Stephan Schulz, & Uwe Waldmann. (2018). Towards Strong Higher-Order Automation for Fast Interactive Verification. EPiC series in computing. 51. 16–7. 2 indexed citations

Althaus, Ernst, et al.. (2017). Verification of linear hybrid systems with large discrete state spaces using counterexample-guided abstraction refinement. Science of Computer Programming. 148. 123–160. 3 indexed citations

Blanchette, Jasmin Christian, et al.. (2016). Formalization of Knuth-Bendix Orders for Lambda-Free Higher-Order Terms.. 2016. 1 indexed citations

Blanchette, Jasmin Christian, et al.. (2016). Formalization of Recursive Path Orders for Lambda-Free Higher-Order Terms.. 2016. 1 indexed citations

Damm, Werner, et al.. (2011). Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces. Science of Computer Programming. 77(10-11). 1122–1150. 10 indexed citations

10.

Baumgartner, Peter & Uwe Waldmann. (2010). A Combined Superposition and Model Evolution Calculus. Journal of Automated Reasoning. 47(2). 191–227. 1 indexed citations

11.

Ganzinger, Harald, Viorica Sofronie-Stokkermans, & Uwe Waldmann. (2006). Modular proof systems for partial functions with Evans equality. Information and Computation. 204(10). 1453–1492. 7 indexed citations

12.

Jacobs, Swen & Uwe Waldmann. (2005). Comparing Instance Generation Methods for Automated Reasoning. Lecture notes in computer science. 38(1-3). 153–168. 1 indexed citations

13.

Waldmann, Uwe. (2002). Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part I). Journal of Symbolic Computation. 33(6). 777–829. 3 indexed citations

14.

Waldmann, Uwe. (2002). Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part II). Journal of Symbolic Computation. 33(6). 831–861. 2 indexed citations

15.

Waldmann, Uwe. (2001). Superposition and Chaining for Totally Ordered Divisible Abelian Groups (Extended Abstract). Max Planck Institute for Plasma Physics. 226–241. 2 indexed citations

16.

Waldmann, Uwe. (1999). Cancellative Superposition Decides the Theory of Divisible Torsion-Free Abelian Groups. Lecture notes in computer science. 131–147. 2 indexed citations

17.

Ganzinger, Harald & Uwe Waldmann. (1996). Theorem proving in cancellative abelian monoids. MPG.PuRe (Max Planck Society). 8 indexed citations

18.

Ganzinger, Harald, Leo Bachmair, & Uwe Waldmann. (1992). Set constraints are the Monadic class. MPG.PuRe (Max Planck Society). 45 indexed citations

19.

Ganzinger, Harald & Uwe Waldmann. (1992). Termination Proofs of Well-Moded Logic Programs Via Conditional Rewrite Systems. Max Planck Institute for Plasma Physics. 430–437. 1 indexed citations

20.

Waldmann, Uwe. (1992). Semantics of order-sorted specifications. Theoretical Computer Science. 94(1). 1–35. 16 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