1. Anisimov, A. V. [Ani] Optimal packing of trees, Kibernetika, No. 3, 89–91 (1976).
2. Anisimov, A. V., Karpenko, I. V., and Krizhanovsky, V. V. [AKK] Representations of ordered trees, Kibernetika, No. 3, 29–34 (1980).
3. Beyer, T. and Hedetniemi, S. M. [BeH] Constant time generation of rooted trees, SIAM J. Computing, 9, No. 4, 706-712(1980).
4. Evstigneev, V. A. [Evs] Graphs of addressed data, in: Combinatorial and Algebraic Methods in Applied Mathematics, Gorky (1986), 39–60 [in Russian].
5. Gupta, U., Lee, D. T., and Wong, C. K. [GLW] Ranking and unranking of 2-3 trees, SIAM J. Computing, 11, No. 3, 582–590 (1982).