PD Dr. rer. nat. habil. Karl-Heinz Niggl
Adresse:
| Institut für Theoretische Informatik
|
|
| Fachgebiet Komplexitätstheorie und Effiziente Algorithmen
|
| Technische Universität Ilmenau
|
| 98693 Ilmenau
|
| Büro :
| Helmholtzplatz 1, Raum 307
| Telefon :
| (03677) 69-1444 (+49 3677 ) 69 - 1444
| email :
| niggl(at)tu-ilmenau.de
|
|
|
Lehre
Former principal investigator on resaerch grant of the German Society for the Advancement of Scientific Research (DFG), affiliated with department of mathematics Ludwig-Maximilians-Universität München
Recent papers
- Implicit characterizations of FPTIME and NC revisited, (Joint work with Henning Wunderlich, Logic and Algebraic Programming, To appear: 2008)
- Certifying polynomial time and linear/polynomial space for imperative programs (joint work with Henning Wunderlich SIAM J. Computing 2006)
- Control Structures in Programs and Computational Complexity (FloC''02 affiliated Workshop ICC'02.APAL 2005)
- Control Structures in Programs and Computational Complexity (Habilitation thesis).
- On the computational complexity of imperative programming languages , (Joint work with Lars Kristiansen. TCS 2004).
- The Garland Measure and Computational Complexity of Stack Programs (LICS affiliated Workshop ICC'03. Proceedings published by ENTCS, Volume 90, Elseview 2003)
- Higher Type Recursion , Ramification and Polynomial Time, (Joint work with S. Bellantoni and H. Schwichtenberg, APAL 2000)
- Ranking Primitive Recursions : The Low Grzegorczyk Classes revisited, (Joint work with S. Bellantoni. SICOMP 2000)
- The μ-Measure as a Tool for Classifying Computational Complexity, (Abstract for Logic Colloquium '97 in Leeds)
- Subrecursive functions on partial sequences, (AML '99)
- Review on papers by Bellantoni/Cook and Beckmann/Weiermann, (The Bulletin of Symbolic Logic 2000)
- Mω considered as a programming language, (APAL '99)
- A restricted computation model on Scott domains and its partial primitive recursive functionals, (AML '98)
- Non-definability of the Ackermann function with type 1 partial primitive recursion , (AML '97)
- Towards the computational complexity of PRω -terms, (APAL '95)
- Subrecursive hierarchies on the partial continuous functionals, (PhD thesis)
- Subrecursive hierarchies on Scott domains, (AML '93)
- Subrecursive hierarchies on flat Scott domains, (JSL '92)
|