Lars Kristiansen
Lars Kristiansen
Professor, Department of Mathematics, University of Oslo
Verified email at math.uio.no - Homepage
Title
Cited by
Cited by
Year
A friendly introduction to mathematical logic
CC Leary, L Kristiansen
Lulu. com, 2015
482015
On the computational complexity of imperative programming languages
L Kristiansen, KH Niggl
Theoretical Computer Science 318 (1-2), 139-161, 2004
442004
Linear, polynomial or exponential? Complexity inference in polynomial time
AM Ben-Amram, ND Jones, L Kristiansen
Conference on Computability in Europe, 67-76, 2008
402008
A flow calculus of mwp-bounds for complexity analysis
ND Jones, L Kristiansen
ACM Transactions on Computational Logic (TOCL) 10 (4), 1-41, 2009
372009
The flow of data and the complexity of algorithms
L Kristiansen, ND Jones
Conference on Computability in Europe, 263-274, 2005
332005
Neat function algebraic characterizations of logspace and linspace
L Kristiansen
Computational Complexity 14 (1), 72-88, 2005
322005
Programming languages capturing complexity classes
L Kristiansen, PJ Voda
Nord. J. Comput. 12 (2), 89-115, 2005
192005
Complexity classes and fragments of C
L Kristiansen, PJ Voda
Information Processing Letters 88 (5), 213-218, 2003
182003
The small Grzegorczyk classes and the typed λ-calculus
L Kristiansen, M Barra
Conference on Computability in Europe, 252-262, 2005
172005
Streamlined subrecursive degree theory
L Kristiansen, JC Schlage-Puchta, A Weiermann
Annals of Pure and Applied Logic 163 (6), 698-716, 2012
162012
Complexity-Theoretic Hierarchies Induced by Fragments of Gödel’s T
L Kristiansen
Theory of Computing Systems 43 (3-4), 516-541, 2008
142008
The surprising power of restricted programs and Gödel’s functionals
L Kristiansen, PJ Voda
International Workshop on Computer Science Logic, 345-358, 2003
142003
A jump operator on honest subrecursive degrees
L Kristiansen
Archive for Mathematical Logic 37 (2), 105-125, 1998
141998
Subrecursive degrees and fragments of Peano arithmetic
L Kristiansen
Archive for Mathematical Logic 40 (5), 365-397, 2001
132001
On the edge of decidability in complexity analysis of loop programs
AM Ben-Amram, L Kristiansen
International Journal of Foundations of Computer Science 23 (07), 1451-1464, 2012
122012
Information content and computational complexity of recursive sets
L Kristiansen
Gödel'96: Logical foundations of mathematics, computer science and physics …, 1996
121996
On subrecursive representability of irrational numbers
L Kristiansen
Computability 6 (3), 249-276, 2017
102017
Lown, highn, and intermediate subrecursive degrees
L Kristiansen
Combinatorics, computation and logic, 286-300, 1999
101999
Complexity-theoretic hierarchies
L Kristiansen
Conference on Computability in Europe, 279-288, 2006
92006
Complexity-theoretic hierarchies induced by fragments of Gödel’s T
L Kristiansen
Theory of Computing Systems, 252-262, 2007
72007
The system can't perform the operation now. Try again later.
Articles 1–20