Literature Cited
D. Knute, Art of Programming for Electronic Computers. Fundamental Algorithms [Russian translation], Vol. 1, Mir, Moscow (1976).
E. Rheingold, U. Nivergelt, and N. Deo, Combinatorial Algorithms. Theory and Practice [Russian translation], Mir, Moscow (1980).
A. Renyi, On the Mathematical Theory of Trees. Trilogy on Mathematics [Russian translation], Mir, Moscow (1980), pp. 353–375.
A. Renyi, Variations on a Theme of Fibonacci. Trilogy on Mathematics [Russian translation], Mir, Moscow (1980), pp. 326–352.
N. N. Vorob'ev, Fibonacci Numbers [in Russian], Nauka, Moscow (1984).
A. Berztiss, Data Structure [in Russian], Statistika (1974).
A. B. Vinokur and G. P. Kozhevnikova, “On a class of regular trees used in the complexity analysis of algorithms,” preprint No. 82-18, Inst. Kibern., Akad. Nauk, Ukr. SSR, Kiev (1982).
A. B. Vinokur and G. P. Kozhevnikova, “Approach to the formalization of an estimate of the efficiency of programmed transformations on the basis of an analysis of the properties of algorithms and data structures,” Optimization and Transformation of Programs: Materials of an All-Union Seminar (Novosibirsk, 1983) [in Russian], Vol. 1, 67–75, Vychisl. Tsentr. Sib. Otd. Akad. Nauk SSSR, Novosibirsk (1983).
Additional information
Translated from Kibernetika, No. 6, pp. 9–12, November–December, 1986.
Rights and permissions
About this article
Cite this article
Vinokur, A.B. Huffman trees and fibonacci numbers. Cybern Syst Anal 22, 692–696 (1986). https://doi.org/10.1007/BF01068684
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068684