| 2008 |
|---|
| 12 | EE | Lars Kristiansen,
Paul J. Voda:
The Structure of Detour Degrees.
TAMC 2008: 148-159 |
| 2007 |
|---|
| 11 | EE | Lars Kristiansen:
S. Barry Cooper, Computability Theory.
Studia Logica 86(1): 145-146 (2007) |
| 2006 |
|---|
| 10 | EE | Lars Kristiansen:
Complexity-Theoretic Hierarchies.
CiE 2006: 279-288 |
| 9 | EE | Lars Kristiansen,
Paul J. Voda:
The Trade-Off Theorem and Fragments of Gödel's T.
TAMC 2006: 654-674 |
| 2005 |
|---|
| 8 | EE | Lars Kristiansen,
Mathias Barra:
The Small Grzegorczyk Classes and the Typed lambda-Calculus.
CiE 2005: 252-262 |
| 7 | EE | Lars Kristiansen,
Neil D. Jones:
The Flow of Data and the Complexity of Algorithms.
CiE 2005: 263-274 |
| 6 | EE | Lars Kristiansen:
Neat function algebraic characterizations of logspace and linspace.
Computational Complexity 14(1): 72-88 (2005) |
| 5 | | Lars Kristiansen,
Paul J. Voda:
Programming Languages Capturing Complexity Classes.
Nord. J. Comput. 12(2): 89-115 (2005) |
| 2004 |
|---|
| 4 | EE | Lars Kristiansen,
Karl-Heinz Niggl:
On the computational complexity of imperative programming languages.
Theor. Comput. Sci. 318(1-2): 139-161 (2004) |
| 2003 |
|---|
| 3 | EE | Lars Kristiansen,
Paul J. Voda:
The Surprising Power of Restricted Programs and Gödel's Functionals.
CSL 2003: 345-358 |
| 2 | EE | Lars Kristiansen,
Karl-Heinz Niggl:
The Garland Measure and Computational Complexity of Stack Programs.
Electr. Notes Theor. Comput. Sci. 90(1): (2003) |
| 1 | EE | Lars Kristiansen,
Paul J. Voda:
Complexity classes and fragments of C.
Inf. Process. Lett. 88(5): 213-218 (2003) |
