Klaus Aehlig

	2008
22		Klaus Aehlig, Arnold Beckmann: On the Computational Complexity of Cut-Reduction. LICS 2008: 284-293
21		Klaus Aehlig, Florian Haftmann, Tobias Nipkow: A Compiled Implementation of Normalization by Evaluation. TPHOLs 2008: 39-54
20		Klaus Aehlig: Parameter-free polymorphic types. Ann. Pure Appl. Logic 156(1): 3-12 (2008)
	2007
19		Klaus Aehlig, Stephen Cook, Phuong Nguyen: Relativizing Small Complexity Classes and Their Theories. CSL 2007: 374-388
18		Klaus Aehlig, Arnold Beckmann: Propositional Logic for Circuit Classes. CSL 2007: 512-526
17		Klaus Aehlig: A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of<br> Automata CoRR abs/0706.2076: (2007)
16		Klaus Aehlig, Arnold Beckmann: On the computational complexity of cut-reduction CoRR abs/0712.1499: (2007)
15		Andreas Abel, Klaus Aehlig, Peter Dybjer: Normalization by Evaluation for Martin-Löf Type Theory with One Universe. Electr. Notes Theor. Comput. Sci. 173: 17-39 (2007)
14		Klaus Aehlig: A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata. Logical Methods in Computer Science 3(3): (2007)
	2006
13		Klaus Aehlig: A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata. CSL 2006: 104-118
	2005
12		Klaus Aehlig, Jolie G. de Miranda, C.-H. Luke Ong: Safety Is not a Restriction at Level 2 for String Languages. FoSSaCS 2005: 490-504
11		Klaus Aehlig, Jolie G. de Miranda, C.-H. Luke Ong: The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable. TLCA 2005: 39-54
10		Klaus Aehlig, Jan Johannsen: An elementary fragment of second-order lambda calculus. ACM Trans. Comput. Log. 6(2): 468-480 (2005)
9		Klaus Aehlig, Felix Joachimski: Continuous normalization for the lambda-calculus and Gödel's. Ann. Pure Appl. Logic 133(1-3): 39-71 (2005)
	2004
8		Klaus Aehlig, Felix Joachimski: Operational aspects of untyped Normalisation by Evaluation. Mathematical Structures in Computer Science 14(4): 587-611 (2004)
7		Klaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg: An arithmetic for non-size-increasing polynomial-time computation. Theor. Comput. Sci. 318(1-2): 3-27 (2004)
	2002
6		Klaus Aehlig, Felix Joachimski: On Continuous Normalization. CSL 2002: 59-73
5		Klaus Aehlig, Helmut Schwichtenberg: A syntactical analysis of non-size-increasing polynomial time computation. ACM Trans. Comput. Log. 3(3): 383-401 (2002)
4		Klaus Aehlig, Jan Johannsen: An Elementary Fragment of Second-Order Lambda Calculus CoRR cs.LO/0210022: (2002)
	2001
3		Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn: Linear Ramified Higher Type Recursion and Parallel Complexity. Proof Theory in Computer Science 2001: 1-21
	2000
2		Klaus Aehlig, Helmut Schwichtenberg: A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation. LICS 2000: 84-91
1		Klaus Aehlig, Helmut Schwichtenberg: A syntactical analysis of non-size-increasing polynomial time computation CoRR cs.LO/0011037: (2000)

Coauthor Index

1	Andreas Abel	[15]
2	Arnold Beckmann	[16] [18] [22]
3	Ulrich Berger	[7]
4	Stephen Cook	[19]
5	Peter Dybjer	[15]
6	Florian Haftmann	[21]
7	Martin Hofmann	[7]
8	Felix Joachimski	[6] [8] [9]
9	Jan Johannsen	[3] [4] [10]
10	Jolie G. de Miranda	[11] [12]
11	Phuong Nguyen	[19]
12	Tobias Nipkow	[21]
13	C.-H. Luke Ong	[11] [12]
14	Helmut Schwichtenberg	[1] [2] [3] [5] [7]
15	Sebastiaan Terwijn	[3]

Colors in the list of coauthors