Lars Kristiansen

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 14

Top Topics

Computational Complexity

Computationally Tractable

Theoretical Basis

Top Venues

Publications

Lars Kristiansen, Juvenal Murwanashyaka
A Weak First-Order Theory of Sequences. CiE (2024)
Amir M. Ben-Amram, Lars Kristiansen, Jakob Grue Simonsen
On representations of real numbers and the computational complexity of converting between such representations. CoRR (2023)
Lars Kristiansen
Reversible computing and implicit computational complexity. Sci. Comput. Program. 213 (2022)
Lars Kristiansen
On Subrecursive Representation of Irrational Numbers: Contractors and Baire Sequences. CiE (2021)
Ivan Georgiev, Lars Kristiansen, Frank Stephan
Computable irrational numbers with representations of surprising complexity. Ann. Pure Appl. Log. 172 (2) (2021)
Lars Kristiansen, Juvenal Murwanashyaka
First-order concatenation theory with bounded quantifiers. Arch. Math. Log. 60 (1-2) (2021)
Lars Kristiansen, Jakob Grue Simonsen
On the Complexity of Conversion Between Classic Real Number Representations. CiE (2020)
Lars Kristiansen, Juvenal Murwanashyaka
On Interpretability Between Some Weak Essentially Undecidable Theories. CiE (2020)
Lars Kristiansen
Reversible Programming Languages Capturing Complexity Classes. RC (2020)
Lars Kristiansen
On subrecursive representability of irrational numbers, part II. Comput. 8 (1) (2019)
Lars Kristiansen, Juvenal Murwanashyaka
Decidable and Undecidable Fragments of First-Order Concatenation Theory. CiE (2018)
Ivan Georgiev, Lars Kristiansen, Frank Stephan
On General Sum Approximations of Irrational Numbers. CiE (2018)
Stål Aanderaa, Lars Kristiansen, Hans Kristian Ruud
Search for good examples of Hall's conjecture. Math. Comput. 87 (314) (2018)
Lars Kristiansen
On subrecursive representability of irrational numbers. Comput. 6 (3) (2017)
Lars Kristiansen, Jan-Christoph Schlage-Puchta, Andreas Weiermann
Streamlined subrecursive degree theory. Ann. Pure Appl. Log. 163 (6) (2012)
Lars Kristiansen, Bedeho Mesghina Wolde Mender
Non-determinism in Gödel's System T. Theory Comput. Syst. 51 (1) (2012)
Amir M. Ben-Amram, Lars Kristiansen
On the Edge of Decidability in Complexity Analysis of Loop Programs. Int. J. Found. Comput. Sci. 23 (7) (2012)
Lars Kristiansen
Higher Types, Finite Domains and Resource-bounded Turing Machines. J. Log. Comput. 22 (2) (2012)
Lars Kristiansen
Degrees of Total Algorithms versus Degrees of Honest Functions. CiE (2012)
Lars Kristiansen
Book Reviews. Stud Logica 97 (2) (2011)
Neil D. Jones, Lars Kristiansen
-bounds for complexity analysis. ACM Trans. Comput. Log. 10 (4) (2009)
James Avery, Lars Kristiansen, Jean-Yves Moyen
Static Complexity Analysis of Higher Order Programs. FOPARA (2009)
Lars Kristiansen, Paul J. Voda
The Structure of Detour Degrees. TAMC (2008)
Lars Kristiansen
. Theory Comput. Syst. 43 (3-4) (2008)
Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen
Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. CiE (2008)
Mark Burgess, Lars Kristiansen
On the complexity of determining autonomic policy constrained behaviour. NOMS (2008)
Lars Kristiansen
Recursion in Higher Types and Resource Bounded Turing Machines. CiE (2008)
Lars Kristiansen
S. Barry Cooper, Computability Theory. Stud Logica 86 (1) (2007)
Lars Kristiansen
Complexity-Theoretic Hierarchies. CiE (2006)
Lars Kristiansen, Paul J. Voda
. TAMC (2006)
Lars Kristiansen, Neil D. Jones
The Flow of Data and the Complexity of Algorithms. CiE (2005)
Lars Kristiansen, Mathias Barra
The Small Grzegorczyk Classes and the Typed lambda-Calculus. CiE (2005)
Lars Kristiansen, Paul J. Voda
Programming Languages Capturing Complexity Classes. Nord. J. Comput. 12 (2) (2005)
Lars Kristiansen
Neat function algebraic characterizations of logspace and linspace. Comput. Complex. 14 (1) (2005)
Lars Kristiansen, Karl-Heinz Niggl
On the computational complexity of imperative programming languages. Theor. Comput. Sci. 318 (1-2) (2004)
Lars Kristiansen, Paul J. Voda
The Surprising Power of Restricted Programs and Gödel's Functionals. CSL (2003)
Lars Kristiansen, Paul J. Voda
Complexity classes and fragments of C. Inf. Process. Lett. 88 (5) (2003)
Lars Kristiansen, Karl-Heinz Niggl
The Garland Measure and Computational Complexity of Stack Programs. Electron. Notes Theor. Comput. Sci. 90 (2003)
Lars Kristiansen
Subrecursive degrees and fragments of Peano Arithmetic. Arch. Math. Log. 40 (5) (2001)
Lars Kristiansen
A jump operator on honest subrecursive degrees. Arch. Math. Log. 37 (2) (1998)