|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 15 occurrences of 10 keywords
|
|
|
|
|
Results
Found 27 publication records. Showing 27 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Klaus Aehlig, Stephen A. Cook, Phuong Nguyen |
Relativizing Small Complexity Classes and their Theories  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Jan Hoffmann 0002, Klaus Aehlig, Martin Hofmann |
Multivariate amortized resource analysis.  |
POPL  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Aehlig, Arnold Beckmann |
On the computational complexity of cut-reduction.  |
Ann. Pure Appl. Logic  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Aehlig |
Parameter-free polymorphic types.  |
Ann. Pure Appl. Logic  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Aehlig, Tobias Nipkow |
Normalization by Evaluation.  |
Archive of Formal Proofs  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Klaus Aehlig, Florian Haftmann, Tobias Nipkow |
A Compiled Implementation of Normalization by Evaluation.  |
TPHOLs  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Aehlig, Arnold Beckmann |
On the Computational Complexity of Cut-Reduction.  |
LICS  |
2008 |
DBLP DOI BibTeX RDF |
cut-reduction, proof notations, propositional logic, Bounded Arithmetic |
| 1 | Klaus Aehlig |
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata.  |
Logical Methods in Computer Science  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Abel, Klaus Aehlig, Peter Dybjer |
Normalization by Evaluation for Martin-Löf Type Theory with One Universe.  |
Electr. Notes Theor. Comput. Sci.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Aehlig |
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata  |
CoRR  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Klaus Aehlig, Arnold Beckmann |
On the computational complexity of cut-reduction  |
CoRR  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Klaus Aehlig, Arnold Beckmann |
Propositional Logic for Circuit Classes.  |
CSL  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Aehlig, Stephen A. Cook, Phuong Nguyen |
Relativizing Small Complexity Classes and Their Theories.  |
CSL  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Aehlig |
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata.  |
CSL  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Aehlig |
Induction and inductive definitions in fragments of second order arithmetic.  |
J. Symb. Log.  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Klaus Aehlig, Felix Joachimski |
Continuous normalization for the lambda-calculus and Gödel's.  |
Ann. Pure Appl. Logic  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Aehlig, Jan Johannsen |
An elementary fragment of second-order lambda calculus.  |
ACM Trans. Comput. Log.  |
2005 |
DBLP DOI BibTeX RDF |
Elementary recursive functions, complexity, lambda calculus, second order logic |
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Aehlig, Jolie G. de Miranda, C.-H. Luke Ong |
Safety Is not a Restriction at Level 2 for String Languages.  |
FoSSaCS  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg |
An arithmetic for non-size-increasing polynomial-time computation.  |
Theor. Comput. Sci.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Aehlig, Felix Joachimski |
Operational aspects of untyped Normalisation by Evaluation.  |
Mathematical Structures in Computer Science  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Aehlig, Jan Johannsen |
An Elementary Fragment of Second-Order Lambda Calculus  |
CoRR  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Klaus Aehlig, Helmut Schwichtenberg |
A syntactical analysis of non-size-increasing polynomial time computation.  |
ACM Trans. Comput. Log.  |
2002 |
DBLP DOI BibTeX RDF |
Complexity, linear logic, lambda calculus |
| 1 | Klaus Aehlig, Felix Joachimski |
On Continuous Normalization.  |
CSL  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn |
Linear Ramified Higher Type Recursion and Parallel Complexity.  |
Proof Theory in Computer Science  |
2001 |
DBLP DOI BibTeX RDF |
higher types, parallel computation, recursion, linear logic, lambda calculus, implicit computational complexity, NC |
| 1 | Klaus Aehlig, Helmut Schwichtenberg |
A syntactical analysis of non-size-increasing polynomial time computation  |
CoRR  |
2000 |
DBLP BibTeX RDF |
|
| 1 | Klaus Aehlig, Helmut Schwichtenberg |
A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation.  |
LICS  |
2000 |
DBLP DOI BibTeX RDF |
affine linear typing, polynomial time computation, lambda-calculus |
Displaying result #1 - #27 of 27 (100 per page; Change: )
|
|