Skip to main content
SpringerLink
Log in

Toward mechanical analysis of the computational complexity of algorithms

  • Published:
Cybernetics Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. S. S. Marchenkov and V. L. Matrosov, “Complexity of algorithms and computations,” in: Results in Science and Technology, Ser. Probability Theory, Mathematical Statistics, Theoretical Cybernetics [in Russian], Vol. 16, Moscow (1979), pp. 103–149.

  2. B. Weide, “Analysis techniques for discrete algorithms,” Comput. Surv.,9, No. 4, 291–313 (1977).

    Google Scholar 

  3. C. V. Ramamoorthy, “Discrete Markov analysis of computer programs,” in: Proc. ACM 20th National Conf. (1965), pp. 386–392.

  4. Z. V. Alferova, Economics Software Using Graph Theory [in Russian], Statistika, Moscow (1974).

    Google Scholar 

  5. G. P. Kozhevnikova, A. P. Zavada, and Ts. L. Sokolyanskaya, “Machine modeling of abstract M-automata intended for symbolic transformations and their efficiency evaluation,” Preprint Inst. Kibern. Akad. Nauk UkrSSR, No. 75–32, Kiev (1975).

  6. D. Knuth, “An empirical study of FOR TRAN programs,” Software-Pract. Exper.,1, 101–103 (1971).

    Google Scholar 

  7. A. G. Nemeth and P. D. Rovner, “User program measurement in time-shared environment,” Commun. ACM,14, No. 10, 661–666 (1971).

    Google Scholar 

  8. B. A. Golovkin, “Computing the probability distribution of the execution time of machine programs,” Upr. Sist. Mash., No. 3, 23–28 (1974).

    Google Scholar 

  9. G. P. Grigorenko and M. I. Egorov, “Some problems of practical evaluation of algorithms,” in: Software for Computerized Control Systems [in Russian], Moscow (1975), pp. 23–32.

  10. V. I. Znak, “An algorithm for prior estimation of the execution time of computer programs,” Avtometriya, No. 1, 101–110 (1972).

    Google Scholar 

  11. S. P. Zharkov and P. A. Sokolov, “A procedure for determining the information characteristics of algorithms (programs),” in: Computer Technology [in Russian], No. 5, Penza (1975), pp. 14–19.

  12. K. V. Shakhbazyan and T. A. Tushkina, “Statistical efficiency of algorithms for one problem of graph node partitioning,” Kibernetika, No. 5, 38–43 (1977).

    Google Scholar 

  13. B. Wegbreit, “Mechanical program analysis,” Commun. ACM,18, No. 9, 528–539 (1975).

    Google Scholar 

  14. J. Cohen and C. Zuckerman, “Two languages for estimating program efficiency,” Commun. ACM,17, No. 6, 301–308 (1974).

    Google Scholar 

  15. J. Low and P. Rovner, “Techniques for the automatic selection of data structures,” Proc. SIGPLANSIGACT Conf. on the Principles of Programming Languages (1976).

  16. G. P. Kozhevnikova and A. A. Stognii, “Representation of analytical expressions for computer execution of symbolic transformations,” Kibernetika, No. 4, 54–66 (1975).

    Google Scholar 

  17. G. P. Kozhevnikova, “Estimating the efficiency of symbolic transformation algorithms,” Upr. Sist. Mash., No. 1, 98–102 (1974).

    Google Scholar 

  18. A. P. Zavada, “A class of walks through tree graphs,” in: Mathematical Methods of Modeling and Design of Information Systems [in Russian], Kiev (1978), pp. 33–38.

  19. G. P. Kozhevnikova and Yu. A. Rybalko, “On syntactic structures of trees with binary operations,” in: Problems of Organization of Computations [in Russian], Kiev (1974), pp. 49–59.

  20. A. B. Vinokur and G. P. Kozhevnikova, “Analysis of algorithm efficiency using the AVS-1 analyzer,” In: Theoretical and System Programming [in Russian], Kiev (1979), pp. 56–66.

  21. “Analysis of computational complexity of algorithms,” Preprint Inst. Kibern. Akad. Nauk UkrSSR, No. 79-14, Kiev (1979).

  22. A. P. Zavada, G. P. Kozhevnikova, and A. L. Sinitskii, “Automatic generation of data structures in mechanical analysis systems for computational complexity of algorithms,” in: Soviet Symp. Artificial Intelligence and Mechanical Mathematics, Abstracts of Papers and Communications [in Russian], Kiev (1978), pp. 28–30.

  23. G. P. Kozhevnikova and O. V. Kostiv, “Formalized complexity analysis of differentiation algorithms in application to different levels of their representation,” in: Soviet Symp. Artificial Intelligence and Mechanical Mathematics, Abstracts of Papers and Communications [in Russian], Kiev (1978), pp. 39–41.

  24. A. P. Zavada and G. P. Kozhevnikova, “Investigating the computational complexity of one class of tree equivalence recognizing algorithms,” in: Problems of Development of Programming Systems [in Russian], Kiev (1978), pp. 33–40.

Download references

Authors
  1. G. P. Kozhevnikova
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 5, pp. 65–73, September–October, 1980.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kozhevnikova, G.P. Toward mechanical analysis of the computational complexity of algorithms. Cybern Syst Anal 16, 706–714 (1980). https://doi.org/10.1007/BF01078500

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01078500

Keywords

Search

Navigation