Karl-Heinz Niggl

Publication Activity (10 Years)

Years Active: 1993-2010
Publications (10 Years): 0

Publications

Karl-Heinz Niggl, Henning Wunderlich
Implicit characterizations of FPTIME and NC revisited. J. Log. Algebraic Methods Program. 79 (1) (2010)
Karl-Heinz Niggl, Henning Wunderlich
Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs. SIAM J. Comput. 35 (5) (2006)
Karl-Heinz Niggl
Control structures in programs and computational complexity. Ann. Pure Appl. Log. 133 (1-3) (2005)
Lars Kristiansen, Karl-Heinz Niggl
On the computational complexity of imperative programming languages. Theor. Comput. Sci. 318 (1-2) (2004)
Lars Kristiansen, Karl-Heinz Niggl
The Garland Measure and Computational Complexity of Stack Programs. Electron. Notes Theor. Comput. Sci. 90 (2003)
Ulrich Berger, Karl-Heinz Niggl, Bernhard Reus
Preface. Theor. Comput. Sci. 264 (2) (2001)
Karl-Heinz Niggl
Characterizing polytime through higher type recursion. Electron. Notes Theor. Comput. Sci. 35 (2000)
Karl-Heinz Niggl
The m\mu-measure as a tool for classifying computational complexity. Arch. Math. Log. 39 (7) (2000)
Stephen J. Bellantoni, Karl-Heinz Niggl, Helmut Schwichtenberg
Higher type recursion, ramification and polynomial time. Ann. Pure Appl. Log. 104 (1-3) (2000)
Karl-Heinz Niggl
Considered as a Programming Language. Ann. Pure Appl. Log. 99 (1-3) (1999)
Karl-Heinz Niggl
Subrecursive functions on partial sequences. Arch. Math. Log. 38 (3) (1999)
Stephen J. Bellantoni, Karl-Heinz Niggl
Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited. SIAM J. Comput. 29 (2) (1999)
Karl-Heinz Niggl
A restricted computation model on Scott domains and its partial primitive recursive functionals. Arch. Math. Log. 37 (7) (1998)
Karl-Heinz Niggl
Non-definability of the Ackermann function with type 1 partial primitive recursion. Arch. Math. Log. 37 (1) (1997)
Karl-Heinz Niggl
-Terms. Ann. Pure Appl. Log. 75 (1-2) (1995)
Karl-Heinz Niggl
Subrecursive hierarchies on Scott domains. Arch. Math. Log. 32 (4) (1993)