1. On the synthesis of some classes of control systems;O. B. Lupanov,1963
2. D. E. Knuth, The Art of Computer Programming, Vol. 2: Seminumerical Algorithms (Addison-Wesley, Reading, Mass., 1981).
3. V. V. Kochergin, ‘‘On the complexity of computations in finite Abelian groups,’’ in Mathematical Problems in Cybernetics (Nauka, Moscow), vol. 4, pp. 178–217.
4. V. V. Kochergin, ‘‘On some measures of complexity of finite Abelian groups,’’ Discrete Math. Appl. 27 (2), 81–95 (2017). https://doi.org/10.1515/dma-2017-0010
5. V. V. Kochergin, ‘‘Bellman’s, Knut’s, Lupanov’s, Pippenger’s problems and their variations as generalizations of the addition chain problem,’’ in Mathematical Problems in Cybernetics (Fizmatlit, Moscow, 2022), vol. 20, pp. 119–256. https://doi.org/10.20948/mvk-2022-119