Skip to main content
SpringerLink
Log in

Construction of a minimal tree packing in optimal memory allocation

  • 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. J. Nakata, “On compiling algorithms for arithmetic expressions,” Commun. ACM,10, No. 8 (1967).

    Google Scholar 

  2. R. Redzheevski, “On arithmetic expressions and trees,” in: Cybernetics Collection [in Russian], Vol. 7, Moscow (1970).

  3. V. A. Chebakov, “Planar packing of trees,” Zh. Vychisl. Mat. Fiz., No. 3 (1972).

  4. E. A. Zhogolev, M. I. Kabanov, and N. P. Trifonov (editors), Computation Methods and Programming [in Russian], No. 17, Izd. Mosk. Univ. (1971).

Download references

Authors
  1. N. M. Khaikin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. I. Zak
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 58–63, May–June, 1976.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Khaikin, N.M., Zak, E.I. Construction of a minimal tree packing in optimal memory allocation. Cybern Syst Anal 12, 392–399 (1976). https://doi.org/10.1007/BF01070019

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation