Travelled to:
1 × Hungary
1 × Japan
1 × Switzerland
2 × United Kingdom
4 × USA
Collaborated with:
A.Beckmann J.Hoffmann M.Hofmann J.G.d.Miranda C.L.Ong ∅ F.Joachimski H.Schwichtenberg S.A.Cook P.Nguyen
Talks about:
resourc (2) complex (2) analysi (2) theori (2) comput (2) level (2) class (2) multivari (1) arbitrari (1) restrict (1)
Person: Klaus Aehlig
DBLP: Aehlig:Klaus
Contributed to:
Wrote 10 papers:
- CAV-2012-0002AH #ml
- Resource Aware ML (JH, KA, MH), pp. 781–786.
- POPL-2011-HoffmannAH #analysis #multi
- Multivariate amortized resource analysis (JH, KA, MH), pp. 357–370.
- LICS-2008-AehligB #complexity #on the
- On the Computational Complexity of Cut-Reduction (KA, AB), pp. 284–293.
- CSL-2007-AehligB #logic
- Propositional Logic for Circuit Classes (KA, AB), pp. 512–526.
- CSL-2007-AehligCN #complexity
- Relativizing Small Complexity Classes and Their Theories (KA, SAC, PN), pp. 374–388.
- CSL-2006-Aehlig #automaton #finite #infinity #semantics
- A Finite Semantics of Simply-Typed λ Terms for Infinite Runs of Automata (KA), pp. 104–118.
- FoSSaCS-2005-AehligMO #safety #strict #string
- Safety Is not a Restriction at Level 2 for String Languages (KA, JGdM, CHLO), pp. 490–504.
- TLCA-2005-AehligMO #decidability #higher-order #monad #recursion
- The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable (KA, JGdM, CHLO), pp. 39–54.
- CSL-2002-AehligJ #normalisation #on the
- On Continuous Normalization (KA, FJ), pp. 59–73.
- LICS-2000-AehligS #analysis #polynomial
- A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation (KA, HS), pp. 84–91.