Current Research Information SysTem In Norway
 
 

 Norsk versjon


 
Mainpage
Research results/NVI
Researchers
Projects
Research units
Log in
About Cristin
 
 
   
Back to search     Short format     Full format    
Export to


Showing results 1-50 of 107 << Previous 1 2 3    Next >>

2019
1 Kristiansen, Lars.
Best Approximations, Contractions Maps and Continued Fractions. International Workshop on Proof, Computation, Complexity, PCC 2019; 2019-07-15 - 2019-07-19
UiO Untitled
 
2 Kristiansen, Lars.
On Subrecursive Representability of Irrational Numbers: Continued Fractions and Contraction maps.. Sixteenth International Conference on Computability and Complexity in Analysis; 2019-07-08 - 2019-07-11
UiO Untitled
 
2018
3 Aanderaa, Stål; Kristiansen, Lars; Ruud, Hans-Kristian.
Search for Good Examples of Hall's Conjecture. Mathematics of Computation 2018 ;Volume 87.(314) p. 2903-2914
UiO Untitled
 
4 Georgiev, Ivan; Kristiansen, Lars; Stephan, Frank.
On General Sum Approximations of Irrational Numbers. I: Sailing Routes in the World of Computation. Springer Nature 2018 ISBN 978-3-319-94417-3. p. 194-203
UiO Untitled
 
5 Georgiev, Ivan; Kristiansen, Lars; Stephan, Frank.
Subrecursive Approximations of Irrational Numbers by Variable Base Sums. arXiv.org 2018
UiO Untitled
 
6 Kristiansen, Lars.
Decidable and Undecidable Fragments of First-Order Concatenation Theory.. CiE 2018: Computability in Europe 2015: Sailing Routes in the World of Computation; 2018-07-30 - 2018-08-03
UiO Untitled
 
7 Kristiansen, Lars.
First-order concatenation vs. first-order number theory.. Workshop: Proofs and Computation; 2018-07-02 - 2018-07-06
UiO Untitled
 
8 Kristiansen, Lars.
On b-adic Representations of Irrational Numbers.. PCC 2018 -- International Workshop on Proof, Computation, Complexity; 2018-07-18 - 2018-07-19
UiO Untitled
 
9 Kristiansen, Lars.
On General Sum Approximations of Irrational Numbers.. CiE 2018: Computability in Europe 2015: Sailing Routes in the World of Computation; 2018-07-30 - 2018-08-03
UiO Untitled
 
10 Kristiansen, Lars.
On subrecursive representability of irrational numbers, part II. Computability - The Journal of the Assosiation 2018 ;Volume 8.(1) p. 43-65
UiO Untitled
 
11 Kristiansen, Lars; Murwanashyaka, Juvenal.
Decidable and Undecidable Fragments of First-Order Concatenation Theory. I: Sailing Routes in the World of Computation. Springer Nature 2018 ISBN 978-3-319-94417-3. p. 244-253
UiO Untitled
 
12 Kristiansen, Lars; Murwanashyaka, Juvenal.
Notes on Fragments of First-Order Concatenation Theory. arXiv.org 2018
UiO Untitled
 
2017
13 Kristiansen, Lars.
On Resource Analysis of Imperative Programs. DICE-FOPARA 2017, 8th Workshop on Developments in Implicit Computational complExity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis.; 2017-04-22 - 2017-04-23
UiO Untitled
 
14 Kristiansen, Lars.
On Resource Analysis of Imperative Programs. Electronic Proceedings in Theoretical Computer Science 2017 ;Volume 248.
UiO Untitled
 
15 Kristiansen, Lars.
On subrecursive representability of irrational numbers. Computability - The Journal of the Assosiation 2017 ;Volume 6.(3) p. 249-276
UiO Untitled
 
2016
16 Kristiansen, Lars.
On Subrecursive Representability of Irrational Numbers. Workshop on Computability Theory 2016; 2016-07-04 - 2016-07-05
UiO Untitled
 
17 Kristiansen, Lars.
On Subrecursive Representability of Irrational Numbers.. PCC 2016, - International Workshop on Proof, Computation, Complexity; 2016-05-05 - 2016-05-06
UiO Untitled
 
18 Kristiansen, Lars.
On subrecursive representability of irrational numbers.. Computability - The Journal of the Assosiation 2016 ;Volume 6. p. 249-276
UiO Untitled
 
19 Kristiansen, Lars.
Subrecursive Sum Approximations of Irrational Numbers. CiE 2016 - Computability in Europe 2016: Pursuit of the Universal; 2016-06-27 - 2016-07-01
UiO Untitled
 
2015
20 Kristiansen, Lars.
Subrecursive Dedekind and Cauchy reals.. CiE 2015 -- Computability in Europa; 2015-06-29 - 2015-07-03
UiO Untitled
 
21 Leary, Christopher C.; Kristiansen, Lars.
A Friendly Introduction to Mathematical Logic. , Geneseo, NY: Milne Library, SUNY Geneseo 2015 (ISBN 978-1-942341-07-9) 380 p.
UiO Untitled
 
2014
22 Kristiansen, Lars; Aanderaa, Stål; Ruud, Hans-Kristian.
A Preliminary Report on Search for Good Examples of Hall's Conjecture. arXiv.org 2014
UiO Untitled
 
2012
23 Ben-Amram, Amir; Kristiansen, Lars.
On the edge of decidability in complexity analysis of loop programs. International Journal of Foundations of Computer Science 2012 ;Volume 23.(7) p. 1451-1464
UiO Untitled
 
24 Kristiansen, Lars.
Degrees of Total Algorithms versus Degrees of Honest Functions. PCC 2012 - International Workshop on Proof, Computation, Complexity; 2012-08-17 - 2012-08-18
UiO Untitled
 
25 Kristiansen, Lars.
Degrees of Total Algorithms versus Degrees of Honest Functions. Lecture Notes in Computer Science 2012 ;Volume 7318. p. 442-431
UiO Untitled
 
26 Kristiansen, Lars.
Higher Types, Finite Domains and Resource-bounded Turing Machines. Journal of Logic and Computation 2012 ;Volume 22.(2) p. 281-304
UiO Untitled
 
27 Kristiansen, Lars; Lubarsky, Robert; Schlage-Puchta, J.-C.; Weiermann, Andreas.
On the structure of honest elementary degrees. I: The Infinity Project.A 2009–2011 Research Programme. Barcelona, Spain: Centre de Recerca Matematica 2012 ISBN 978-84-616-3307-4. p. 255-279
UiO Untitled
 
28 Kristiansen, Lars; Mender, Bedeho.
Non-determinism in Gödel's System T. Theory of Computing Systems 2012 ;Volume 51.(1) p. 85-105
UiO Untitled
 
29 Kristiansen, Lars; Schlage-Puchta, Jan-Christoph; Weiermann, Andreas.
Streamlined subrecursive degree theory. Annals of Pure and Applied Logic 2012 ;Volume 163.(6) p. 698-716
UiO Untitled
 
2011
30 Ben-Amram, Amir; Kristiansen, Lars.
Decidable and undecidable problems related to complexity analysis of loop programs. Computability in Europe 2011; 2011-06-27 - 2011-07-02
UiO Untitled
 
31 Kristiansen, Lars.
Honest subrecursive degree theory and provability in Peano Arithmetic. PCC 2011, - International Workshop on Proof, Computation, Comlexity; 2011-06-06 - 2011-09-05
UiO Untitled
 
32 Kristiansen, Lars.
New computational paradigms. Studia Logica: An International Journal for Symbolic Logic 2011 ;Volume 97.(2) p. 313-316
UiO Untitled
 
33 Kristiansen, Lars.
Review of the book "New Computational Paradigms (eds.: Cooper, Löwe, Sorbi)". Studia Logica: An International Journal for Symbolic Logic 2011 ;Volume 97. p. 313-316
UiO Untitled
 
34 Kristiansen, Lars.
Subrecursive degrees of honest functions and provably recursive functions. Infinity Conference; 2011-07-18 - 2011-07-22
UiO Untitled
 
35 Kristiansen, Lars; Mender, Bedeho.
Non-determinism in Gödel's system T. Theory of Computing Systems 2011
UiO Untitled
 
2010
36 Avery, James; Kristiansen, Lars; Moyen, Jean-Yves.
Static Complexity Analysis of Higher Order Programs. Lecture Notes in Computer Science 2010 ;Volume 6324. p. 84-99
UiO Untitled
 
37 Kristiansen, Lars.
Higher types, finite domains and resource bounded Turing machines. Journal of Logic and Computation 2010 p. -
UiO Untitled
 
38 Kristiansen, Lars.
Honest degree theory and statements independent of Peano Arithmetic. PCC (Proof Computation Complexity) 2010; 2010-06-18 - 2010-06-19
UiO Untitled
 
39 Kristiansen, Lars; Mender, Bedeho.
Two notions of non-determinism in Gödel's system T. CiE 2010 -- Programs, Proofs, Processes; 2010-06-30 - 2010-07-04
UiO Untitled
 
40 Kristiansen, Lars; Weiermann, Andreas; Schlage-Puchta, Jan-Christoph.
Subrecursive degrees and statements independent of Peano Arithmetic. CiE 2010; 2010-06-30 - 2010-07-04
UiO Untitled
 
2009
41 Jones, Neil D.; Kristiansen, Lars.
A Flow Calculus of mwp-Bounds for Complexity Analysis. ACM Transactions on Computational Logic 2009 ;Volume 10.(4) p. -
UiO Untitled
 
42 Kristiansen, Lars.
Complexity Analysis of Imperative Programs. The Tenth International Workshop on Logic and Computational Complexity LCC 2009.; 2009-08-10
UiO Untitled
 
43 Kristiansen, Lars.
Implicit Computational Complexity: Moving on from the Extensional to the Intentional. 8th Proof, Computation and Complexity PCC 2009 .; 2009-07-02
UiO Untitled
 
44 Kristiansen, Lars; Ben-Amram, Amir.
The limits of decidability and tractability in growth-rate analysis for programs. CiE 2009; 2009-07-19 - 2009-07-24
UiO Untitled
 
45 Kristiansen, Lars; Mender, Bedeho.
The Semantics and Complexity of Successor-free Nondeterministic Gôdel’s T and PCF. Proof, Computation and Complexity; 2009-07-02 - 2009-07-02
UiO Untitled
 
46 Kristiansen, Lars; Mender, Bedeho.
The Semantics and Complexity of Successor-Free Nondeterministic Gödel's T and PCF. CiE 2009; 2009-07-19
UiO Untitled
 
2008
47 Burgess, Mark; Kristiansen, Lars.
On the Complexity of Determining Autonomic Policy Constrained behaviour. IFIP/IEEE Symposium NOMS 2008; 2008-04-06 - 2008-04-11
HIOA Untitled
 
48 Burgess, Mark; Kristiansen, Lars.
On the complexity of determining autonomic policy constrained behaviour. I: Network Operations and Management Symposium, 2008. NOMS 2008. IEEE. IEEE conference proceedings 2008 ISBN 978-1-4244-2066-7. p. 295-301
UiO Untitled
 
49 Kristiansen, Lars.
Complexity-Theoretic Hierarchies Induced by Fragments of Godel's T. Theory of Computing Systems 2008 ;Volume 43.(3-4) p. 516-541
OSLOMET UiO Untitled
 
50 Kristiansen, Lars.
Implicit Characterisations of Complexity Classes and Recursion in Higher Types. Workshop on Implicit Computational Complexity; 2008-02-11 - 2008-02-13
UiO Untitled
 
    Show next list