| A friendly introduction to mathematical logic CC Leary, L Kristiansen Lulu. com, 2015 | 70 | 2015 |
| On the computational complexity of imperative programming languages L Kristiansen, KH Niggl Theoretical Computer Science 318 (1-2), 139-161, 2004 | 49 | 2004 |
| Linear, polynomial or exponential? Complexity inference in polynomial time AM Ben-Amram, ND Jones, L Kristiansen Logic and Theory of Algorithms: 4th Conference on Computability in Europe …, 2008 | 46 | 2008 |
| A flow calculus of mwp-bounds for complexity analysis ND Jones, L Kristiansen ACM Transactions on Computational Logic (TOCL) 10 (4), 1-41, 2009 | 44 | 2009 |
| Neat function algebraic characterizations of LOGSPACE and LINSPACE L Kristiansen computational complexity 14, 72-88, 2005 | 35 | 2005 |
| The flow of data and the complexity of algorithms L Kristiansen, ND Jones Conference on Computability in Europe, 263-274, 2005 | 33 | 2005 |
| Programming languages capturing complexity classes L Kristiansen, PJ Voda Nord. J. Comput. 12 (2), 89-115, 2005 | 22 | 2005 |
| On subrecursive representability of irrational numbers L Kristiansen Computability 6 (3), 249-276, 2017 | 21 | 2017 |
| Streamlined subrecursive degree theory L Kristiansen, JC Schlage-Puchta, A Weiermann Annals of Pure and Applied Logic 163 (6), 698-716, 2012 | 20 | 2012 |
| Complexity classes and fragments of C L Kristiansen, PJ Voda Information Processing Letters 88 (5), 213-218, 2003 | 19 | 2003 |
| A jump operator on honest subrecursive degrees L Kristiansen Archive for Mathematical Logic 37 (2), 105-125, 1998 | 17 | 1998 |
| On subrecursive representability of irrational numbers, part II L Kristiansen Computability 8 (1), 43-65, 2019 | 16 | 2019 |
| The Small Grzegorczyk Classes and the Typed λ-Calculus L Kristiansen, M Barra Conference on Computability in Europe, 252-262, 2005 | 16 | 2005 |
| Complexity-Theoretic Hierarchies Induced by Fragments of Gödel’s T L Kristiansen Theory of Computing Systems 43, 516-541, 2008 | 15 | 2008 |
| The surprising power of restricted programs and Gödel’s functionals L Kristiansen, PJ Voda International Workshop on Computer Science Logic, 345-358, 2003 | 15 | 2003 |
| Subrecursive degrees and fragments of Peano arithmetic L Kristiansen Archive for Mathematical Logic 40, 365-397, 2001 | 14 | 2001 |
| Information content and computational complexity of recursive sets L Kristiansen Gödel'96: Logical foundations of mathematics, computer science and physics …, 1996 | 14 | 1996 |
| A friendly introduction to mathematical logic, 2015 CC Leary, L Kristiansen | 14 | |
| 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 | 13 | 2012 |
| Higher types, finite domains and resource-bounded Turing machines L Kristiansen Journal of Logic and Computation 22 (2), 281-304, 2012 | 10 | 2012 |
Neil JonesVerified email at diku.dk
