The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Helmut Schwichtenberg: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Helmut Schwichtenberg
    Proof Search in Minimal Logic. [Citation Graph (0, 0)][DBLP]
    AISC, 2004, pp:15-25 [Conf]
  2. Helmut Schwichtenberg
    Ein einfaches Verfahren zur Normalisierung unendlicher Herleitungen. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:334-348 [Conf]
  3. Helmut Schwichtenberg
    Inverting Monotone Continuous Functions in Constructive Analysis. [Citation Graph (0, 0)][DBLP]
    CiE, 2006, pp:490-504 [Conf]
  4. Helmut Schwichtenberg
    Minimal from Classical Proofs. [Citation Graph (0, 0)][DBLP]
    CSL, 1991, pp:326-328 [Conf]
  5. Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn
    Linear Ramified Higher Type Recursion and Parallel Complexity. [Citation Graph (0, 0)][DBLP]
    Proof Theory in Computer Science, 2001, pp:1-21 [Conf]
  6. Ulrich Berger, Helmut Schwichtenberg
    Program Extraction from Classical Proofs. [Citation Graph (0, 0)][DBLP]
    LCC, 1994, pp:77-97 [Conf]
  7. Klaus Aehlig, Helmut Schwichtenberg
    A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:84-91 [Conf]
  8. Ulrich Berger, Helmut Schwichtenberg
    An Inverse of the Evaluation Functional for Typed lambda-calculus [Citation Graph (0, 0)][DBLP]
    LICS, 1991, pp:203-211 [Conf]
  9. Ulrich Berger, Matthias Eberl, Helmut Schwichtenberg
    Normalisation by Evaluation. [Citation Graph (0, 0)][DBLP]
    Prospects for Hardware Foundations, 1998, pp:117-137 [Conf]
  10. Jaco van de Pol, Helmut Schwichtenberg
    Strict Functionals for Termination Proofs. [Citation Graph (0, 0)][DBLP]
    TLCA, 1995, pp:350-364 [Conf]
  11. Helmut Schwichtenberg
    Minlog. [Citation Graph (0, 0)][DBLP]
    The Seventeen Provers of the World, 2006, pp:151-157 [Conf]
  12. Ulrich Berger, Helmut Schwichtenberg
    The Greatest Common Divisor: A Case Study for Program Extraction from Classical Proofs. [Citation Graph (0, 0)][DBLP]
    TYPES, 1995, pp:36-46 [Conf]
  13. Stephen J. Bellantoni, Karl-Heinz Niggl, Helmut Schwichtenberg
    Higher type recursion, ramification and polynomial time. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:104, n:1-3, pp:17-30 [Journal]
  14. Ulrich Berger, Wilfried Buchholz, Helmut Schwichtenberg
    Refined program extraction form classical proofs. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2002, v:114, n:1-3, pp:3-25 [Journal]
  15. Helmut Schwichtenberg
    Finite Notations for Infinite Terms. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:201-222 [Journal]
  16. Klaus Aehlig, Helmut Schwichtenberg
    A syntactical analysis of non-size-increasing polynomial time computation [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  17. Ulrich Berger, Matthias Eberl, Helmut Schwichtenberg
    Term rewriting for normalization by evaluation. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:183, n:1, pp:19-42 [Journal]
  18. Ulrich Berger, Helmut Schwichtenberg, Monika Seisenberger
    The Warshall Algorithm and Dickson?s Lemma: Two Examples of Realistic Program Extraction. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2001, v:26, n:2, pp:205-221 [Journal]
  19. Helmut Schwichtenberg
    On Bar Recursion of Types 0 and 1. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1979, v:44, n:3, pp:325-329 [Journal]
  20. Helmut Schwichtenberg
    A Direct Proof of the Equivalence between Brouwer's Fan Theorem and König's Lemma with a Uniqueness Hypothesis. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2005, v:11, n:12, pp:2086-2095 [Journal]
  21. Ulrich Berger, Stefan Berghofer, Pierre Letouzey, Helmut Schwichtenberg
    Program Extraction from Normalization Proofs. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2006, v:82, n:1, pp:25-49 [Journal]
  22. Helmut Schwichtenberg
    Monotone Majorizable Functionals. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 1999, v:62, n:2, pp:283-289 [Journal]
  23. Klaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg
    An arithmetic for non-size-increasing polynomial-time computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:318, n:1-2, pp:3-27 [Journal]
  24. Helmut Schwichtenberg
    An arithmetic for polynomial-time computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:357, n:1-3, pp:202-214 [Journal]
  25. Helmut Schwichtenberg
    Termination of Permutative Conversions in Intuitionistic Gentzen Calculi. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:212, n:1-2, pp:247-260 [Journal]
  26. Klaus Aehlig, Helmut Schwichtenberg
    A syntactical analysis of non-size-increasing polynomial time computation. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2002, v:3, n:3, pp:383-401 [Journal]

Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002