A. A. Evdokimov, T. I. Fedoryaeva, “Tree-like structure graphs with full diversity of balls”, J. Appl. Industr. Math., 12:1 (2018), 19–27
2016
2.
A. A. Evdokimov, E. P. Kutcenogaya, T. I. Fedoryaeva, “On the full diversity of balls for graphs”, Prikl. Diskr. Mat. Suppl., 2016, no. 9, 110–112
3.
A. A. Evdokimov, “An algorithm for recognizing the completeness of a set of words and dynamics of prohibitions”, Prikl. Diskr. Mat. Suppl., 2016, no. 9, 10–12
2014
4.
A. A. Evdokimov, T. I. Fedoryaeva, “On the Problem of Characterizing the Diversity Vectors of Balls”, Journal of Applied and Industrial Mathematics., 8:2 (2014), 190–195
5.
A. A. Evdokimov, S. E. Kochemazov,I. V. Otpushchennikov, and A. A. Semenov, “Study of Discrete Automaton Models of Gene Networks of Nonregular Structure Using Symbolic Calculations”, Journal of Applied and Industrial Mathematics, 8:3 (2014), 307–316
6.
A. A. Evdokimov, “Circuit codes and the Snake-in-the-Box Problem”, Physics and mathematics, Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 156, no. 3, Kazan University, Kazan, 2014, 55–65
2013
7.
A. A. Evdokimov, S. E. Kochemazov, I. V. Otpushennikov, A. A. Semenov, “Dynamical properties of some discrete automaton mappings defined by random graphs”, Prikl. Diskr. Mat. Suppl., 2013, no. 6, 75–76
2012
8.
A. A. Evdokimov, A. L. Perezhogin, “Discrete dynamical systems of a circulant type with linear functions at vertices of network”, J. Appl. Industr. Math., 6:2 (2012), 160–166
2011
9.
A. A. Evdokimov, “Coding of finite integer Lattice by means of mappings with a bounded distortion”, Prikl. Diskr. Mat., 2011, no. supplement № 4, 8–9
10.
E. O. Kutumova ., A. A. Evdokimov, “Reversible states of functioning the regulatory circuits discrete models the gene nets”, Vestnik TGU. Upravlenie, vychislitelnaya tekhnika i informatika, 14:1 (2011), 85–94
11.
A. A. Evdokimov, S. E. Kochemazov, A. A. Semenov, “Primenenie simvolnykh vychislenii k issledovaniyu diskretnykh modelei nekotorykh klassov gennykh setei”, Vychislitelnye tekhnologii, 16:1 (2011), 30–47
2009
12.
A. A. Evdokimov, “Embeddings from the Class of Parametric Mappings of Bounded Distortion”, Physics and mathematics, Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 151, no. 2, Kazan University, Kazan, 2009, 72–79
2008
13.
A. A. Evdokimov, A. A. Levin, “A toolkit for graphical analysis of word chains”, Prikl. Diskr. Mat., 2008, no. 1, 108–110
14.
A. A. Evdokimov, “Diskretnye modeli gennykh setei: analiz i slozhnost funktsionirovaniya”, Sovmestnyi vypusk zhurnalov Vychislitelnye tekhnologii, 2008,T.13,#3 i Vestnik Kazakhskogo nats.un-ta. Ser. matem., mekh.,inform., 3:58 (2008), 31–37,
15.
A . A. Evdokimov, E. O. Likhovidova, “Diskretnaya model gennoi seti tsirkulyantnogo tipa s porogovymi funktsiyami”, Vestnik TGU. Upravlenie, vychislitelnaya tekhnika i informatika, 2:3 (2008), 18–21
2007
16.
V. B. Alekseev, S. B. Gashkov, A.A. Evdokimov, Yu.L. Ershov, Yu.I. Zhuravlëv, N.A. Karpova, O.M. Kasim-Zade, A.D. Korshunov, M.M. Lavrentev, N.P. Redkin, A.A. Sapozhenko, A.B. Ugolnikov, V.M. Khrapchenko, A.V. Chashkin, V.N. Chubarikov., “Pamyati Olega Borisovicha Lupanova”, Diskret. analiz i issled. operatsii.Seriya 1, 14:1 (2007), 3–20
2005
17.
V. L. Beresnev, A. A. Evdokimov, A. D. Korshunov, P. S. Krasnoshchekov, V. K. Leont'ev, O. B. Lupanov, Yu. N. Pavlovsky, A. A. Sapozhenko, Yu. A. Flerov, “Yurii Ivanovich Zhuravlev (on his 70th birthday)”, Diskretn. Anal. Issled. Oper., 12:1 (2005), 3–11
18.
A. A. Evdokimov, E. D. Grigorenko,V. A. Likhoshvai,I. A. Lobareva, “Nepodvizhnye tochki i tsikly avtomatnykh otobrazhenii, modeliruyuschikh funktsionirovanie gennykh setei”, Vestnik TGU, #14:Prilozhenie (2005), 206–212
2004
19.
A.A. Evdokimov, S.V. Kitaev, “Crucial words and the complexity of some extremal problems for sets of prohibited words”, Journal of Combinatorial Theory Series A, 105:2 (2004), 273–289
A. A. Evdokimov, “Issledovanie polnoty mnozhestv slov i yazykov s zapretami.”, Vestnik Tomskogo gosudarstvennogo universiteta, 9:1, Prilozhenie (2004), 8–12.
21.
A. A. Evdokimov, “On some directions in investigations in discrete analysis,”, Problems of theoretical cybernetics, 2004, 49–58
2000
22.
A. A. Evdokimov, “Coding of structured information and embeddings of discrete spaces”, Diskretn. Anal. Issled. Oper., 7:4 (2000), 48–58
2001
23.
A. A. Evdokimov, A. L. Perezhogin, “Minimal enumerations of subsets of a finite set and the middle level problem”, Discrete Appl. Math., 114:1-3 (2001), 109-114
1995
24.
A. A. Evdokimov, “International conference “Mathematical Models in Control-System Theory””, Diskretn. Anal. Issled. Oper., 2:3 (1995), 68–84
25.
A. A. Evdokimov, “Locally isometric embeddings of graphs and the metric prolongation property”, Discrete Analysis and Operations Research., 1995, 7–14 , Dordrecht: Kluwer Academic Publishers
A. A. Evdokimov, V. Nju, “The length of a supersequence for the set of binary (0,1)-words with a given number of 1's”, Siberian Adv. Math., 4 (1994), 43–50
1992
27.
Yu.L.Vasilev, A.A.Evdokimov, A.D.Korshunov, V.V.Kudryavtsev, E.P.Lipatov, A.A.Sapozhenko, V.M.Khrapchenko, S.V.Yablonskii, “Oleg Borisovich Lupanov (k shestidesyatiletiyu so dnya rozhdeniya)”, Metody diskretnogo analiza v teorii grafov i slozhnosti, 1992, Sb. nauch. tr. Novosibirsk: Institut matematiki SO AN SSSR, no. Vyp. 52., 3–14
1990
28.
A.A. Evdokimov, “Vlozhenie tsepei i tsiklov v giperkub. I”, Metody diskretnogo analiza v reshenii ekstremalnykh zadach, 1990, no. 50, Sb. nauch. tr. Novosibirsk: In-t matematiki SO AN SSSR, 10–25
1988
29.
A.A. Evdokimov, “Metricheskie svoistva vlozhenii i kody, sokhranyayuschie rasstoyaniya.”, Trudy In-ta matem. SO AN SSSR,, 10 (1988), 116–132
30.
A. A. Evdokimov, “Metric properties of embeddings, and codes that preserve distance”, Trudy Inst. Mat. Sib. Otd. AN SSSR, 10 (1988), 116–132
1987
31.
A.A.Evdokimov, S.A.Malyugin, “Kod “zmeya v yaschike” i puti v reshetke na tore”, Matematika segodnya., 1987, Kiev: Vischa shkola,, 108–116.
1984
32.
A. A. Evdokimov,, “The completeness of sets of words.”, Proceedings of the All-Union seminar on discrete mathematics and its applications, 1984, 112–116,; A. A. Evdokimov, “Polnota mnozhestva slov”, Diskretnaya matematika i ee prilozheniya. Materialy vsesoyuznogo seminara., 1986., 112-116
1983
33.
A. A. Evdokimov, “Polnye mnozhestva slov i ikh chislovye kharakteristiki.”, Metody diskretnogo analiza v issledovanii ekstremalnykh struktur, 1983, no. Vyp.39, Sb. nauchn. tr. Novosibirsk: In-t matematiki SO AN SSSR, 7–19
34.
A.A.Evdokimov,V. Nyu, “Pokrytiya grafov marshrutami”, Metody diskretnogo analiza v optimizatsii upravlyayuschikh sistem, 1983, Sb. nauchn. tr. Novosibirsk: Institut matematiki SO AN SSSR,, no. 40, 72–86
1980
35.
A. A. Evdokimov, “O numeratsii podmnozhestv konechnogo mnozhestva”, Metody diskretnogo analiza v reshenii kombinatornykh zadach, 1980, no. Vyl.34, Sb. nauch. tr. Novosibirsk: In-t matematiki SO AN SSSR., S. 8–26.
1976
36.
A.A. Evdokimov, “Tsepnye kody s proizvolnym rasstoyaniem.”, Dokl. AN SSSR, 228:6 (1976), 1273–1276