Peter Habermehl
- Computational Theory and Mathematics top 5%
- Artificial Intelligence top 10%
- Software top 5%
- Computer Networks and Communications
- Management Information Systems
- Co-authors
- Ahmed BouajjaniTomáš VojnarAdam RogalewiczRachid EchahedMohamed Faouzi AtigRichard MayrBenedikt BolligMartin Leucker
- Topics
- Formal Methods in Verification (16 papers)Logic, programming, and type systems (8 papers)semigroups and automata theory (7 papers)
In The Last Decade
Peter Habermehl
19 papers receiving 174 citations
Peers
Comparison fields: 5 of 27
- Computational Theory and Mathematics 156
- Artificial Intelligence 111
- Software 69
- Computer Networks and Communications 21
- Management Information Systems 15
Countries citing papers authored by Peter Habermehl
This map shows the geographic impact of Peter Habermehl'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 Habermehl with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Peter Habermehl more than expected).
Fields of papers citing papers by Peter Habermehl
This network shows the impact of papers produced by Peter Habermehl. 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 Habermehl. The network helps show where Peter Habermehl may publish in the future.
Co-authorship network of co-authors of Peter Habermehl
This figure shows the co-authorship network connecting the top 25 collaborators of Peter Habermehl. A scholar is included among the top collaborators of Peter Habermehl 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 Peter Habermehl. Peter Habermehl is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 1 | |
| 3 | 3 | |
| 4 | 1 | |
| 5 | 0 | |
| 6 | 8 | |
| 7 | Beyond Model Checking: Parameters Everywhere | 0 |
| 8 | 4 | |
| 9 | 15 | |
| 10 | 6 | |
| 11 | 17 | |
| 12 | Abstract Regular Tree Model Checking of Complex Dynamic Data Structures | 3 |
| 13 | 16 | |
| 14 | 19 | |
| 15 | Regular Model Checking Using Inference of Regular Languages. | 3 |
| 16 | 4 | |
| 17 | 11 | |
| 18 | 20 | |
| 19 | 35 | |
| 20 | 7 |
About Peter Habermehl
Peter Habermehl is a scholar working on Software, Computational Theory and Mathematics and Artificial Intelligence, having authored 22 papers that have together received 191 indexed citations. Recurring topics across this work include Formal Methods in Verification (16 papers), Logic, programming, and type systems (8 papers) and semigroups and automata theory (7 papers). The work is most often cited by research in Software (69 citations), Computational Theory and Mathematics (156 citations) and Artificial Intelligence (111 citations). Peter Habermehl has collaborated with scholars based in France, Czechia and Germany. Frequent co-authors include Ahmed Bouajjani, Tomáš Vojnar, Adam Rogalewicz, Rachid Echahed, Mohamed Faouzi Atig, Richard Mayr, Benedikt Bollig, Martin Leucker, Benjamin Monmege and Radu Iosif. Their work appears in journals such as Theoretical Computer Science, Information and Computation and Acta Informatica.
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.