Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Aehlig, Klaus T. - Institut für Informatik, Ludwig-Maximilians-Universität München
Propositional Logic for Circuit Classes Klaus Aehlig1
On the Computational Complexity of Cut-Reduction Klaus Aehlig Arnold Beckmann
The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion
Linear Ramified Higher Type Recursion and Parallel Complexity
Parameter-Free Polymorphic Types Klaus Aehlig 1
Normalization by Evaluation Does not Need Klaus Aehlig \Lambda
A logic for nonincreasing PTIME computation Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg
Safety is Not a Restriction at Level 2 for String Languages ?
Logical Methods in Computer Science Vol. 3 (3:?) 2007, pp. 1--22
An Elementary Fragment of Second-Order Lambda KLAUS AEHLIG
Klaus Aehlig On Fragments of Analysis
A syntactical analysis of nonsizeincreasing polynomial time computation Klaus Aehlig Helmut Schwichtenberg
A Compiled Implementation of Normalization by Evaluation
Programmextraktion f ur nichtwachsende Polynomialzeitberechnungen
An arithmetic for nonsizeincreasing polynomialtime computation Klaus Aehlig \Lambda
On the computational complexity of cutreduction
An arithmetic for nonsizeincreasing polynomialtime computation Klaus Aehlig \Lambda
Continuous Normalization for the Lambda-Calculus and Godel's T
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
Multivariate Amortized Resource Analysis Jan Hoffmann Klaus Aehlig Martin Hofmann
Einf uhrung in den #Kalk ul Klaus Aehlig Thomas Fischbacher
On Continuous Normalization Klaus Aehlig ? and Felix Joachimski
Induction and Inductive Definitions in Fragments of Second Order Arithmetic
Parallel Time and Proof Complexity Klaus Aehlig
Relativizing Small Complexity Classes and their Klaus Aehlig , Stephen Cook, and Phuong Nguyen
INSTITUT FUR INFORMATIK der Ludwig-Maximilians-Universitat Munchen
Under consideration for publication in Math. Struct. in Comp. Science Operational Aspects of Untyped
A Finite Semantics of SimplyTyped Lambda Terms for Infinite Runs of Automata
Parallel Time and Proof Complexity Klaus Aehlig
Klaus Aehlig Mathematisches Institut
