A jump operator on honest subrecursive degrees. - Lars Kristiansen (Arch. Math. Log., 1998)

Subrecursive degrees and fragments of Peano Arithmetic. - Lars Kristiansen (Arch. Math. Log., 2001)

The Surprising Power of Restricted Programs and Gödel's Functionals. - Lars Kristiansen; Paul J. Voda (CSL, 2003)

The Garland Measure and Computational Complexity of Stack Programs. - Lars Kristiansen; Karl-Heinz Niggl (ICC@LICS, 2003)

Complexity classes and fragments of C. - Lars Kristiansen; Paul J. Voda (Inf. Process. Lett., 2003)

On the computational complexity of imperative programming languages. - Lars Kristiansen; Karl-Heinz Niggl (Theor. Comput. Sci., 2004)

The Small Grzegorczyk Classes and the Typed lambda-Calculus. - Lars Kristiansen; Mathias Barra (CiE, 2005)

The Flow of Data and the Complexity of Algorithms. - Lars Kristiansen; Neil D. Jones (CiE, 2005)

Neat function algebraic characterizations of logspace and linspace. - Lars Kristiansen (Comput. Complex., 2005)

Programming Languages Capturing Complexity Classes. - Lars Kristiansen; Paul J. Voda (Nord. J. Comput., 2005)

Complexity-Theoretic Hierarchies. - Lars Kristiansen (CiE, 2006)

The Trade-Off Theorem and Fragments of Gödel's T. - Lars Kristiansen; Paul J. Voda (TAMC, 2006)

S. Barry Cooper, Computability Theory. - Lars Kristiansen (Stud Logica, 2007)

Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. - Amir M. Ben-Amram; Neil D. Jones; Lars Kristiansen (CiE, 2008)

Recursion in Higher Types and Resource Bounded Turing Machines. - Lars Kristiansen (CiE, 2008)

On the complexity of determining autonomic policy constrained behaviour. - Mark Burgess; Lars Kristiansen (NOMS, 2008)

The Structure of Detour Degrees. - Lars Kristiansen; Paul J. Voda (TAMC, 2008)

Complexity-Theoretic Hierarchies Induced by Fragments of Gödel's T. - Lars Kristiansen (Theory Comput. Syst., 2008)

Static Complexity Analysis of Higher Order Programs. - James Avery; Lars Kristiansen; Jean-Yves Moyen (FOPARA, 2009)

A flow calculus of mwp-bounds for complexity analysis. - Neil D. Jones; Lars Kristiansen (ACM Trans. Comput. Log., 2009)

Book Reviews. - Lars Kristiansen (Stud Logica, 2011)

Degrees of Total Algorithms versus Degrees of Honest Functions. - Lars Kristiansen (CiE, 2012)

Streamlined subrecursive degree theory. - Lars Kristiansen; Jan-Christoph Schlage-Puchta; Andreas Weiermann (Ann. Pure Appl. Log., 2012)

On the Edge of Decidability in Complexity Analysis of Loop Programs. - Amir M. Ben-Amram; Lars Kristiansen (Int. J. Found. Comput. Sci., 2012)

Higher Types, Finite Domains and Resource-bounded Turing Machines. - Lars Kristiansen (J. Log. Comput., 2012)

Non-determinism in Gödel's System T. - Lars Kristiansen; Bedeho Mesghina Wolde Mender (Theory Comput. Syst., 2012)

On subrecursive representability of irrational numbers. - Lars Kristiansen (Comput., 2017)

On General Sum Approximations of Irrational Numbers. - Ivan Georgiev; Lars Kristiansen; Frank Stephan 001 (CiE, 2018)

Decidable and Undecidable Fragments of First-Order Concatenation Theory. - Lars Kristiansen; Juvenal Murwanashyaka (CiE, 2018)

Search for good examples of Hall's conjecture. - Stål Aanderaa; Lars Kristiansen; Hans Kristian Ruud (Math. Comput., 2018)

On subrecursive representability of irrational numbers, part II. - Lars Kristiansen (Comput., 2019)

On Interpretability Between Some Weak Essentially Undecidable Theories. - Lars Kristiansen; Juvenal Murwanashyaka (CiE, 2020)

On the Complexity of Conversion Between Classic Real Number Representations. - Lars Kristiansen; Jakob Grue Simonsen (CiE, 2020)

Reversible Programming Languages Capturing Complexity Classes. - Lars Kristiansen (RC, 2020)

On Subrecursive Representation of Irrational Numbers: Contractors and Baire Sequences. - Lars Kristiansen (CiE, 2021)

First-order concatenation theory with bounded quantifiers. - Lars Kristiansen; Juvenal Murwanashyaka (Arch. Math. Log., 2021)

Computable irrational numbers with representations of surprising complexity. - Ivan Georgiev; Lars Kristiansen; Frank Stephan 001 (Ann. Pure Appl. Log., 2021)

Reversible computing and implicit computational complexity. - Lars Kristiansen (Sci. Comput. Program., 2022)

On representations of real numbers and the computational complexity of converting between such representations. - Amir M. Ben-Amram; Lars Kristiansen; Jakob Grue Simonsen (CoRR, 2023)

A Weak First-Order Theory of Sequences. - Lars Kristiansen; Juvenal Murwanashyaka (CiE, 2024)

On S-Degrees of Some Representations of Irrational Numbers. - Ivan Georgiev; Lars Kristiansen (CiE, 2025)

A degree structure on representations of irrational numbers. - Amir M. Ben-Amram; Lars Kristiansen (J. Log. Anal., 2025)