Subrecursive hierarchies on Scott domains. - Karl-Heinz Niggl (Arch. Math. Log., 1993)

Towards the Computational Complexity of PRomega-Terms. - Karl-Heinz Niggl (Ann. Pure Appl. Log., 1995)

Non-definability of the Ackermann function with type 1 partial primitive recursion. - Karl-Heinz Niggl (Arch. Math. Log., 1997)

A restricted computation model on Scott domains and its partial primitive recursive functionals. - Karl-Heinz Niggl (Arch. Math. Log., 1998)

Characterizing polytime through higher type recursion. - Karl-Heinz Niggl (Workshop on Domains, 1998)

Subrecursive functions on partial sequences. - Karl-Heinz Niggl (Arch. Math. Log., 1999)

Momega Considered as a Programming Language. - Karl-Heinz Niggl (Ann. Pure Appl. Log., 1999)

Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited. - Stephen J. Bellantoni; Karl-Heinz Niggl (SIAM J. Comput., 1999)

The m mu-measure as a tool for classifying computational complexity. - Karl-Heinz Niggl (Arch. Math. Log., 2000)

Higher type recursion, ramification and polynomial time. - Stephen J. Bellantoni; Karl-Heinz Niggl; Helmut Schwichtenberg (Ann. Pure Appl. Log., 2000)

Preface. - Ulrich Berger 001; Karl-Heinz Niggl; Bernhard Reus (Theor. Comput. Sci., 2001)

The Garland Measure and Computational Complexity of Stack Programs. - Lars Kristiansen; Karl-Heinz Niggl (ICC@LICS, 2003)

On the computational complexity of imperative programming languages. - Lars Kristiansen; Karl-Heinz Niggl (Theor. Comput. Sci., 2004)

Control structures in programs and computational complexity. - Karl-Heinz Niggl (Ann. Pure Appl. Log., 2005)

Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs. - Karl-Heinz Niggl; Henning Wunderlich (SIAM J. Comput., 2006)

Implicit characterizations of FPTIME and NC revisited. - Karl-Heinz Niggl; Henning Wunderlich (J. Log. Algebraic Methods Program., 2010)