1. O. I. Golubeva, “Construction of Permissible Functions and their Application for Fault Tolerance,” in Proceedings of International Siberian Conference on Control and Communications (SIBCON), (Tomsk, Russia, Apr. 18–20, 2019) (TUSUR, Tomsk, 2019), pp. 1–5.
2. A. A. Voronenko, “On a Decomposition Method for Recognizing Membership in Invariant Classes,” Diskret. Mat. 14 (4), 110–116 (2002)
3. A. A. Voronenko, Discrete Math. Appl. 12 (6), 607–614 (2002)].
4. S. N. Selezneva, “Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time,” in Lecture Notes in Computer Science, Vol. 7353: Computer Science—Theory and Applications (Springer, Heidelberg, 2012), pp. 303–312.
5. V. B. Alekseev and N. R. Emel’yanov, “A Method for Constructing Fast Algorithms in k-Valued Logic,” Mat. Zametki 38 (1), 148–156, 171 (1985)