|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
1. |
Yu. A. Zuev, P. G. Klyucharev, “A method for optimal value measurement of some parameters of fault attacks on cryptographic algorithms”, Diskretn. Anal. Issled. Oper., 31:2 (2024), 96–107 ; J. Appl. Industr. Math., 18:2 (2024), 371–377 |
|
2018 |
2. |
Yu. A. Zuev, “Maximal $k$-intersecting families of subsets and Boolean functions”, Diskretn. Anal. Issled. Oper., 25:4 (2018), 15–26 ; J. Appl. Industr. Math., 12:4 (2018), 797–802 |
3. |
Yu. A. Zuev, “On extreme joint probabilities of $k$ events chosen from $n$ events”, Prikl. Diskr. Mat., 2018, no. 39, 5–12 |
4
|
|
2015 |
4. |
Yu. A. Zuev, “A Graph Coloring Problem”, Mat. Zametki, 97:6 (2015), 942–944 ; Math. Notes, 97:6 (2015), 965–967 |
2
|
5. |
Y. A. Zuev, “Graph coloring games”, Tr. Inst. Mat., 23:2 (2015), 56–61 |
|
1997 |
6. |
Yu. A. Zuev, “On the estimation of efficiency of voting procedures”, Teor. Veroyatnost. i Primenen., 42:1 (1997), 74–84 ; Theory Probab. Appl., 42:1 (1998), 73–81 |
19
|
|
1995 |
7. |
Yu. A. Zuev, S. K. Ivanov, “Statistical properties of weighted voting”, Dokl. Akad. Nauk, 342:5 (1995), 586–588 |
8. |
Yu. A. Zuev, S. K. Ivanov, “Weighted Voting in Multichannel Systems of Discrete Signal Transmission”, Probl. Peredachi Inf., 31:4 (1995), 22–36 ; Problems Inform. Transmission, 31:4 (1995), 312–324 |
9. |
Yu. A. Zuev, S. K. Ivanov, “Taught and self-taught weighted voting procedures”, Zh. Vychisl. Mat. Mat. Fiz., 35:1 (1995), 104–121 ; Comput. Math. Math. Phys., 35:1 (1995), 81–94 |
|
1993 |
10. |
Yu. A. Zuev, S. K. Ivanov, ““Accelerated” perceptron and self-learning procedures in
weighted voting”, Dokl. Akad. Nauk, 328:2 (1993), 160–163 |
1
|
|
1991 |
11. |
Yu. A. Zuev, “Combinatorial-probability and geometric methods in threshold logic”, Diskr. Mat., 3:2 (1991), 47–57 ; Discrete Math. Appl., 2:4 (1992), 427–438 |
7
|
|
1989 |
12. |
Yu. A. Zuev, “Asymptotics of the logarithm of the number of Boolean threshold
functions”, Dokl. Akad. Nauk SSSR, 306:3 (1989), 528–530 ; Dokl. Math., 39:3 (1989), 512–513 |
4
|
13. |
Yu. A. Zuev, “The worst case for decision-making by a majority vote”, Zh. Vychisl. Mat. Mat. Fiz., 29:8 (1989), 1256–1257 ; U.S.S.R. Comput. Math. Math. Phys., 29:4 (1989), 204–205 |
1
|
|
1986 |
14. |
Yu. A. Zuev, “Statistical properties for decision making by majority vote in
problems of classification”, Dokl. Akad. Nauk SSSR, 288:2 (1986), 320–322 |
1
|
15. |
Yu. A. Zuev, “Probabilistic model of a committee of classifiers”, Zh. Vychisl. Mat. Mat. Fiz., 26:2 (1986), 276–292 ; U.S.S.R. Comput. Math. Math. Phys., 26:1 (1986), 170–179 |
3
|
|
1984 |
16. |
Yu. A. Zuev, V. N. Trishin, “The relation of linear inequalities to monotone Boolean functions”, Zh. Vychisl. Mat. Mat. Fiz., 24:5 (1984), 780–781 ; U.S.S.R. Comput. Math. Math. Phys., 24:3 (1984), 101–102 |
1
|
|
1983 |
17. |
Yu. A. Zuev, V. N. Trishin, “Lower bound for the number of inequalities representing a monotone Boolean function of $n$ variables”, Zh. Vychisl. Mat. Mat. Fiz., 23:3 (1983), 754–756 ; U.S.S.R. Comput. Math. Math. Phys., 23:3 (1983), 155–156 |
1
|
|
1981 |
18. |
Yu. A. Zuev, “A method for raising the reliability of classification in the presence of several classifiers, based on the principle of monotonicity”, Zh. Vychisl. Mat. Mat. Fiz., 21:1 (1981), 157–167 ; U.S.S.R. Comput. Math. Math. Phys., 21:1 (1981), 156–166 |
5
|
|
1979 |
19. |
Yu. A. Zuev, “A set-covering problem: the combinatorial-local approach and the branch and bound method”, Zh. Vychisl. Mat. Mat. Fiz., 19:6 (1979), 1566–1576 ; U.S.S.R. Comput. Math. Math. Phys., 19:6 (1979), 217–226 |
5
|
|
1978 |
20. |
Yu. A. Zuev, “Approximation of a partial Boolean function by a monotone Boolean function”, Zh. Vychisl. Mat. Mat. Fiz., 18:6 (1978), 1571–1578 ; U.S.S.R. Comput. Math. Math. Phys., 18:6 (1978), 212–218 |
2
|
|
Presentations in Math-Net.Ru |
|
|
Organisations |
|
|
|
|