Skip to main content
SpringerLink
Log in

Equivalence in a class of address 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

References

  1. E. L. Yushchenko, Address Programming [in Russian], Gostekhizdat Ukr. SSR, Kiev, 1963.

    Google Scholar 

  2. O. A. Letichevskii, “Equivalence in a class of address algorithms” [in Ukrainian], Collection of Works on Computational Mathematics and Technology, vol. 1, Vidavnitstvo AN Ukr. RSR, Kiev, 1961.

    Google Scholar 

  3. V. N. Porshneva, “Equivalence transformations of I-address complexes,” zhurn. Kibernetika, no. 4, Kiev, 1965.

  4. V. S. Korolyuk and O. A. Letichevskii, “On a class of address algorithms” [in Ukrainian], DAN Ukr. RSR, no. 2, Kiev, 1959.

Download references

Authors
  1. V. I. Malinovskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Kibernetika, Vol. 4, No. 1, p. 98, 1968

Rights and permissions

Reprints and permissions

About this article

Cite this article

Malinovskii, V.I. Equivalence in a class of address algorithms. Cybern Syst Anal 4, 66 (1968). https://doi.org/10.1007/BF01074763

Download citation

  • Issue Date:

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

Keywords

Search

Navigation