Zhuravlev Yurii Ivanovich

Publications in Math-Net.Ru

1. Two-level regression method using ensembles of trees with optimal divergence
   
   Dokl. RAN. Math. Inf. Proc. Upr., 499 (2021),  63–66
2. Research of the possibility to forecast changes in financial state of a credit organization on the basis of public financial statements
   
   Inform. Primen., 13:4 (2019),  30–35
3. Monotone dualization problem and its generalizations: asymptotic estimates of the number of solutions
   
   Zh. Vychisl. Mat. Mat. Fiz., 58:12 (2018),  2153–2168
4. Logical correctors in the problem of classification by precedents
   
   Zh. Vychisl. Mat. Mat. Fiz., 57:11 (2017),  1906–1927
5. Practical algorithms for algebraic and logical correction in precedent-based recognition problems
   
   Zh. Vychisl. Mat. Mat. Fiz., 54:12 (2014),  1979–1993
6. Algorithm for choosing conjunctions for logical recognition methods
   
   Zh. Vychisl. Mat. Mat. Fiz., 52:4 (2012),  746–749
7. Recognition algorithms with representative sets (logic algorithms)
   
   Zh. Vychisl. Mat. Mat. Fiz., 42:9 (2002),  1425–1435
8. Discrete analysis of feature descriptions in recognition problems of high dimensionality
   
   Zh. Vychisl. Mat. Mat. Fiz., 40:8 (2000),  1264–1278
9. Algebraic-logic synthesis of correct recognition procedures based on elementary algorithms
   
   Zh. Vychisl. Mat. Mat. Fiz., 36:8 (1996),  215–223
10. Sergei Vsevolodovich Yablonskii (on his 70th birthday)
    
    Sibirsk. Zh. Issled. Oper., 1:4 (1994),  3–6
11. The use of convolution algebras to construct correct recognition algorithms
    
    Zh. Vychisl. Mat. Mat. Fiz., 27:6 (1987),  912–923
12. An algorithm for constructing a disjunctive normal form equivalent to the product of the left-hand sides of Nelson Boolean equations
    
    Zh. Vychisl. Mat. Mat. Fiz., 26:8 (1986),  1243–1249
13. Realization of Boolean functions with a small number of zeros by disjunctive normal forms and related problems
    
    Dokl. Akad. Nauk SSSR, 285:4 (1985),  795–799
14. An approach to the question of constructing effective recognition algorithms
    
    Zh. Vychisl. Mat. Mat. Fiz., 25:2 (1985),  283–291
15. Efficient multiplication of Boolean equations
    
    Zh. Vychisl. Mat. Mat. Fiz., 24:1 (1984),  164–166
16. Prediction of outcome in myocardial infarction
    
    Dokl. Akad. Nauk SSSR, 261:6 (1981),  1307–1310
17. A model of pattern recognition algorithms with representative sets and systems of supporting sets
    
    Zh. Vychisl. Mat. Mat. Fiz., 21:5 (1981),  1264–1275
18. Recognition and classification problems with standard training information
    
    Zh. Vychisl. Mat. Mat. Fiz., 20:5 (1980),  1294–1309
19. Local algorithms over disjunctive normal forms
    
    Dokl. Akad. Nauk SSSR, 245:2 (1979),  289–292
20. Construction of recognition algorithms correct for a given control sample
    
    Zh. Vychisl. Mat. Mat. Fiz., 19:3 (1979),  726–738
21. Principles of construction of justification of algorithms for the solution of badly formalized problems
    
    Mat. Zametki, 23:6 (1978),  899–914
22. Extremal algorithms in an algebra over incorrect algorithms
    
    Dokl. Akad. Nauk SSSR, 237:3 (1977),  509–512
23. Algebras over sets of incorrect (heuristic) algorithms
    
    Dokl. Akad. Nauk SSSR, 235:4 (1977),  761–763
24. Extremal algorithms in mathematical models for discrimination and classification problems
    
    Dokl. Akad. Nauk SSSR, 231:3 (1976),  532–535
25. The coding of information that is optimal with respect to the accuracy of the prediction
    
    Zh. Vychisl. Mat. Mat. Fiz., 16:6 (1976),  1551–1558
26. An approach to optimization in a class of parametric recognition algorithms
    
    Zh. Vychisl. Mat. Mat. Fiz., 16:1 (1976),  209–218
27. Estimation of the quality of the experts that create a learning table in a pattern recognition problem
    
    Zh. Vychisl. Mat. Mat. Fiz., 12:4 (1972),  1066–1070
28. Measures of the importance of objects in complex systems
    
    Zh. Vychisl. Mat. Mat. Fiz., 12:1 (1972),  170–184
29. A certain procedure for improving a taxonomy algorithm by means of recognition methods of ballot type
    
    Zh. Vychisl. Mat. Mat. Fiz., 11:5 (1971),  1344–1347
30. An estimate of complexity of local algorithms for certain extremal properties on finite sets
    
    Dokl. Akad. Nauk SSSR, 158:5 (1964),  1018–1021
31. On a class of algorithms over finite sets
    
    Dokl. Akad. Nauk SSSR, 151:5 (1963),  1025–1028
32. A bound for the number of terminal d.n.f.'s of functions in the algebra of logic
    
    Sibirsk. Mat. Zh., 3:5 (1962),  802–804
33. Finite index algorithms for the simplification of disjunctive normal forms
    
    Dokl. Akad. Nauk SSSR, 139:6 (1961),  1329–1331
34. On the impossibility of constructing minimal disjunctive normal forms for functions of the algebra of logic in a single class of algorithms
    
    Dokl. Akad. Nauk SSSR, 132:3 (1960),  504–506
35. Simplification algorithms for disjunctive normal forms
    
    Dokl. Akad. Nauk SSSR, 132:2 (1960),  260–263
36. On minimal disjunctive normal forms
    
    Uspekhi Mat. Nauk, 15:4(94) (1960),  210–212
37. Various notions of minimality of disjunctive normal forms
    
    Sibirsk. Mat. Zh., 1:4 (1960),  609–610
38. Mathematical methods of controlling abstract transformations
    
    Dokl. Akad. Nauk SSSR, 123:2 (1958),  227–230
39. Optimum algorithms for selection
    
    Dokl. Akad. Nauk SSSR, 121:3 (1958),  411–414
40. Separability of subsets of vertices of the $n$-dimensional unit cube
    
    Trudy Mat. Inst. Steklov., 51 (1958),  143–157
41. On the separability of subsets of $n$-dimensional unit cube vertices
    
    Dokl. Akad. Nauk SSSR, 113:2 (1957),  264–267


42. To the 55th anniversary of Professor M. V. Shamolin
    
    Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 210 (2022),  3–5
43. Opening remarks by the Program Committee of the Conference “Intelligent Data Processing. Theory and Applications” (IDP-2020)
    
    Avtomat. i Telemekh., 2021, no. 10,  3–5
44. In memory of Konstantin Vladimirovich Rudakov (21.06.1954 – 10.07.2021)
    
    Computer Research and Modeling, 13:4 (2021),  675–676
45. In memory of Aleksandr Sergeevich Kholodov
    
    Matem. Mod., 30:1 (2018),  135–136
46. Anniversary of Professor M. V. Shamolin
    
    Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 134 (2017),  3–5
47. The XVII International Conference “Problems of Theoretical Cybernetics”
    
    Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 156:3 (2014),  5–6
48. The XV International Conference “Problems of Theoretical Cybernetics”
    
    Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 151:2 (2009),  5–6
49. Viktor Antonovich Sadovnichii (A tribute in honor of his sixty-fifth birthday)
    
    Differ. Uravn., 40:4 (2004),  435–442
50. Stanislav Vasil'evich Emel'yanov (on the occasion of his seventieth birthday)
    
    Differ. Uravn., 35:5 (1999),  579–589
51. Anatoliǐ Platonovich Prudnikov (on the occasion of his seventieth birthday)
    
    Differ. Uravn., 33:6 (1997),  730–736
52. Stanislav Vasil'evich Emel'yanov (on the occasion of his sixtieth birthday)
    
    Matem. Mod., 1:5 (1989),  154–156
53. Introduction to mathematical techniques in pattern recognition: H. C. Andrews. xiii + 242 p. Wiley-Intersciences, a div. of John Wiley and Sons, Inc. New York, London, Sydney, Toronto, 1972. Book review
    
    Zh. Vychisl. Mat. Mat. Fiz., 13:5 (1973),  1358–1360