Peter Padawitz
Impact in
- Software top 10%
- Model-Driven Software Engineering Techniques
- Software Testing and Debugging Techniques
-
- Formal Methods in Verification
Papers in
-
- Logic, programming, and type systems 11
- Logic, Reasoning, and Knowledge 5
- Natural Language Processing Techniques 2
- Semantic Web and Ontologies 2
-
- Formal Methods in Verification 9
- Co-authors
- Hartmut Ehrig (2 shared papers)Hans‐Jörg Kreowski (2 shared papers)B. Mahr (1 shared paper)Martin Wirsing (1 shared paper)
- Journals
- Theoretical Computer Science (3 papers)Journal of Computer and System Sciences (1 paper)Information and Computation (1 paper)Journal of Symbolic Computation (1 paper)Lecture notes in computer science (1 paper)
- Partner nations
- Germany
In The Last Decade
Peter Padawitz
13 papers receiving 134 citations
Peers
Comparison fields: 5 of 18
- Software 30
- Computational Theory and Mathematics 108
- Artificial Intelligence 128
- Computer Networks and Communications 30
- Theoretical Computer Science 1
Countries citing papers authored by Peter Padawitz
This map shows the geographic impact of Peter Padawitz'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 Peter Padawitz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Peter Padawitz more than expected).
Fields of papers citing papers by Peter Padawitz
This network shows the impact of papers produced by Peter Padawitz. 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 Peter Padawitz. The network helps show where Peter Padawitz may publish in the future.
Co-authors
The 4 scholars most cited alongside Peter Padawitz, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 1982 | 46 | |
| 2 | 1988 | 44 | |
| 3 | 2000 | 16 | |
| 4 | Completeness of many-sorted equational logic revisited. | 1984 | 6 |
| 5 | 1996 | 6 | |
| 6 | 2000 | 5 | |
| 7 | 1982 | 5 | |
| 8 | 1987 | 4 | |
| 9 | 1992 | 4 | |
| 10 | 1979 | 4 | |
| 11 | 1988 | 4 | |
| 12 | Equational Data Type Specifications and Recursive Program Schemes. | 1982 | 3 |
| 13 | 1978 | 1 | |
| 14 | 2007 | 0 | |
| 15 | Deductive and Declarative Programming | 2009 | 0 |
About Peter Padawitz
Peter Padawitz is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications, Software and Molecular Biology, having authored 15 papers that have together received 148 indexed citations. Recurring topics across this work include Logic, programming, and type systems (11 papers), Formal Methods in Verification (9 papers), Logic, Reasoning, and Knowledge (5 papers), Advanced Database Systems and Queries (4 papers), Model-Driven Software Engineering Techniques (4 papers), Natural Language Processing Techniques (2 papers), Semantic Web and Ontologies (2 papers) and Parallel Computing and Optimization Techniques (1 paper). The work is most often cited by research in Software (30 citations), Computational Theory and Mathematics (108 citations), Artificial Intelligence (128 citations), Computer Networks and Communications (30 citations) and Theoretical Computer Science (1 citation). Peter Padawitz has collaborated with scholars based in Germany. Frequent co-authors include Hartmut Ehrig, Hans‐Jörg Kreowski, B. Mahr and Martin Wirsing. Their work appears in journals such as Theoretical Computer Science, Journal of Computer and System Sciences, Information and Computation, Journal of Symbolic Computation and Lecture notes in computer science.
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.