Lars Kristiansen

Orcid: 0000-0002-6749-4004

According to our database1, Lars Kristiansen authored at least 40 papers between 1998 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Weak First-Order Theory of Sequences.
Proceedings of the Twenty Years of Theoretical and Practical Synergies, 2024

2023
On representations of real numbers and the computational complexity of converting between such representations.
CoRR, 2023

2022
Reversible computing and implicit computational complexity.
Sci. Comput. Program., 2022

2021
Computable irrational numbers with representations of surprising complexity.
Ann. Pure Appl. Log., 2021

First-order concatenation theory with bounded quantifiers.
Arch. Math. Log., 2021

On Subrecursive Representation of Irrational Numbers: Contractors and Baire Sequences.
Proceedings of the Connecting with Computability, 2021

2020
Reversible Programming Languages Capturing Complexity Classes.
Proceedings of the Reversible Computation - 12th International Conference, 2020

On the Complexity of Conversion Between Classic Real Number Representations.
Proceedings of the Beyond the Horizon of Computability, 2020

On Interpretability Between Some Weak Essentially Undecidable Theories.
Proceedings of the Beyond the Horizon of Computability, 2020

2019
On subrecursive representability of irrational numbers, part II.
Comput., 2019

2018
Search for good examples of Hall's conjecture.
Math. Comput., 2018

Decidable and Undecidable Fragments of First-Order Concatenation Theory.
Proceedings of the Sailing Routes in the World of Computation, 2018

On General Sum Approximations of Irrational Numbers.
Proceedings of the Sailing Routes in the World of Computation, 2018

2017
On subrecursive representability of irrational numbers.
Comput., 2017

2012
Non-determinism in Gödel's System T.
Theory Comput. Syst., 2012

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

On the Edge of Decidability in Complexity Analysis of Loop Programs.
Int. J. Found. Comput. Sci., 2012

Streamlined subrecursive degree theory.
Ann. Pure Appl. Log., 2012

Degrees of Total Algorithms versus Degrees of Honest Functions.
Proceedings of the How the World Computes, 2012

2011
Book Reviews.
Stud Logica, 2011

2009
A flow calculus of <i>mwp</i>-bounds for complexity analysis.
ACM Trans. Comput. Log., 2009

Static Complexity Analysis of Higher Order Programs.
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>.
Theory Comput. Syst., 2008

The Structure of Detour Degrees.
Proceedings of the Theory and Applications of Models of Computation, 2008

On the complexity of determining autonomic policy constrained behaviour.
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.
Proceedings of the Logic and Theory of Algorithms, 2008

Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time.
Proceedings of the Logic and Theory of Algorithms, 2008

2007
S. Barry Cooper, Computability Theory.
Stud Logica, 2007

2006
The Trade-Off Theorem and Fragments of Gödel's <i>T</i>.
Proceedings of the Theory and Applications of Models of Computation, 2006

Complexity-Theoretic Hierarchies.
Proceedings of the Logical Approaches to Computational Barriers, 2006

2005
Programming Languages Capturing Complexity Classes.
Nord. J. Comput., 2005

Neat function algebraic characterizations of logspace and linspace.
Comput. Complex., 2005

The Flow of Data and the Complexity of Algorithms.
Proceedings of the New Computational Paradigms, 2005

The Small Grzegorczyk Classes and the Typed lambda-Calculus.
Proceedings of the New Computational Paradigms, 2005

2004
On the computational complexity of imperative programming languages.
Theor. Comput. Sci., 2004

2003
Complexity classes and fragments of C.
Inf. Process. Lett., 2003

The Garland Measure and Computational Complexity of Stack Programs.
Proceedings of the Fifth International Workshop on Implicit Computational Complexity, 2003

The Surprising Power of Restricted Programs and Gödel's Functionals.
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2001
Subrecursive degrees and fragments of Peano Arithmetic.
Arch. Math. Log., 2001

1998
A jump operator on honest subrecursive degrees.
Arch. Math. Log., 1998


  Loading...