Leont'ev Vladimir Konstantinovich

Publications in Math-Net.Ru

1. On the average number of solutions in the knapsack problem
   
   Prikl. Diskr. Mat., 2025, no. 68,  103–113
2. On relations associated with the Euler function
   
   Diskretn. Anal. Issled. Oper., 30:4 (2023),  35–45
3. On the Frobenius problem
   
   Diskretn. Anal. Issled. Oper., 29:2 (2022),  24–37
4. On the number of solutions to linear Diophantine equation and Frobenius problem
   
   Zh. Vychisl. Mat. Mat. Fiz., 62:9 (2022),  1447–1457
5. On the number of solutions to a system of Boolean equations
   
   Avtomat. i Telemekh., 2021, no. 9,  150–168
6. On the annihilators of Boolean polynomials
   
   Diskretn. Anal. Issled. Oper., 27:1 (2020),  88–109
7. Geometry of translations on a Boolean cube
   
   Probl. Peredachi Inf., 55:2 (2019),  58–81
8. On combinatorial properties of the knapsack problem
   
   Zh. Vychisl. Mat. Mat. Fiz., 59:8 (2019),  1439–1447
9. On a partial order related to divisibility
   
   Diskretn. Anal. Issled. Oper., 25:2 (2018),  54–61
10. On the number of roots of Boolean polynomials
    
    Zh. Vychisl. Mat. Mat. Fiz., 58:7 (2018),  1235–1245
11. On spectra of linear codes
    
    Probl. Peredachi Inf., 53:4 (2017),  43–48
12. On a Diophantine Equation
    
    Mat. Zametki, 100:3 (2016),  388–398
13. On pseudo-Boolean polynomials
    
    Zh. Vychisl. Mat. Mat. Fiz., 55:11 (2015),  1952–1958
14. Classification of subsets of $B^n$ and additive channels
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2014, no. 5,  23–29
15. On systems of Boolean equations
    
    Zh. Vychisl. Mat. Mat. Fiz., 53:5 (2013),  800–807
16. Reconstruction of cyclic words from their fragments
    
    Probl. Peredachi Inf., 48:2 (2012),  121–126
17. Code volume boundaries in the additive channel
    
    Proceedings of the YSU, Physical and Mathematical Sciences, 2012, no. 2,  14–21
18. Constant weight perfect and $D$-representable codes
    
    Proceedings of the YSU, Physical and Mathematical Sciences, 2012, no. 1,  16–19
19. Symmetric Boolean polynomials
    
    Zh. Vychisl. Mat. Mat. Fiz., 50:8 (2010),  1520–1531
20. Some Number-Theoretic Combinatorial Problems
    
    Mat. Zametki, 86:3 (2009),  402–407
21. On measures of similarity and distances between objects
    
    Zh. Vychisl. Mat. Mat. Fiz., 49:11 (2009),  2041–2058
22. On Perfect Codes for an Additive Channel
    
    Probl. Peredachi Inf., 44:4 (2008),  12–19
23. On Fragments of Words over a $q$-ary Alphabet
    
    Probl. Peredachi Inf., 44:3 (2008),  63–69
24. On the faces of an $n$-dimensional cube
    
    Zh. Vychisl. Mat. Mat. Fiz., 48:6 (2008),  1126–1139
25. Discrete optimization
    
    Zh. Vychisl. Mat. Mat. Fiz., 47:2 (2007),  338–352
26. Characterization of binary words by subwords
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 13:1 (2006),  65–76
27. Roots of Random Polynomials over a Finite Field
    
    Mat. Zametki, 80:2 (2006),  313–316
28. On Fragments of Words
    
    Probl. Peredachi Inf., 42:3 (2006),  73–77
29. Tests for words
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 11:2 (2004),  66–72
30. Monotone Boolean polynomials
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 9:4 (2002),  41–49
31. Some metric problems in the $n$-dimensional cube
    
    Zh. Vychisl. Mat. Mat. Fiz., 42:2 (2002),  249–255
32. Certain problems associated with Boolean polynomials
    
    Zh. Vychisl. Mat. Mat. Fiz., 39:6 (1999),  1045–1054
33. On the zeros of Boolean polynomials
    
    Zh. Vychisl. Mat. Mat. Fiz., 38:9 (1998),  1608–1615
34. A general approach to the study of the stability of solutions in discrete optimization problems
    
    Zh. Vychisl. Mat. Mat. Fiz., 36:1 (1996),  66–72
35. Problems of the reconstruction of words from fragments, and their applications
    
    Diskretn. Anal. Issled. Oper., 2:2 (1995),  26–48
36. Recognition of binary words from their fragments
    
    Dokl. Akad. Nauk, 330:4 (1993),  434–436
37. Approximate solutions of systems of Boolean equations
    
    Zh. Vychisl. Mat. Mat. Fiz., 33:9 (1993),  1383–1390
38. On the accuracy of the input data in trajectory problems
    
    Zh. Vychisl. Mat. Mat. Fiz., 33:8 (1993),  1260–1264
39. Reconstruction of vectors from sets of their fragments
    
    Dokl. Akad. Nauk SSSR, 302:6 (1988),  1319–1322
40. On the possibility of propagating information on graphs
    
    Dokl. Akad. Nauk SSSR, 298:2 (1988),  265–268
41. Stability of solutions in problems of Boolean linear programming
    
    Zh. Vychisl. Mat. Mat. Fiz., 28:10 (1988),  1475–1481
42. Estimates of the complexity of tabulating trajectory problems
    
    Zh. Vychisl. Mat. Mat. Fiz., 25:8 (1985),  1272–1275
43. On a non-classical recognition problem
    
    Zh. Vychisl. Mat. Mat. Fiz., 24:6 (1984),  925–931
44. Realizability of lengths in trajectory problems
    
    Zh. Vychisl. Mat. Mat. Fiz., 24:5 (1984),  747–753
45. Parametric trajectory problems
    
    Zh. Vychisl. Mat. Mat. Fiz., 24:1 (1984),  37–46
46. Computing algorithms for determination of the radius of stability in choice problems
    
    Zh. Vychisl. Mat. Mat. Fiz., 23:4 (1983),  973–979
47. A problem of Sperner type
    
    Zh. Vychisl. Mat. Mat. Fiz., 22:3 (1982),  710–716
48. On relations of trajectory lengths in combinatorial choice problems
    
    Dokl. Akad. Nauk SSSR, 258:5 (1981),  1049–1052
49. Stability in bottleneck problems
    
    Zh. Vychisl. Mat. Mat. Fiz., 20:4 (1980),  1071–1075
50. Discrete extremal problems
    
    Itogi Nauki i Tekhniki. Ser. Teor. Veroyatn. Mat. Stat. Teor. Kibern., 16 (1979),  39–101
51. Metric Functionals on a Unit $n$-Dimensional Cube
    
    Probl. Peredachi Inf., 15:4 (1979),  32–39
52. Stability in combinatorial choice problems
    
    Dokl. Akad. Nauk SSSR, 228:1 (1976),  23–25
53. Nonexistence of Perfect Codes for Some Composite Alphabets
    
    Probl. Peredachi Inf., 11:3 (1975),  3–13
54. A certain class of systems of Boolean equations
    
    Zh. Vychisl. Mat. Mat. Fiz., 15:6 (1975),  1568–1579
55. Stability of the traveling salesman problem
    
    Zh. Vychisl. Mat. Mat. Fiz., 15:5 (1975),  1298–1309
56. An upper bound for the $\alpha$-height of $(0,1)$-matrices
    
    Mat. Zametki, 15:3 (1974),  421–429
57. Investigation of a certain algorithm for the solution of the traveling salesman problem
    
    Zh. Vychisl. Mat. Mat. Fiz., 13:5 (1973),  1228–1236
58. Error-Detecting Encoding
    
    Probl. Peredachi Inf., 8:2 (1972),  6–14
59. On Perfect Codes
    
    Probl. Peredachi Inf., 8:1 (1972),  26–35
60. A Hypothesis on Bose–Chaudhuri Codes
    
    Probl. Peredachi Inf., 4:1 (1968),  83–85


61. Yurii Ivanovich Zhuravlev (on his 70th birthday)
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 12:1 (2005),  3–11