dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Klaus Aehlig Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Aehlig, Stephen A. Cook, Phuong Nguyen: Relativizing Small Complexity Classes and their Theories CoRR abs/1204.5508: (2012)
2011
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Hoffmann, Klaus Aehlig, Martin Hofmann: Multivariate amortized resource analysis. POPL 2011: 357-370
2010
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Aehlig, Arnold Beckmann: On the computational complexity of cut-reduction. Ann. Pure Appl. Logic 161(6): 711-736 (2010)
2008
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Aehlig, Arnold Beckmann: On the Computational Complexity of Cut-Reduction. LICS 2008: 284-293
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Aehlig, Florian Haftmann, Tobias Nipkow: A Compiled Implementation of Normalization by Evaluation. TPHOLs 2008: 39-54
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Aehlig: Parameter-free polymorphic types. Ann. Pure Appl. Logic 156(1): 3-12 (2008)
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Aehlig, Tobias Nipkow: Normalization by Evaluation. Archive of Formal Proofs 2008: (2008)
2007
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Aehlig, Stephen A. Cook, Phuong Nguyen: Relativizing Small Complexity Classes and Their Theories. CSL 2007: 374-388
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Aehlig, Arnold Beckmann: Propositional Logic for Circuit Classes. CSL 2007: 512-526
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Aehlig: A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata CoRR abs/0706.2076: (2007)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Aehlig, Arnold Beckmann: On the computational complexity of cut-reduction CoRR abs/0712.1499: (2007)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas Abel, Klaus Aehlig, Peter Dybjer: Normalization by Evaluation for Martin-Löf Type Theory with One Universe. Electr. Notes Theor. Comput. Sci. 173: 17-39 (2007)
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Aehlig: A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata. Logical Methods in Computer Science 3(3): (2007)
2006
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Aehlig: A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata. CSL 2006: 104-118
2005
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Aehlig, Jolie G. de Miranda, C.-H. Luke Ong: Safety Is not a Restriction at Level 2 for String Languages. FoSSaCS 2005: 490-504
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus 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: 39-54
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Aehlig, Jan Johannsen: An elementary fragment of second-order lambda calculus. ACM Trans. Comput. Log. 6(2): 468-480 (2005)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Aehlig, Felix Joachimski: Continuous normalization for the lambda-calculus and Gödel's. Ann. Pure Appl. Logic 133(1-3): 39-71 (2005)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Aehlig: Induction and inductive definitions in fragments of second order arithmetic. J. Symb. Log. 70(4): 1087-1107 (2005)
2004
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Aehlig, Felix Joachimski: Operational aspects of untyped Normalisation by Evaluation. Mathematical Structures in Computer Science 14(4): 587-611 (2004)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg: An arithmetic for non-size-increasing polynomial-time computation. Theor. Comput. Sci. 318(1-2): 3-27 (2004)
2002
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Aehlig, Felix Joachimski: On Continuous Normalization. CSL 2002: 59-73
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Aehlig, Helmut Schwichtenberg: A syntactical analysis of non-size-increasing polynomial time computation. ACM Trans. Comput. Log. 3(3): 383-401 (2002)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Aehlig, Jan Johannsen: An Elementary Fragment of Second-Order Lambda Calculus CoRR cs.LO/0210022: (2002)
2001
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn: Linear Ramified Higher Type Recursion and Parallel Complexity. Proof Theory in Computer Science 2001: 1-21
2000
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Aehlig, Helmut Schwichtenberg: A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation. LICS 2000: 84-91
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKlaus Aehlig, Helmut Schwichtenberg: A syntactical analysis of non-size-increasing polynomial time computation CoRR cs.LO/0011037: (2000)

Coauthor Index

1Andreas Abel [16]
2Arnold Beckmann [17] [19] [24] [25]
3Ulrich Berger [7]
4Stephen A. Cook [20] [27]
5Peter Dybjer [16]
6Florian Haftmann [23]
7Jan Hoffmann [26]
8Martin Hofmann [7] [26]
9Felix Joachimski [6] [8] [10]
10Jan Johannsen [3] [4] [11]
11Jolie G. de Miranda [12] [13]
12Phuong Nguyen [20] [27]
13Tobias Nipkow [21] [23]
14C.-H. Luke Ong [12] [13]
15Helmut Schwichtenberg [1] [2] [3] [5] [7]
16Sebastiaan Terwijn (Sebastiaan A. Terwijn) [3]

Colors in the list of coauthors

Last update Sat May 26 04:23:17 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page