| |
| 2006 | ||
|---|---|---|
| 14 | EE | Karl-Heinz Niggl, Henning Wunderlich: Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs. SIAM J. Comput. 35(5): 1122-1147 (2006) |
| 2005 | ||
| 13 | EE | Karl-Heinz Niggl: Control structures in programs and computational complexity. Ann. Pure Appl. Logic 133(1-3): 247-273 (2005) |
| 2004 | ||
| 12 | EE | Lars Kristiansen, Karl-Heinz Niggl: On the computational complexity of imperative programming languages. Theor. Comput. Sci. 318(1-2): 139-161 (2004) |
| 2003 | ||
| 11 | EE | Lars Kristiansen, Karl-Heinz Niggl: The Garland Measure and Computational Complexity of Stack Programs. Electr. Notes Theor. Comput. Sci. 90(1): (2003) |
| 2001 | ||
| 10 | EE | Ulrich Berger, Karl-Heinz Niggl, Bernhard Reus: Preface. Theor. Comput. Sci. 264(2): 169 (2001) |
| 2000 | ||
| 9 | Stephen J. Bellantoni, Karl-Heinz Niggl, Helmut Schwichtenberg: Higher type recursion, ramification and polynomial time. Ann. Pure Appl. Logic 104(1-3): 17-30 (2000) | |
| 8 | EE | Karl-Heinz Niggl: The m\mu-measure as a tool for classifying computational complexity. Arch. Math. Log. 39(7): 515-539 (2000) |
| 7 | EE | Karl-Heinz Niggl: Characterizing polytime through higher type recursion. Electr. Notes Theor. Comput. Sci. 35: (2000) |
| 1999 | ||
| 6 | Karl-Heinz Niggl: Momega Considered as a Programming Language. Ann. Pure Appl. Logic 99(1-3): 73-92 (1999) | |
| 5 | EE | Karl-Heinz Niggl: Subrecursive functions on partial sequences. Arch. Math. Log. 38(3): 163-193 (1999) |
| 4 | Stephen J. Bellantoni, Karl-Heinz Niggl: Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited. SIAM J. Comput. 29(2): 401-415 (1999) | |
| 1998 | ||
| 3 | EE | Karl-Heinz Niggl: A restricted computation model on Scott domains and its partial primitive recursive functionals. Arch. Math. Log. 37(7): 443-481 (1998) |
| 1997 | ||
| 2 | EE | Karl-Heinz Niggl: Non-definability of the Ackermann function with type 1 partial primitive recursion. Arch. Math. Log. 37(1): 1-13 (1997) |
| 1995 | ||
| 1 | Karl-Heinz Niggl: Towards the Computational Complexity of PRomega-Terms. Ann. Pure Appl. Logic 75(1-2): 153-178 (1995) | |
| 1 | Stephen J. Bellantoni | [4] [9] |
| 2 | Ulrich Berger | [10] |
| 3 | Lars Kristiansen | [11] [12] |
| 4 | Bernhard Reus | [10] |
| 5 | Helmut Schwichtenberg | [9] |
| 6 | Henning Wunderlich | [14] |