Klaus Aehlig

670 total citations
16 papers, 212 citations indexed

About

Klaus Aehlig is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Software. According to data from OpenAlex, Klaus Aehlig has authored 16 papers receiving a total of 212 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Artificial Intelligence, 15 papers in Computational Theory and Mathematics and 2 papers in Software. Recurrent topics in Klaus Aehlig's work include Logic, programming, and type systems (14 papers), Logic, Reasoning, and Knowledge (11 papers) and Formal Methods in Verification (7 papers). Klaus Aehlig is often cited by papers focused on Logic, programming, and type systems (14 papers), Logic, Reasoning, and Knowledge (11 papers) and Formal Methods in Verification (7 papers). Klaus Aehlig collaborates with scholars based in Germany, United Kingdom and Sweden. Klaus Aehlig's co-authors include Jan Hoffmann, Martin Hofmann, Martin Hofmann, Helmut Schwichtenberg, H. Schwichtenberg, Andreas Abel, Peter Dybjer, Jan Johannsen, Ulrich Berger and Florian Haftmann and has published in prestigious journals such as Theoretical Computer Science, ACM SIGPLAN Notices and ACM Transactions on Programming Languages and Systems.

In The Last Decade

Klaus Aehlig

15 papers receiving 196 citations

Peers

Countries citing papers authored by Klaus Aehlig

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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 of co-authors of Klaus Aehlig

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

16 of 16 papers shown

#	Work	Indexed citations
1	Relativizing small complexity classes and their theories 2015 ·Computational Complexity ·Klaus Aehlig, Stephen Cook, (unknown)	0
2	A compiled implementation of normalisation by evaluation 2012 ·Journal of Functional Programming ·Klaus Aehlig, Florian Haftmann, Tobias Nipkow	3
3	Multivariate amortized resource analysis 2012 ·ACM Transactions on Programming Languages and Systems ·Jan Hoffmann, Klaus Aehlig, Martin Hofmann	53
4	Multivariate amortized resource analysis 2011 ·ACM SIGPLAN Notices ·Jan Hoffmann, Klaus Aehlig, Martin Hofmann	47
5	Multivariate amortized resource analysis 2011 ·Jan Hoffmann, Klaus Aehlig, Martin Hofmann	54
6	On the computational complexity of cut-reduction 2009 ·Annals of Pure and Applied Logic ·Klaus Aehlig, Arnold Beckmann	1
7	Parameter-free polymorphic types 2008 ·Annals of Pure and Applied Logic ·Klaus Aehlig	1
8	On the Computational Complexity of Cut-Reduction 2008 ·Klaus Aehlig, Arnold Beckmann	1
9	Normalization by Evaluation for Martin-Löf Type Theory with One Universe 2007 ·Electronic Notes in Theoretical Computer Science ·Andreas Abel, Klaus Aehlig, Peter Dybjer	9
10	An elementary fragment of second-order lambda calculus 2005 ·ACM Transactions on Computational Logic ·Klaus Aehlig, Jan Johannsen	3
11	Induction and inductive definitions in fragments of second order arithmetic 2005 ·Journal of Symbolic Logic ·Klaus Aehlig	2
12	Operational aspects of untyped Normalisation by Evaluation 2004 ·Mathematical Structures in Computer Science ·Klaus Aehlig, (unknown)	15
13	Continuous normalization for the lambda-calculus and Gödel’s T 2004 ·Annals of Pure and Applied Logic ·Klaus Aehlig, (unknown)	4
14	An arithmetic for non-size-increasing polynomial-time computation 2003 ·Theoretical Computer Science ·Klaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg	8
15	A syntactical analysis of non-size-increasing polynomial time computation 2002 ·Klaus Aehlig, H. Schwichtenberg	7
16	A syntactical analysis of non-size-increasing polynomial time computation 2002 ·ACM Transactions on Computational Logic ·Klaus Aehlig, Helmut Schwichtenberg	4

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