Author

Lars Kristiansen

Observed names: Kristiansen, Lars, L KRISTIANSEN, L. Kristiansen, LARS KRISTIANSEN

Institution: University of Oslo

Observed institution: University of Oslo

ORCID: 0000-0002-6749-4004

Observed ORCID: 0000-0002-6749-4004

OpenAlex ID: A5063909629

On the computational complexity of imperative programming languages

2003 · L. Kristiansen, K.-H. Niggl · Theoretical Computer Science · 41

PDF

Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time

2008 · Amir M. Ben-Amram, Neil D. Jones, et al. · Springer eBooks · 31

A flow calculus ofmwp-bounds for complexity analysis

2009 · Neil D. Jones, Lars Kristiansen · ACM Transactions on Computational Logic · 29

Neat function algebraic characterizations of logspace and linspace

2005 · Lars Kristiansen · Computational Complexity · 26

The Flow of Data and the Complexity of Algorithms

2005 · Lars Kristiansen, Neil D. Jones · Lecture notes in computer science · 20

Streamlined subrecursive degree theory

2011 · Lars Kristiansen, Jan-Christoph Schlage-Puchta, et al. · Annals of Pure and Applied Logic · 18

On subrecursive representability of irrational numbers

2016 · Lars Kristiansen · Computability · 15

On the Edge of Decidability in Complexity Analysis of Loop Programs

2012 · AMIR M. BEN-AMRAM, LARS KRISTIANSEN · International Journal of Foundations of Computer Science · 15

Programming languages capturing complexity classes

2005 · Lars Kristiansen, Paul J. Voda · 15

Complexity classes and fragments of C

2003 · Lars Kristiansen, Paul J. Voda · Information Processing Letters · 15

A jump operator on honest subrecursive degrees

1998 · Lars Kristiansen · Archive for Mathematical Logic · 15

On subrecursive representability of irrational numbers, part II

2017 · Lars Kristiansen · Computability · 13

PDF

Information content and computational complexity of recursive sets

2017 · Lars Kristiansen · Cambridge University Press eBooks · 11

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

2003 · Lars Kristiansen, Paul J. Voda · Lecture notes in computer science · 11

Computable irrational numbers with representations of surprising complexity

2020 · Ivan Georgiev, Lars Kristiansen, et al. · Annals of Pure and Applied Logic · 10

The Small Grzegorczyk Classes and the Typed λ-Calculus

2005 · Lars Kristiansen, Mathias Barra · Lecture notes in computer science · 10

Complexity-Theoretic Hierarchies Induced by Fragments of Gödel’s T

2007 · Lars Kristiansen · Theory of Computing Systems · 9

Subrecursive degrees and fragments of Peano Arithmetic

2001 · Lars Kristiansen · Archive for Mathematical Logic · 9

On Interpretability Between Some Weak Essentially Undecidable Theories

2020 · Lars Kristiansen, Juvenal Murwanashyaka · Lecture notes in computer science · 6

Complexity-Theoretic Hierarchies

2006 · Lars Kristiansen · Lecture notes in computer science · 6

The Trade-Off Theorem and Fragments of Gödel’s T

2006 · Lars Kristiansen, Paul J. Voda · Lecture notes in computer science · 6

The Garland Measure and Computational Complexity of Stack Programs

2003 · L. Kristiansen, K.-H. Niggl · Electronic Notes in Theoretical Computer Science · 6

PDF

On Subrecursive Representation of Irrational Numbers: Contractors and Baire Sequences

2021 · Lars Kristiansen · Lecture notes in computer science · 5

On the Complexity of Conversion Between Classic Real Number Representations

2020 · Lars Kristiansen, Jakob Grue Simonsen · Lecture notes in computer science · 5

The Implicit Computational Complexity of Imperative Programming Languages

2001 · Lars Kristiansen · BRICS Report Series · 5

PDF

Works count: 58

Citation count: 393

H-index: 12

I10-index: 16