Klaus Aehlig
- Hardware and Architecture top 10%
-
- Formal Methods in Verification 7
- Computability, Logic, AI Algorithms 6
- Complexity and Algorithms in Graphs 1
- Mathematics, Computing, and Information Processing 1
- Software top 10%
- Software Testing and Debugging Techniques 2
- Artificial Intelligence top 10%
- Logic, programming, and type systems 14
- Logic, Reasoning, and Knowledge 11
- Cryptography and Data Security 1
- Co-authors
- Jan HoffmannMartin HofmannHelmut SchwichtenbergH. SchwichtenbergAndreas AbelPeter DybjerJan JohannsenUlrich Berger
- Journals
- Theoretical Computer Science (1 paper)ACM SIGPLAN Notices (1 paper)ACM Transactions on Programming Languages and Systems (1 paper)
- Partner nations
- GermanyUnited KingdomSweden
In The Last Decade
Klaus Aehlig
15 papers receiving 196 citations
Peers
Comparison fields: 5 of 11
- Hardware and Architecture 67
- Computational Theory and Mathematics 145
- Software 34
- Artificial Intelligence 178
- Computer Networks and Communications 35
Countries citing papers authored by Klaus Aehlig
This map shows the geographic impact of Klaus Aehlig'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 Klaus Aehlig with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Klaus Aehlig more than expected).
Fields of papers citing papers by Klaus Aehlig
This network shows the impact of papers produced by Klaus Aehlig. 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 Klaus Aehlig. The network helps show where Klaus Aehlig may publish in the future.
Co-authorship network
The 13 scholars most cited alongside Klaus Aehlig, 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 | 2015 | 0 | |
| 2 | 2012 | 3 | |
| 3 | 2012 | 53 | |
| 4 | 2011 | 47 | |
| 5 | 2011 | 54 | |
| 6 | 2009 | 1 | |
| 7 | 2008 | 1 | |
| 8 | 2008 | 1 | |
| 9 | 2007 | 9 | |
| 10 | 2005 | 3 | |
| 11 | 2005 | 2 | |
| 12 | 2004 | 15 | |
| 13 | 2004 | 4 | |
| 14 | 2003 | 8 | |
| 15 | 2002 | 7 | |
| 16 | 2002 | 4 |
About Klaus Aehlig
Klaus Aehlig is a scholar working on Computational Theory and Mathematics, Software and Artificial Intelligence, having authored 16 papers that have together received 212 indexed citations. Recurring topics across this work include Logic, programming, and type systems (14 papers), Logic, Reasoning, and Knowledge (11 papers), Formal Methods in Verification (7 papers), Computability, Logic, AI Algorithms (6 papers), Software Testing and Debugging Techniques (2 papers), Complexity and Algorithms in Graphs (1 paper), Mathematics, Computing, and Information Processing (1 paper) and Cryptography and Data Security (1 paper). The work is most often cited by research in Hardware and Architecture (67 citations), Computational Theory and Mathematics (145 citations) and Software (34 citations). Klaus Aehlig has collaborated with scholars based in Germany, United Kingdom and Sweden. Frequent co-authors include Jan Hoffmann, Martin Hofmann, Martin Hofmann, Helmut Schwichtenberg, H. Schwichtenberg, Andreas Abel, Peter Dybjer, Jan Johannsen, Ulrich Berger and Florian Haftmann. Their work appears in journals such as Theoretical Computer Science, ACM SIGPLAN Notices and ACM Transactions on Programming Languages and Systems.
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.