Karl-Heinz Niggl

16 papers Journal 14Unranked 2
YearRankTypeTitle / Venue / Authors
2010 J jnl
Implicit characterizations of FPTIME and NC revisited.
J. Log. Algebraic Methods Program.
Karl-Heinz Niggl, Henning Wunderlich
2006 J jnl
Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs.
SIAM J. Comput.
Karl-Heinz Niggl, Henning Wunderlich
2005 J jnl
Control structures in programs and computational complexity.
Ann. Pure Appl. Log.
Karl-Heinz Niggl
2004 J jnl
On the computational complexity of imperative programming languages.
Theor. Comput. Sci.
Lars Kristiansen, Karl-Heinz Niggl
2003 — conf
The Garland Measure and Computational Complexity of Stack Programs.
ICC@LICS
Lars Kristiansen, Karl-Heinz Niggl
2001 J jnl
Preface.
Theor. Comput. Sci.
Ulrich Berger, Karl-Heinz Niggl, Bernhard Reus
2000 J jnl
Higher type recursion, ramification and polynomial time.
Ann. Pure Appl. Log.
Stephen J. Bellantoni, Karl-Heinz Niggl, Helmut Schwichtenberg
2000 J jnl
The m\mu-measure as a tool for classifying computational complexity.
Arch. Math. Log.
Karl-Heinz Niggl
1999 J jnl
M
Ann. Pure Appl. Log.
Karl-Heinz Niggl
1999 J jnl
Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited.
SIAM J. Comput.
Stephen J. Bellantoni, Karl-Heinz Niggl
1999 J jnl
Subrecursive functions on partial sequences.
Arch. Math. Log.
Karl-Heinz Niggl
1998 J jnl
A restricted computation model on Scott domains and its partial primitive recursive functionals.
Arch. Math. Log.
Karl-Heinz Niggl
1998 — conf
Characterizing polytime through higher type recursion.
Workshop on Domains
Karl-Heinz Niggl
1997 J jnl
Non-definability of the Ackermann function with type 1 partial primitive recursion.
Arch. Math. Log.
Karl-Heinz Niggl
1995 J jnl
Towards the Computational Complexity of PR
Ann. Pure Appl. Log.
Karl-Heinz Niggl
1993 J jnl
Subrecursive hierarchies on Scott domains.
Arch. Math. Log.
Karl-Heinz Niggl