The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Karl-Heinz Niggl: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Karl-Heinz Niggl
    Control structures in programs and computational complexity. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:133, n:1-3, pp:247-273 [Journal]
  3. Karl-Heinz Niggl
    Towards the Computational Complexity of PRomega-Terms. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1995, v:75, n:1-2, pp:153-178 [Journal]
  4. Karl-Heinz Niggl
    Momega Considered as a Programming Language. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1999, v:99, n:1-3, pp:73-92 [Journal]
  5. Lars Kristiansen, Karl-Heinz Niggl
    The Garland Measure and Computational Complexity of Stack Programs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:90, n:1, pp:- [Journal]
  6. Karl-Heinz Niggl
    Characterizing polytime through higher type recursion. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal]
  7. Stephen J. Bellantoni, Karl-Heinz Niggl
    Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:401-415 [Journal]
  8. Karl-Heinz Niggl, Henning Wunderlich
    Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:5, pp:1122-1147 [Journal]
  9. Ulrich Berger, Karl-Heinz Niggl, Bernhard Reus
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:264, n:2, pp:169- [Journal]
  10. Lars Kristiansen, Karl-Heinz Niggl
    On the computational complexity of imperative programming languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:318, n:1-2, pp:139-161 [Journal]

  11. Non-definability of the Ackermann function with type 1 partial primitive recursion. [Citation Graph (, )][DBLP]


  12. A restricted computation model on Scott domains and its partial primitive recursive functionals. [Citation Graph (, )][DBLP]


  13. Subrecursive functions on partial sequences. [Citation Graph (, )][DBLP]


  14. The m\mu-measure as a tool for classifying computational complexity. [Citation Graph (, )][DBLP]


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