Lars Kristiansen

According to our database, Lars Kristiansen authored at least 39 papers between 1998 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

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

2022

Reversible computing and implicit computational complexity.

Lars Kristiansen

Sci. Comput. Program., 2022

2021

Computable irrational numbers with representations of surprising complexity.

Ivan Georgiev, Lars Kristiansen, Frank Stephan

Ann. Pure Appl. Log., 2021

First-order concatenation theory with bounded quantifiers.

Lars Kristiansen, Juvenal Murwanashyaka

Arch. Math. Log., 2021

On Subrecursive Representation of Irrational Numbers: Contractors and Baire Sequences.

Lars Kristiansen

Proceedings of the Connecting with Computability, 2021

2020

Reversible Programming Languages Capturing Complexity Classes.

Lars Kristiansen

Proceedings of the Reversible Computation - 12th International Conference, 2020

On the Complexity of Conversion Between Classic Real Number Representations.

Lars Kristiansen, Jakob Grue Simonsen

Proceedings of the Beyond the Horizon of Computability, 2020

On Interpretability Between Some Weak Essentially Undecidable Theories.

Lars Kristiansen, Juvenal Murwanashyaka

Proceedings of the Beyond the Horizon of Computability, 2020

2019

On subrecursive representability of irrational numbers, part II.

Lars Kristiansen

Comput., 2019

2018

Search for good examples of Hall's conjecture.

Stål Aanderaa, Lars Kristiansen, Hans Kristian Ruud

Math. Comput., 2018

Decidable and Undecidable Fragments of First-Order Concatenation Theory.

Lars Kristiansen, Juvenal Murwanashyaka

Proceedings of the Sailing Routes in the World of Computation, 2018

On General Sum Approximations of Irrational Numbers.

Ivan Georgiev, Lars Kristiansen, Frank Stephan

Proceedings of the Sailing Routes in the World of Computation, 2018

2017

On subrecursive representability of irrational numbers.

Lars Kristiansen

Comput., 2017

2012

Non-determinism in Gödel's System T.

Lars Kristiansen, Bedeho Mesghina Wolde Mender

Theory Comput. Syst., 2012

Higher Types, Finite Domains and Resource-bounded Turing Machines.

Lars Kristiansen

J. Log. Comput., 2012

On the Edge of Decidability in Complexity Analysis of Loop Programs.

Amir M. Ben-Amram, Lars Kristiansen

Int. J. Found. Comput. Sci., 2012

Streamlined subrecursive degree theory.

Lars Kristiansen, Jan-Christoph Schlage-Puchta, Andreas Weiermann

Ann. Pure Appl. Log., 2012

Degrees of Total Algorithms versus Degrees of Honest Functions.

Lars Kristiansen

Proceedings of the How the World Computes, 2012

2011

Book Reviews.

Lars Kristiansen

Stud Logica, 2011

2009

A flow calculus of <i>mwp</i>-bounds for complexity analysis.

Neil D. Jones, Lars Kristiansen

ACM Trans. Comput. Log., 2009

Static Complexity Analysis of Higher Order Programs.

James Avery, Lars Kristiansen, Jean-Yves Moyen

Proceedings of the Foundational and Practical Aspects of Resource Analysis, 2009

2008

Complexity-Theoretic Hierarchies Induced by Fragments of Gödel's <i>T</i>.

Lars Kristiansen

Theory Comput. Syst., 2008

The Structure of Detour Degrees.

Lars Kristiansen, Paul J. Voda

Proceedings of the Theory and Applications of Models of Computation, 2008

On the complexity of determining autonomic policy constrained behaviour.

Mark Burgess, Lars Kristiansen

Proceedings of the IEEE/IFIP Network Operations and Management Symposium: Pervasive Management for Ubioquitous Networks and Services, 2008

Recursion in Higher Types and Resource Bounded Turing Machines.

Lars Kristiansen

Proceedings of the Logic and Theory of Algorithms, 2008

Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time.

Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen

Proceedings of the Logic and Theory of Algorithms, 2008

2007

S. Barry Cooper, Computability Theory.

Lars Kristiansen

Stud Logica, 2007

2006

The Trade-Off Theorem and Fragments of Gödel's <i>T</i>.

Lars Kristiansen, Paul J. Voda

Proceedings of the Theory and Applications of Models of Computation, 2006

Complexity-Theoretic Hierarchies.

Lars Kristiansen

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

Programming Languages Capturing Complexity Classes.

Lars Kristiansen, Paul J. Voda

Nord. J. Comput., 2005

Neat function algebraic characterizations of logspace and linspace.

Lars Kristiansen

Comput. Complex., 2005

The Flow of Data and the Complexity of Algorithms.

Lars Kristiansen, Neil D. Jones

Proceedings of the New Computational Paradigms, 2005

The Small Grzegorczyk Classes and the Typed lambda-Calculus.

Lars Kristiansen, Mathias Barra

Proceedings of the New Computational Paradigms, 2005

2004

On the computational complexity of imperative programming languages.

Lars Kristiansen, Karl-Heinz Niggl

Theor. Comput. Sci., 2004

2003

Complexity classes and fragments of C.

Lars Kristiansen, Paul J. Voda

Inf. Process. Lett., 2003

The Garland Measure and Computational Complexity of Stack Programs.

Lars Kristiansen, Karl-Heinz Niggl

Proceedings of the Fifth International Workshop on Implicit Computational Complexity, 2003

The Surprising Power of Restricted Programs and Gödel's Functionals.

Lars Kristiansen, Paul J. Voda

Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2001

Subrecursive degrees and fragments of Peano Arithmetic.

Lars Kristiansen

Arch. Math. Log., 2001

1998

A jump operator on honest subrecursive degrees.

Lars Kristiansen

Arch. Math. Log., 1998