The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lars Kristiansen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lars Kristiansen, Neil D. Jones
    The Flow of Data and the Complexity of Algorithms. [Citation Graph (0, 0)][DBLP]
    CiE, 2005, pp:263-274 [Conf]
  2. Lars Kristiansen, Mathias Barra
    The Small Grzegorczyk Classes and the Typed lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    CiE, 2005, pp:252-262 [Conf]
  3. Lars Kristiansen
    Complexity-Theoretic Hierarchies. [Citation Graph (0, 0)][DBLP]
    CiE, 2006, pp:279-288 [Conf]
  4. Lars Kristiansen, Paul J. Voda
    The Surprising Power of Restricted Programs and Gödel's Functionals. [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:345-358 [Conf]
  5. Lars Kristiansen, Paul J. Voda
    The Trade-Off Theorem and Fragments of Gödel's T. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:654-674 [Conf]
  6. Lars Kristiansen
    Neat function algebraic characterizations of logspace and linspace. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2005, v:14, n:1, pp:72-88 [Journal]
  7. Lars Kristiansen, Karl-Heinz Niggl
    The Garland Measure and Computational Complexity of Stack Programs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:90, n:1, pp:- [Journal]
  8. Lars Kristiansen, Paul J. Voda
    Complexity classes and fragments of C. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:88, n:5, pp:213-218 [Journal]
  9. Lars Kristiansen, Paul J. Voda
    Programming Languages Capturing Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2005, v:12, n:2, pp:89-115 [Journal]
  10. Lars Kristiansen, Karl-Heinz Niggl
    On the computational complexity of imperative programming languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:318, n:1-2, pp:139-161 [Journal]

  11. Recursion in Higher Types and Resource Bounded Turing Machines. [Citation Graph (, )][DBLP]


  12. Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. [Citation Graph (, )][DBLP]


  13. The Structure of Detour Degrees. [Citation Graph (, )][DBLP]


  14. On the complexity of determining autonomic policy constrained behaviour. [Citation Graph (, )][DBLP]


  15. A jump operator on honest subrecursive degrees. [Citation Graph (, )][DBLP]


  16. Subrecursive degrees and fragments of Peano Arithmetic. [Citation Graph (, )][DBLP]


Search in 0.016secs, Finished in 0.016secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002