Author|Conference|Journal|Year
Look for results that meet for the following criteria:
View Top Co-Authors In Visual Explorer
Klaus Aehlig

Top Co-Authors:

ObjectID : Author/1182108
Klaus Aehlig
Embed Subscribe

Publications: 25
|
Citations: 74
|
G-Index: 7
|
H-Index: 6
Research Interest: Algorithms and Theory, Software Engineering & Programming Languages, Real-Time and Embedded Systems
Mathematisches Institut, Universität München, Theresienstraße 39, 80333, München, Germany
Order by: Year|Citation|Rank
The rank of a paper is calculated by considering the authors, the published conference or journal, and its citation graph. The highest ranking result will appear first.                   Learn more
Year 2008
Klaus Aehlig, Arnold Beckmann :
On the Computational Complexity of Cut-Reduction
, LICS
, 2008
(Citations: 1)
Klaus Aehlig, Florian Haftmann, Tobias Nipkow :
A Compiled Implementation of Normalization by Evaluation
, TPHOLs
, 2008
Klaus Aehlig :
Parameter-free polymorphic types
, APAL
, 2008
Year 2007
Andreas Abel, Klaus Aehlig, Peter Dybjer :
Normalization by Evaluation for Martin-Löf Type Theory with One Universe
, ENTCS
, 2007
(Citations: 5)
Klaus Aehlig :
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of<br> Automata
, CORR
, 2007
(Citations: 4)
Klaus Aehlig, Arnold Beckmann :
On the computational complexity of cut-reduction
, CORR
, 2007
(Citations: 1)
Klaus Aehlig, Stephen Cook, Phuong Nguyen :
Relativizing Small Complexity Classes and Their Theories
, CSL
, 2007
Klaus Aehlig, Arnold Beckmann :
Propositional Logic for Circuit Classes
, CSL
, 2007
Year 2006
Klaus Aehlig :
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
, CSL
, 2006
Year 2005
Klaus Aehlig, Jolie G. De Miranda, C.h. Luke Ong :
Safety Is not a Restriction at Level 2 for String Languages
, FoSSaCS
, 2005
(Citations: 10)
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
(Citations: 11)
Klaus Aehlig, Felix Joachimski :
Continuous normalization for the lambda-calculus and Gödel's
, APAL
, 2005
(Citations: 2)
Klaus Aehlig, Jan Johannsen :
An elementary fragment of second-order lambda calculus
, TOCL
, 2005
(Citations: 1)
Year 2004
Klaus Aehlig, Felix Joachimski :
Operational aspects of untyped Normalisation by Evaluation
, MSCS
, 2004
(Citations: 6)
Klaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg :
An arithmetic for non-size-increasing polynomial-time computation
, TCS
, 2004
(Citations: 3)
K. Aehlig, T. Knapik, De Miranda J. G, D. Niwi'nski, L. Ong, P. Urzyczyn, I. Walukiewicz :
TYPES] Paper announcements: MSO theory of hy-peralgebraic trees is decidable
, 2004
(Citations: 1)
Year 2002
Klaus Aehlig, Felix Joachimski :
On Continuous Normalization
, CSL
, 2002
(Citations: 6)
Klaus Aehlig, Helmut Schwichtenberg :
A syntactical analysis of non-size-increasing polynomial time computation
, TOCL
, 2002
(Citations: 6)
Klaus Aehlig, Jan Johannsen :
An Elementary Fragment of Second-Order Lambda Calculus
, CORR
, 2002
Klaus Aehlig, Felix Joachimski :
A Note on B\
, 2002
Year 2001
Klaus Aehlig, Felix Joachimski :
Operational Aspects of Normalization by Evaluation
, 2001
(Citations: 3)
Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn :
Linear Ramified Higher Type Recursion and Parallel Complexity
, Dagstuhl Seminars
, 2001
(Citations: 2)
Year 2000
Klaus Aehlig, Helmut Schwichtenberg :
A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation
, LICS
, 2000
(Citations: 11)
Klaus Aehlig, Helmut Schwichtenberg :
A symtactical amalysis of mom-size-imcreasimg polymomial time computatiom
, 2000
(Citations: 1)
Year Unknown
Klaus Aehlig :
On Fragments of Analysis with Strengths of Finitely Iterated Inductive Definitions
Microsoft Research Asia | Help | Feedback | Specific Terms
©2010 Microsoft Corporation. All rights reserved. Terms of Use | Trademarks | Privacy Statement