default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKarl-Heinz Niggl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j14]Karl-Heinz Niggl, Henning Wunderlich:
Implicit characterizations of FPTIME and NC revisited. J. Log. Algebraic Methods Program. 79(1): 47-60 (2010)
2000 – 2009
- 2006
- [j13]Karl-Heinz Niggl, Henning Wunderlich:
Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs. SIAM J. Comput. 35(5): 1122-1147 (2006) - 2005
- [j12]Karl-Heinz Niggl:
Control structures in programs and computational complexity. Ann. Pure Appl. Log. 133(1-3): 247-273 (2005) - 2004
- [j11]Lars Kristiansen, Karl-Heinz Niggl:
On the computational complexity of imperative programming languages. Theor. Comput. Sci. 318(1-2): 139-161 (2004) - 2003
- [c2]Lars Kristiansen, Karl-Heinz Niggl:
The Garland Measure and Computational Complexity of Stack Programs. ICC@LICS 2003: 15-35 - 2001
- [j10]Ulrich Berger
, Karl-Heinz Niggl, Bernhard Reus:
Preface. Theor. Comput. Sci. 264(2): 169 (2001) - 2000
- [j9]Karl-Heinz Niggl:
The m\mu-measure as a tool for classifying computational complexity. Arch. Math. Log. 39(7): 515-539 (2000) - [j8]Stephen J. Bellantoni, Karl-Heinz Niggl, Helmut Schwichtenberg:
Higher type recursion, ramification and polynomial time. Ann. Pure Appl. Log. 104(1-3): 17-30 (2000)
1990 – 1999
- 1999
- [j7]Karl-Heinz Niggl:
Subrecursive functions on partial sequences. Arch. Math. Log. 38(3): 163-193 (1999) - [j6]Karl-Heinz Niggl:
Momega Considered as a Programming Language. Ann. Pure Appl. Log. 99(1-3): 73-92 (1999) - [j5]Stephen J. Bellantoni, Karl-Heinz Niggl:
Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited. SIAM J. Comput. 29(2): 401-415 (1999) - 1998
- [j4]Karl-Heinz Niggl:
A restricted computation model on Scott domains and its partial primitive recursive functionals. Arch. Math. Log. 37(7): 443-481 (1998) - [c1]Karl-Heinz Niggl:
Characterizing polytime through higher type recursion. Workshop on Domains 1998: 153 - 1997
- [j3]Karl-Heinz Niggl:
Non-definability of the Ackermann function with type 1 partial primitive recursion. Arch. Math. Log. 37(1): 1-13 (1997) - 1995
- [j2]Karl-Heinz Niggl:
Towards the Computational Complexity of PRomega-Terms. Ann. Pure Appl. Log. 75(1-2): 153-178 (1995) - 1993
- [j1]Karl-Heinz Niggl:
Subrecursive hierarchies on Scott domains. Arch. Math. Log. 32(4): 239-257 (1993)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
