Klaus Aehlig - RankMe

31 papers A* 4B 6Journal 18Unranked 3

Year	Rank	Type	Title / Venue / Authors
2016	J	`jnl`	Relativizing small complexity classes and their theories. Comput. Complex. Klaus Aehlig, Stephen A. Cook, Phuong Nguyen
2012	J	`jnl`	A compiled implementation of normalisation by evaluation. J. Funct. Program. Klaus Aehlig, Florian Haftmann, Tobias Nipkow
2012	J	`jnl`	Multivariate amortized resource analysis. ACM Trans. Program. Lang. Syst. Jan Hoffmann, Klaus Aehlig, Martin Hofmann
2012	J	`jnl`	Relativizing Small Complexity Classes and their Theories CoRR Klaus Aehlig, Stephen A. Cook, Phuong Nguyen
2012	A*	`conf`	Resource Aware ML. CAV Jan Hoffmann, Klaus Aehlig, Martin Hofmann
2011	A*	`conf`	Multivariate amortized resource analysis. POPL Jan Hoffmann, Klaus Aehlig, Martin Hofmann
2010	J	`jnl`	On the computational complexity of cut-reduction. Ann. Pure Appl. Log. Klaus Aehlig, Arnold Beckmann
2008	—	`conf`	A Compiled Implementation of Normalization by Evaluation. TPHOLs Klaus Aehlig, Florian Haftmann, Tobias Nipkow
2008	J	`jnl`	Normalization by Evaluation. Arch. Formal Proofs Klaus Aehlig, Tobias Nipkow
2008	A*	`conf`	On the Computational Complexity of Cut-Reduction. LICS Klaus Aehlig, Arnold Beckmann
2008	J	`jnl`	Parameter-free polymorphic types. Ann. Pure Appl. Log. Klaus Aehlig
2007	J	`jnl`	A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata CoRR Klaus Aehlig
2007	J	`jnl`	A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata. Log. Methods Comput. Sci. Klaus Aehlig
2007	B	`conf`	Normalization by Evaluation for Martin-Löf Type Theory with One Universe. MFPS Andreas Abel, Klaus Aehlig, Peter Dybjer
2007	J	`jnl`	On the computational complexity of cut-reduction CoRR Klaus Aehlig, Arnold Beckmann
2007	B	`conf`	Propositional Logic for Circuit Classes. CSL Klaus Aehlig, Arnold Beckmann
2007	B	`conf`	Relativizing Small Complexity Classes and Their Theories. CSL Klaus Aehlig, Stephen A. Cook, Phuong Nguyen
2006	B	`conf`	A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata. CSL Klaus Aehlig
2005	J	`jnl`	An elementary fragment of second-order lambda calculus. ACM Trans. Comput. Log. Klaus Aehlig, Jan Johannsen
2005	J	`jnl`	Continuous normalization for the lambda-calculus and Gödel's. Ann. Pure Appl. Log. Klaus Aehlig, Felix Joachimski
2005	J	`jnl`	Induction and inductive definitions in fragments of second order arithmetic. J. Symb. Log. Klaus Aehlig
2005	B	`conf`	Safety Is not a Restriction at Level 2 for String Languages. FoSSaCS Klaus Aehlig, Jolie G. de Miranda, C.-H. Luke Ong
2005	—	`conf`	The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable. TLCA Klaus Aehlig, Jolie G. de Miranda, C.-H. Luke Ong
2004	J	`jnl`	An arithmetic for non-size-increasing polynomial-time computation. Theor. Comput. Sci. Klaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg
2004	J	`jnl`	Operational aspects of untyped Normalisation by Evaluation. Math. Struct. Comput. Sci. Klaus Aehlig, Felix Joachimski
2002	J	`jnl`	A syntactical analysis of non-size-increasing polynomial time computation. ACM Trans. Comput. Log. Klaus Aehlig, Helmut Schwichtenberg
2002	J	`jnl`	An Elementary Fragment of Second-Order Lambda Calculus CoRR Klaus Aehlig, Jan Johannsen
2002	B	`conf`	On Continuous Normalization. CSL Klaus Aehlig, Felix Joachimski
2001	—	`conf`	Linear Ramified Higher Type Recursion and Parallel Complexity. Proof Theory in Computer Science Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn
2000	A*	`conf`	A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation. LICS Klaus Aehlig, Helmut Schwichtenberg
2000	J	`jnl`	A syntactical analysis of non-size-increasing polynomial time computation CoRR Klaus Aehlig, Helmut Schwichtenberg