The computational complexity of program schemata

  • Klaus Weihrauch
Wednesday Morning
Part of the Lecture Notes in Computer Science book series (LNCS, volume 14)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. AU 70.
    A. V. Aho, J.D. Ullman, Transformations on straight line programs, 2nd Annual ACM Symposium on Theory of Computing (1970), 136–148.Google Scholar
  2. Br 72.
    N. Bracha, Transformations on loop-free program schemata, Department of Computer Science, University of Urbana, Illinois, Report No. UIUCDCS-R-72-516 (1972).Google Scholar
  3. Cd 73.
    A.K. Chandra, Efficient compilation of linear recursive programs, 14th Annual Symposium on Switching and Automata Theory (1973), 16–25.Google Scholar
  4. Cs 73.
    R.L. Constable, Type two computational complexity, 5th Annual ACM Symposium on Theory of Computing (1973), 108–121Google Scholar
  5. Ly 72.
    N.A. Lynch, Relativization of the theory of computational complexity, Massachusetts Institute of Technology, Project MAC, TR-99 (1972).Google Scholar
  6. Sm 71.
    D.M. Symes, The extension of machine-independent computational complexity theory to oracle machine computation and to the computation of finite functions, Thesis, University of Waterloo, Waterloo, Ontario (1971).Google Scholar
  7. LPP 70.
    D.C. Luckham, D.M.R. Park, and M.S. Paterson, On formalized computer programs, J. Comput. System Science 4 (1970), 220–249.Google Scholar
  8. W 74.
    K. Weihrauch, On the computational complexity of program schemata, TR 74–196, Cornell University, 1974, and Seminarbericht Nr. 70, GMD Bonn, 1974.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1974

Authors and Affiliations

  • Klaus Weihrauch
    • 1
  1. 1.Universität BonnGermany

Personalised recommendations