Klaus Aehlig - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2016

Relativizing small complexity classes and their theoriesKlaus Aehlig, Stephen A. Cook, Phuong Nguyen. cc, 25(1):177-215, 2016. [doi]

2012

Multivariate amortized resource analysisJan Hoffmann 0002, Klaus Aehlig, Martin Hofmann. TOPLAS, 34(3):14, 2012. [doi]

Resource Aware MLJan Hoffmann 0002, Klaus Aehlig, Martin Hofmann. cav 2012: 781-786 [doi]

A compiled implementation of normalisation by evaluationKlaus Aehlig, Florian Haftmann, Tobias Nipkow. JFP, 22(1):9-30, 2012. [doi]

2011

Multivariate amortized resource analysisJan Hoffmann 0002, Klaus Aehlig, Martin Hofmann. POPL 2011: 357-370 [doi]

2010

On the computational complexity of cut-reductionKlaus Aehlig, Arnold Beckmann. APAL, 161(6):711-736, 2010. [doi]

2008

2007

2006

A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of AutomataKlaus Aehlig. csl 2006: 104-118 [doi]

2005

2004

Operational aspects of untyped Normalisation by EvaluationKlaus Aehlig, Felix Joachimski. mscs, 14(4):587-611, 2004. [doi]

An arithmetic for non-size-increasing polynomial-time computationKlaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg. TCS, 318(1-2):3-27, 2004. [doi]

2002

On Continuous NormalizationKlaus Aehlig, Felix Joachimski. csl 2002: 59-73 [doi]

A syntactical analysis of non-size-increasing polynomial time computationKlaus Aehlig, Helmut Schwichtenberg. tocl, 3(3):383-401, 2002. [doi]

2001

Linear Ramified Higher Type Recursion and Parallel ComplexityKlaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn. Dagstuhl 2001: 1-21 [doi]

2000

A Syntactical Analysis of Non-Size-Increasing Polynomial Time ComputationKlaus Aehlig, Helmut Schwichtenberg. lics 2000: 84-91 [doi]

Sign in or sign up to see more results.

runs on WebDSL