Karl-Heinz Niggl

According to our database, Karl-Heinz Niggl authored at least 16 papers between 1993 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2010

Implicit characterizations of FPTIME and NC revisited.

Karl-Heinz Niggl, Henning Wunderlich

J. Log. Algebraic Methods Program., 2010

2006

Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs.

Karl-Heinz Niggl, Henning Wunderlich

SIAM J. Comput., 2006

2005

Control structures in programs and computational complexity.

Karl-Heinz Niggl

Ann. Pure Appl. Log., 2005

2004

On the computational complexity of imperative programming languages.

Lars Kristiansen, Karl-Heinz Niggl

Theor. Comput. Sci., 2004

2003

The Garland Measure and Computational Complexity of Stack Programs.

Lars Kristiansen, Karl-Heinz Niggl

Proceedings of the Fifth International Workshop on Implicit Computational Complexity, 2003

2001

Preface.

Ulrich Berger, Karl-Heinz Niggl, Bernhard Reus

Theor. Comput. Sci., 2001

2000

Higher type recursion, ramification and polynomial time.

Stephen J. Bellantoni, Karl-Heinz Niggl, Helmut Schwichtenberg

Ann. Pure Appl. Log., 2000

The m\mu-measure as a tool for classifying computational complexity.

Karl-Heinz Niggl

Arch. Math. Log., 2000

1999

Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited.

Stephen J. Bellantoni, Karl-Heinz Niggl

SIAM J. Comput., 1999

M^omega Considered as a Programming Language.

Karl-Heinz Niggl

Ann. Pure Appl. Log., 1999

Subrecursive functions on partial sequences.

Karl-Heinz Niggl

Arch. Math. Log., 1999

1998

Characterizing polytime through higher type recursion.

Karl-Heinz Niggl

Proceedings of the Workshop on Domains IV 1998, 1998

A restricted computation model on Scott domains and its partial primitive recursive functionals.

Karl-Heinz Niggl

Arch. Math. Log., 1998

1997

Non-definability of the Ackermann function with type 1 partial primitive recursion.

Karl-Heinz Niggl

Arch. Math. Log., 1997

1995

Towards the Computational Complexity of PR^omega-Terms.

Karl-Heinz Niggl

Ann. Pure Appl. Log., 1995

1993

Subrecursive hierarchies on Scott domains.

Karl-Heinz Niggl

Arch. Math. Log., 1993