Arnold Beckmann

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Klaus Aehlig

> Home > Persons > Arnold Beckmann

Publications

2010
[j23]
- view
  authority control:
- export record
  dblp key:
  - journals/apal/AehligB10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/apal/AehligB10
Klaus Aehlig, Arnold Beckmann:
On the computational complexity of cut-reduction. Ann. Pure Appl. Log. 161(6): 711-736 (2010)
2008
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/lics/AehligB08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lics/AehligB08
Klaus Aehlig, Arnold Beckmann:
On the Computational Complexity of Cut-Reduction. LICS 2008: 284-293
2007
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/csl/AehligB07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/csl/AehligB07
Klaus Aehlig, Arnold Beckmann:
Propositional Logic for Circuit Classes. CSL 2007: 512-526
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-0712-1499
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0712-1499
Klaus Aehlig, Arnold Beckmann:
On the computational complexity of cut-reduction. CoRR abs/0712.1499 (2007)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.