Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Functions of binary trees and their applications in algorithm complexity analysis

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

Literature Cited

  1. 1.

    F. Flajobet, “Analyse d'algorithmes de manipulation d'arbres et de fichiers,” Can. Bur. Univ. Rech. Oper., Nos. 34–35, 1–209 (1981).

  2. 2.

    G. P. Kozhevnikova, “Automation of the analysis of the computational complexity of algorithm,” Kibernetika, No. 5, 65–73 (1980).

  3. 3.

    A. P. Zavada and G. P. Kozhevnikova, “Problems of complexity analysis of algorithms,” Kibernetika, No. 6, 124–125 (1980).

  4. 4.

    A. B. Vinokur and G. P. Kozhevnikova “Analysis of the efficiency of an algorithm on the basis of an ABC-1 analyzer,” in: Theoretical and Systemic Programming [in Russian], IK AN UkrSSR, Kiev (1979), pp. 56–66.

  5. 5.

    M. Hellerman, “Parallel processing of algebraic expressions,” IEEE Trans.,15, No. 1, 82–91 (1966).

  6. 6.

    A. Berztiss, Data Structures [Russian translation], Statistika, Moscow (1974).

  7. 7.

    A. B. Vinokur and G. P. Kozhevnikova, A Class of Regular Trees Used in Complexity Analysis of Algorithms [in Russian], No. 82-18, Preprint of the Institute of Cybernetics, Academy of Sciences of the Ukrainian SSR, Kiev (1982).

  8. 8.

    D. E. Knuth, The Art of Computer Programming: Fundamental Algorithms, Vol. 1, 2nd Ed., Addison-Wesley, Reading MA (1974).

  9. 9.

    L. P. Lisovik, “Finite transducers over marked trees and quasiidentities in a free semigroup,” Probl. Kibern., No. 40, 19–41 (1983).

  10. 10.

    T. Kamimura, “Tree automata and attribute grammars,” Lect. Notes. Comput. Sci.,154, 374–384 (1983).

  11. 11.

    F. Gëcseg and M. Steinby, Tree Automata, Akad. Kiado, Budapest (1984).

  12. 12.

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

  13. 13.

    A. B. Vinokur and G. P. Kozhevnikova, Formalized Analysis of Complexity of Hierarchical Algorithms Based on Recognizing Their Classification Properties [in Russian], No. 86-9, Preprint of the Institute of Cybernetics, Academy of Sciences of the Ukrainian SSR, Kiev (1986).

Download references

Additional information

Translated from Kibernetika, No. 3, pp. 35–44, May–June, 1987

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Vinokur, A.B., Kozhevnikova, G.P. Functions of binary trees and their applications in algorithm complexity analysis. Cybern Syst Anal 23, 328–340 (1987). https://doi.org/10.1007/BF01074824

Download citation

Keywords

  • Operating System
  • Artificial Intelligence
  • System Theory
  • Complexity Analysis
  • Binary Tree