D-Index & Metrics Best Publications

Hartmut Ehrig

Technical University of Berlin
Germany

Computer Science

Germany

2023

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Discipline name Citations Publications World Ranking National Ranking

Computer Science D-index 65 Citations 18,128 486 World Ranking 1525 National Ranking 56

Research.com Recognitions

Awards & Achievements

2023 - Research.com Computer Science in Germany Leader Award

Overview

What is he best known for?

The fields of study he is best known for:

Programming language
Algebra
Operating system

Hartmut Ehrig spends much of his time researching Theoretical computer science, Graph rewriting, Discrete mathematics, Programming language and Algebraic number. The Theoretical computer science study combines topics in areas such as Graph, Petri net, Model transformation, Semantics and Rule-based machine translation. His Graph rewriting research incorporates themes from Algebraic graph theory, Clique-width, Graph property, Artificial intelligence and Null graph.

His Discrete mathematics study combines topics in areas such as Embedding, Pushout, Confluence and Algebra. His Programming language research includes elements of Functor and Algebraic modeling language. His Algebraic number research is multidisciplinary, relying on both Structure, Theory of computation and Control flow analysis.

His most cited work include:

Fundamentals of Algebraic Graph Transformation (822 citations)
Fundamentals of Algebraic Specification 1 (819 citations)
Fundamentals of Algebraic Specification 1: Equations and Initial Semantics (649 citations)

What are the main themes of his work throughout his whole career to date?

His scientific interests lie mostly in Theoretical computer science, Graph rewriting, Programming language, Discrete mathematics and Algebra. His studies deal with areas such as Correctness, Petri net, Model transformation, Semantics and Rule-based machine translation as well as Theoretical computer science. Hartmut Ehrig has included themes like Algorithm, Clique-width and Null graph in his Graph rewriting study.

The various areas that Hartmut Ehrig examines in his Null graph study include Graph property, Graph algebra and Tree-adjoining grammar. His Programming language course of study focuses on Algebraic number and Categorical variable. His Discrete mathematics study integrates concerns from other disciplines, such as Confluence, Combinatorics and Pushout.

He most often published in these fields:

Theoretical computer science (36.63%)
Graph rewriting (32.95%)
Programming language (28.88%)

What were the highlights of his more recent work (between 2007-2015)?

Graph rewriting (32.95%)
Theoretical computer science (36.63%)
Model transformation (8.53%)

In recent papers he was focusing on the following fields of study:

His primary areas of investigation include Graph rewriting, Theoretical computer science, Model transformation, Correctness and Petri net. His biological study deals with issues like Algorithm, which deal with fields such as Pushout. In his work, Clique-width and Graph property is strongly intertwined with Null graph, which is a subfield of Theoretical computer science.

His study on Model transformation is covered under Algebra. His Correctness study is related to the wider topic of Programming language. His research integrates issues of Embedding and Finite set in his study of Discrete mathematics.

Between 2007 and 2015, his most popular works were:

Fundamentals of Algebraic Graph Transformation (822 citations)
Fundamentals of Algebraic Specification 2: Module Specifications and Constraints (200 citations)
From state- to delta-based bidirectional model transformations: the symmetric case (83 citations)

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Fundamentals of Algebraic Graph Transformation

Hartmut Ehrig;Karsten Ehrig;Ulrike Prange;Gabriele Taentzer.
(2010)

1311 Citations

Fundamentals of Algebraic Specification 1

Hartmut Ehrig;B. Mahr.
(1985)

1295 Citations

Fundamentals of Algebraic Specification 1: Equations and Initial Semantics

Hartmut Ehrig;Bernd Mahr.
(1985)

1006 Citations

Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools

H. Ehrig;G. Engels;H.-J. Kreowski;G. Rozenberg.
(1999)

880 Citations

Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach

A. Corradini;U. Montanari;F. Rossi;H. Ehrig.
Handbook of graph grammars and computing by graph transformation (1997)

711 Citations

Introduction to the Algebraic Theory of Graph Grammars (A Survey)

Hartmut Ehrig.
international workshop on graph grammars and their application to computer science (1978)

695 Citations

Graph-grammars: An algebraic approach

H. Ehrig;M. Pfender;H. J. Schneider.
foundations of computer science (1973)

682 Citations

Graph Grammars and Their Application to Computer Science: 3rd International Workshop Warrenton, Virginia, Usa, December 2-6, 1986

Hartmut Ehrig;M. Nagl;Grzegorz Rozenberg;Azriel Rosenfeld.
(1988)

621 Citations

Algebraic approaches to graph transformation. Part II: single pushout approach and comparison with double pushout approach

H. Ehrig;R. Heckel;M. Korff;M. Löwe.
Handbook of graph grammars and computing by graph transformation (1997)

408 Citations

Fundamentals of Algebraic Specification 2: Module Specifications and Constraints

Hartmut Ehrig;Bernd Mahr.
(2011)

303 Citations

If you think any of the details on this page are incorrect, let us know.

Frequent Co-Authors

External Links

Personal Website for Hartmut Ehrig