The flow of data and the complexity of algorithms

Lecture Notes in Computer Science

Volumn 3526, Issue , 2005, Pages 263-274

  Kristiansen, Lars ^a,b   Jones, Neil D ^c  

^a OSLO METROPOLITAN UNIVERSITY   (Norway)

^b UNIVERSITY OF OSLO   (Norway)

^c UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY OF ALGORITHM; FLOW OF DATA;

COMPUTATIONAL COMPLEXITY;

EID: 26444439144     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11494645_33     Document Type: Conference Paper

References (16)

1. A.V. Aho, J.E. Hopcroft, and D. Jeffrey. The design and analysis of computer algorithms. Addison-Wesley Publishing Co., Reading, Mass.-London-Amsterdam, 1975.
2. S.J. Bellantoni and S. Cook. A New Recursion-Theoretic Characterization of the Polytime Functions. Computational Complexity, 2:97-110 (1992).
3. V.H. Caseiro Equations for Defining Poly-time Functions. Ph.D. thesis, Dept. of informatics, Faculty of Mathematics and Natural Sciences University of Oslo, February 1997
4. C.C. Frederiksen. Automatic runtime analysis for first order functional programs. Master Thesis, Dep. of Computer Science, University of Copenhagen, 2002.
5. N.D. Jones. The expressive power of higher-order types or, life without CONS. J. Functional Programming 11 (2001), 55-94.
6. N.D. Jones. LOGSPACE and PTIME characterized by programming languages. Theoretical Computer Science 228 (1999), 151-174.
7. N.D. Jones and N. Bohr. Termination analysis of the untyped lambda-calculus. Rewriting Techniques and Applications, Springer LNCS Volume 3091 (2004), 1-23.
8. L. Kristiansen. Neat function algebraic characterizations of LOGSPACE and LINSPACE. Computational Complexity 14 (2005), 72-88.
9. L. Kristiansen and K.-H. Niggl. On the computational complexity of imperative programming languages. Theoretical Computer Science 318 (2004), 139-161.
10. L. Kristiansen and K.-H. Niggl. The Garland Measure and Computational Complexity of Stack Programs. Electronic Notes in Theoretical Computer Science, Volume 90, Elsevier 2003.
11. L. Kristiansen and P.J. Voda. Complexity classes and fragments of C. Information Processing Letters 88 (2003), 213-218.
12. L. Kristiansen and P.J. Voda. Programming languages capturing complexity classes. Submitted.
13. C.S. Lee, N. Jones, and A.M. Ben-Amram. The size-change principle for program termination. ACM Principles of Programming Languages ACM Press 2001, 81-92.
14. D. Leivant. Intrinsic theories and computational complexity. In "Logical and Computational Complexity. Selected Papers. Logic and Computational Complexity, International Workshop LCC '94", Leivant (ed.), 177-194, Springer, 1995.
15. K.-H. Niggl. Control Structures in Programs and Computational Complexity. Annals of Pure and Applied Logic 133 (2005), 247-273 MAY.
16. H. Simmons. The realm of primitive recursion. Arch. Math. Logic 27, 177-188 (1988).