The SCEAS System
| |||||||

## Search the dblp DataBase
Lars Kristiansen:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - Lars Kristiansen, Mathias Barra
**The Small Grzegorczyk Classes and the Typed lambda-Calculus.**[Citation Graph (0, 0)][DBLP] CiE, 2005, pp:252-262 [Conf] - Lars Kristiansen
**Complexity-Theoretic Hierarchies.**[Citation Graph (0, 0)][DBLP] CiE, 2006, pp:279-288 [Conf] - 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] - Lars Kristiansen, Paul J. Voda
**The Trade-Off Theorem and Fragments of Gödel's**[Citation Graph (0, 0)][DBLP]*T*. TAMC, 2006, pp:654-674 [Conf] - 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] - 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] - 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] - 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] - 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] **Recursion in Higher Types and Resource Bounded Turing Machines.**[Citation Graph (, )][DBLP]**Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time.**[Citation Graph (, )][DBLP]**The Structure of Detour Degrees.**[Citation Graph (, )][DBLP]**On the complexity of determining autonomic policy constrained behaviour.**[Citation Graph (, )][DBLP]**A jump operator on honest subrecursive degrees.**[Citation Graph (, )][DBLP]**Subrecursive degrees and fragments of Peano Arithmetic.**[Citation Graph (, )][DBLP]
Search in 0.016secs, Finished in 0.016secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |