Lars Kristiansen

• Kristiansen, Lars (2021). Reversible Computing and Implicit Computational Complexity. Science of Computer Programming. ISSN 0167-6423. 213. doi: 10.1016/j.scico.2021.102723. Fulltekst i vitenarkiv
• Kristiansen, Lars (2021). On subrecursive representation of irrational numbers: Contractors and Baire sequences. Lecture Notes in Computer Science (LNCS). ISSN 0302-9743. 12813. doi: 10.1007/978-3-030-80049-9_28. Fulltekst i vitenarkiv
• Georgiev, Ivan; Kristiansen, Lars & Stephan, Frank (2020). Computable Irrational Numbers with Representations of Surprising Complexity. Annals of Pure and Applied Logic. ISSN 0168-0072. 172(2). doi: 10.1016/j.apal.2020.102893. Fulltekst i vitenarkiv
• Kristiansen, Lars (2020). Reversible programming languages capturing complexity classes. Lecture Notes in Computer Science (LNCS). ISSN 0302-9743. 12227, s. 111–127. doi: 10.1007/978-3-030-52482-1_6. Fulltekst i vitenarkiv
• Kristiansen, Lars & Simonsen, Jakob Grue (2020). On the Complexity of Conversion Between Classic Real Number Representations. Lecture Notes in Computer Science (LNCS). ISSN 0302-9743. 12098, s. 75–86. doi: 10.1007/978-3-030-51466-2_7.
• Kristiansen, Lars & Murwanashyaka, Juvenal (2020). On Interpretability between some weak essentially undecidable theories. Lecture Notes in Computer Science (LNCS). ISSN 0302-9743. 12098, s. 63–74. doi: 10.1007/978-3-030-51466-2_6. Fulltekst i vitenarkiv
• Kristiansen, Lars & Murwanashyaka, Juvenal (2020). First-Order Concatenation Theory with Bounded Quantifiers (Preprint). arXiv.org. ISSN 2331-8422. doi: 10.1007/s00153-020-00735-6.
• Kristiansen, Lars & Murwanashyaka, Juvenal (2020). First-Order Concatenation Theory with Bounded Quantifiers. Archive for Mathematical Logic. ISSN 0933-5846. 60(1-2), s. 77–104. doi: 10.1007/s00153-020-00735-6. Fulltekst i vitenarkiv
• Kristiansen, Lars & Murwanashyaka, Juvenal (2018). Decidable and Undecidable Fragments of First-Order Concatenation Theory. I Manea, Florin; Miller, Russel G. & Nowotka, Dirk (Red.), Sailing Routes in the World of Computation. Springer Nature. ISSN 978-3-319-94417-3. s. 244–253. doi: 10.1007/978-3-319-94418-0_25. Fulltekst i vitenarkiv
• Georgiev, Ivan; Kristiansen, Lars & Stephan, Frank (2018). On General Sum Approximations of Irrational Numbers. I Manea, Florin; Miller, Russel G. & Nowotka, Dirk (Red.), Sailing Routes in the World of Computation. Springer Nature. ISSN 978-3-319-94417-3. s. 194–203. doi: https%3A/doi.org/10.1007/978-3-319-94418-0_20. Fulltekst i vitenarkiv
• Georgiev, Ivan; Kristiansen, Lars & Stephan, Frank (2018). Subrecursive Approximations of Irrational Numbers by Variable Base Sums. arXiv.org. ISSN 2331-8422.
• Kristiansen, Lars & Murwanashyaka, Juvenal (2018). Notes on Fragments of First-Order Concatenation Theory. arXiv.org. ISSN 2331-8422. doi: 10.1007/978-3-319-94418-0_25.
• Kristiansen, Lars (2018). On subrecursive representability of irrational numbers, part II. Computability - The Journal of the Assosiation. ISSN 2211-3568. 8(1), s. 43–65. doi: 10.3233/COM-170081. Fulltekst i vitenarkiv
• Aanderaa, Stål; Kristiansen, Lars & Ruud, Hans-Kristian (2018). Search for Good Examples of Hall's Conjecture. Mathematics of Computation. ISSN 0025-5718. 87(314), s. 2903–2914. doi: 10.1090/mcom/3298. Fulltekst i vitenarkiv
• Kristiansen, Lars (2017). On subrecursive representability of irrational numbers. Computability - The Journal of the Assosiation. ISSN 2211-3568. 6(3), s. 249–276. doi: 10.3233/COM-160063.
• Kristiansen, Lars (2016). On subrecursive representability of irrational numbers. Computability - The Journal of the Assosiation. ISSN 2211-3568. 6, s. 249–276. doi: 10.3233/COM-160063. Fulltekst i vitenarkiv
• Kristiansen, Lars (2012). Degrees of Total Algorithms versus Degrees of Honest Functions. Lecture Notes in Computer Science (LNCS). ISSN 0302-9743. 7318, s. 442–431. doi: 10.1007/978-3-642-30870-3_43.
• Kristiansen, Lars & Mender, Bedeho (2012). Non-determinism in Gödel's System T. Theory of Computing Systems. ISSN 1432-4350. 51(1), s. 85–105. doi: 10.1007/s00224-011-9377-9.
• Kristiansen, Lars (2012). Higher Types, Finite Domains and Resource-bounded Turing Machines. Journal of Logic and Computation. ISSN 0955-792X. 22(2), s. 281–304. doi: 10.1093/logcom/exq009.
• Ben-Amram, Amir & Kristiansen, Lars (2012). On the edge of decidability in complexity analysis of loop programs. International Journal of Foundations of Computer Science. ISSN 0129-0541. 23(7), s. 1451–1464. doi: 10.1142/S0129054112400588.
• Kristiansen, Lars; Schlage-Puchta, Jan-Christoph & Weiermann, Andreas (2012). Streamlined subrecursive degree theory. Annals of Pure and Applied Logic. ISSN 0168-0072. 163(6), s. 698–716. doi: 10.1016/j.apal.2011.11.004.
• Kristiansen, Lars; Lubarsky, Robert; Schlage-Puchta, J.-C. & Weiermann, Andreas (2012). On the structure of honest elementary degrees. I Friedman, Sy-David; Koerwien, Martin & Muller, Moritz (Red.), The Infinity Project.A 2009–2011 Research Programme. Centre de Recerca Matematica. ISSN 978-84-616-3307-4. s. 255–279.
• Kristiansen, Lars & Mender, Bedeho (2011). Non-determinism in Gödel's system T. Theory of Computing Systems. ISSN 1432-4350. doi: 10.1007/s00224-011-9377-9.
• Kristiansen, Lars (2010). Higher types, finite domains and resource bounded Turing machines. Journal of Logic and Computation. ISSN 0955-792X. doi: 10.1093/logcom/exq009.
• Avery, James; Kristiansen, Lars & Moyen, Jean-Yves (2010). Static Complexity Analysis of Higher Order Programs. Lecture Notes in Computer Science (LNCS). ISSN 0302-9743. 6324, s. 84–99.
• Jones, Neil D. & Kristiansen, Lars (2009). A Flow Calculus of mwp-Bounds for Complexity Analysis. ACM Transactions on Computational Logic. ISSN 1529-3785. 10(4). doi: 10.1145/1555746.1555752.
• Kristiansen, Lars (2008). Recursion in Higher Types and Resource Bounded Turing Machines. I Beckmann, Arnold*; Dimitracopoulos, Costas & Löwe, Benedikt (Red.), Logic and Theory of Algorithms. Springer. ISSN 978-3-540-69405-2. s. 336–348.
• Kristiansen, Lars; Ben-Amram, Amir & Jones, Neil D. (2008). Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. I Beckmann, Arnold*; Dimitracopoulos, Costas & Löwe, Benedikt (Red.), Logic and Theory of Algorithms. Springer. ISSN 978-3-540-69405-2. s. 67–76.
• Kristiansen, Lars & Voda, Paul (2008). The Structure of Detour Degrees. I Agrawal, Manindra; Du, Dingzhu; Duan, Zhenhua & Li, Angsheng (Red.), Theory and Applications of Models of Computation. Springer Science+Business Media B.V.. ISSN 978-3-540-79227-7. s. 148–159.
• Burgess, Mark & Kristiansen, Lars (2008). On the complexity of determining autonomic policy constrained behaviour. I Brunner, Markus; Westphall, Carlos B. & Granville, Lisandro Z. (Red.), Network Operations and Management Symposium, 2008. NOMS 2008. IEEE. IEEE conference proceedings. ISSN 978-1-4244-2066-7. s. 295–301.
• Kristiansen, Lars (2008). Complexity-Theoretic Hierarchies Induced by Fragments of Godel's T. Theory of Computing Systems. ISSN 1432-4350. 43(3-4), s. 516–541. doi: 10.1007/s00224-007-9021-x.
• Kristiansen, Lars & Jones, Neil D. (2008). A flow calculus of mwp-bounds for complexity analysis. ACM Transactions on Computational Logic. ISSN 1529-3785.
• Kristiansen, Lars & Burgess, Mark (2007). Complexity of Change and Configuration Management. I Bergstra, Jan & Burgess, Mark (Red.), Handbook of Network and System Administration. Elsevier. ISSN 978-0-444-52198-9.
• Barra, G. Mathias; Kristiansen, Lars & Voda, Paul J. (2007). Nondeterminism without Turing Machines. I Cooper, S Barry; Kenth, Thomas F; Love, Benedikt & Sorbi, Andrea (Red.), Computation and Logic in the Real World. CiE 2007. s. 71–78.
• Kristiansen, Lars (2007). Complexity Analysis of Programs: Methods and Challenges. I Gluck, Robert & Hagiya, M (Red.), Proceedings of the 3rd DIKU-IST Joint Workshop on Foundations of Software. Dept. of Computer Science, University of Copenhagen. s. 126–136.
• Kristiansen, Lars (2007). Complexity-theoretic hierarchies induced by fragments of Gödel's T. Theory of Computing Systems. ISSN 1432-4350. doi: 10.1007/s00224-007-9021-x.
• Kristiansen, Lars & Jones, Neil D. (2006). Static Complexity Analysis of Programs. I Løkketangen, Arne (Red.), Norsk informatikkonferanse NIK 2006. Tapir Akademisk Forlag. ISSN 82-519-2186-4. s. 65–76.
• Kristiansen, Lars (2006). Complexity-theoretic hierarchies. Lecture Notes in Computer Science (LNCS). ISSN 0302-9743. 3988, s. 279–288.
• Kristiansen, Lars & Voda, Paul J. (2006). The Trade-off theorem and fragments of and Gödel's T. Lecture Notes in Computer Science (LNCS). ISSN 0302-9743. 3959.
• Kristiansen, Lars (2006). Complexity-Thoretic Hierarchies. Lecture Notes in Computer Science (LNCS). ISSN 0302-9743. 3988, s. 279–288.
• Kristiansen, Lars & Barra, G. Mathias (2005). The small Grzegorczyk classes and the typed lambda-calculus. I Cooper, S. Barry; Lowe, Benedikt & Torenvliet, Leen (Red.), New computational paradigms. Springer. ISSN 3-540-26179-6. s. 252–262.
• Kristiansen, Lars & Jones, Neil D. (2005). The flow of data and the complexity of algorithms. I Cooper, S. Barry; Lowe, Benedikt & Torenvliet, Leen (Red.), New computational paradigms. Springer. ISSN 3-540-26179-6. s. 263–274.
• Kristiansen, Lars (2005). Neat function algebraic characterizations of LOGSPACE and LINSPACE. Computational Complexity. ISSN 1016-3328. 14, s. 72–88.
• Kristiansen, Lars & Voda, Paul J. (2005). Programming languages capturing complexity classes. Nordic Journal of Computing. ISSN 1236-6064. 12, s. 89–115.
• Kristiansen, Lars (2005). Programming languages capturing complexity classes. Nordic Journal of Computing. ISSN 1236-6064. s. 89–115.
• Kristiansen, Lars & Jones, ND (2005). The flow of data and the complexity of algorithms. Lecture Notes in Computer Science (LNCS). ISSN 0302-9743. 3526.
• Kristiansen, Lars & Barra, Georg Mathias Honore (2005). The small Grzegorczyk classes and the typed lambda-calculus. Lecture Notes in Computer Science (LNCS). ISSN 0302-9743. 3526.

Se alle arbeider i Cristin

• Leary, Christopher C. & Kristiansen, Lars (2015). A Friendly Introduction to Mathematical Logic. Milne Library, SUNY Geneseo. ISBN 978-1-942341-07-9. 380 s.

Se alle arbeider i Cristin

• Kristiansen, Lars (2021). On subrecursive representation of irrational numbers: Contractors and Baire sequences.
• Kristiansen, Lars (2021). On Representations of Irrational Numbers: A Degree Structure.
• Kristiansen, Lars (2021). Implicit characterisations of complexity classes by inherently reversible programming languages.
• Kristiansen, Lars (2021). Classic representations of irrational numbers seen from a computability and complexity-theoretic perspective.
• Kristiansen, Lars (2020). On Interpretability Between some Weak Essentially Undecidable Theories.
• Kristiansen, Lars (2020). Reversible Programming Languages Capturing Complexity Classes.
• Kristiansen, Lars (2019). Best Approximations, Contractions Maps and Continued Fractions.
• Kristiansen, Lars (2019). On Subrecursive Representability of Irrational Numbers: Continued Fractions and Contraction maps.
• Kristiansen, Lars (2018). On General Sum Approximations of Irrational Numbers. .
• Kristiansen, Lars (2018). Decidable and Undecidable Fragments of First-Order Concatenation Theory. .
• Kristiansen, Lars (2018). On b-adic Representations of Irrational Numbers. .
• Kristiansen, Lars (2018). First-order concatenation vs. first-order number theory. .
• Kristiansen, Lars (2017). On Resource Analysis of Imperative Programs. Electronic Proceedings in Theoretical Computer Science (EPTCS). ISSN 2075-2180. 248. doi: 10.4204/EPTCS.248.
• Kristiansen, Lars (2017). On Resource Analysis of Imperative Programs.
• Kristiansen, Lars (2016). On Subrecursive Representability of Irrational Numbers.
• Kristiansen, Lars (2016). Subrecursive Sum Approximations of Irrational Numbers.
• Kristiansen, Lars (2016). On Subrecursive Representability of Irrational Numbers.
• Kristiansen, Lars (2015). Subrecursive Dedekind and Cauchy reals.
• Kristiansen, Lars; Aanderaa, Stål & Ruud, Hans-Kristian (2014). A Preliminary Report on Search for Good Examples of Hall's Conjecture. arXiv.org. ISSN 2331-8422.
• Kristiansen, Lars (2012). Degrees of Total Algorithms versus Degrees of Honest Functions.
• Kristiansen, Lars (2011). Honest subrecursive degree theory and provability in Peano Arithmetic.
• Ben-Amram, Amir & Kristiansen, Lars (2011). Decidable and undecidable problems related to complexity analysis of loop programs.
• Kristiansen, Lars (2011). Subrecursive degrees of honest functions and provably recursive functions.
• Kristiansen, Lars (2011). Review of the book "New Computational Paradigms (eds.: Cooper, Löwe, Sorbi)". Studia Logica: An International Journal for Symbolic Logic. ISSN 0039-3215. 97, s. 313–316.
• Kristiansen, Lars (2011). New computational paradigms. Studia Logica: An International Journal for Symbolic Logic. ISSN 0039-3215. 97(2), s. 313–316. doi: 10.1007/s11225-011-9308-4.
• Kristiansen, Lars; Weiermann, Andreas & Schlage-Puchta, Jan-Christoph (2010). Subrecursive degrees and statements independent of Peano Arithmetic.
• Kristiansen, Lars (2010). Honest degree theory and statements independent of Peano Arithmetic.
• Kristiansen, Lars & Mender, Bedeho (2010). Two notions of non-determinism in Gödel's system T.
• Kristiansen, Lars & Ben-Amram, Amir (2009). The limits of decidability and tractability in growth-rate analysis for programs.
• Kristiansen, Lars & Mender, Bedeho (2009). The Semantics and Complexity of Successor-free Nondeterministic Gôdel’s T and PCF.
• Kristiansen, Lars (2009). Complexity Analysis of Imperative Programs.
• Kristiansen, Lars & Mender, Bedeho (2009). The Semantics and Complexity of Successor-Free Nondeterministic Gödel's T and PCF.
• Kristiansen, Lars (2009). Implicit Computational Complexity: Moving on from the Extensional to the Intentional.
• Kristiansen, Lars (2008). The Structure of Detour Degrees.
• Kristiansen, Lars (2008). Recursion in Higher Types and Resource Bounded Turing machines.
• Kristiansen, Lars (2008). Implicit Characterisations of Complexity Classes and Recursion in Higher Types.
• Burgess, Mark & Kristiansen, Lars (2008). On the Complexity of Determining Autonomic Policy Constrained behaviour.
• Kristiansen, Lars (2007). Review of S.B. Cooper's book "Computability Theory". Studia Logica: An International Journal for Symbolic Logic. ISSN 0039-3215. 86, s. 145–146.
• Kristiansen, Lars (2007). Complexity Analysis of Programs: Methods and Challenges.
• Kristiansen, Lars (2007). Neil Jones: The early years.
• Kristiansen, Lars (2007). Complexity theory and Gödel's T.
• Kristiansen, Lars (2007). Beregnbarhet, kompleksitet og typeteori.
• Kristiansen, Lars (2006). Complexity-Theoretic Hierarchies.
• Kristiansen, Lars & Jones, Neil D. (2006). Static Complexity Ananlysis of Programs.
• Kristiansen, Lars (2006). Fragments of Godel's T, Complexity Classes and Rewriting Systems.
• Kristiansen, Lars (2006). $T^-$-hierarchies and the Trade-off Theorem.
• Kristiansen, Lars (2006). Complexity-Theoretic Hierarchies.
• Kristiansen, Lars & Voda, Paul J. (2006). The Trade-off theorem and fragments of and Gödel's T.
• Kristiansen, Lars (2005). Det tellbare og det overtellbare. Normat. ISSN 0801-3500. 53(3), s. 118–129.
• Kristiansen, Lars (2005). Programmeringsspråk og kompleksitetsklasser.
• Kristiansen, Lars (2005). Lambda-kalkyle og kompleksitetsteoretiske hierarkier.
• Kristiansen, Lars & Aanderaa, Stål (2005). Løsninger av ligningen x^3 - y^2 = k.

Se alle arbeider i Cristin