Zuev Yurii Anatol'evich

Publications in Math-Net.Ru

1. A method for optimal value measurement of some parameters of fault attacks on cryptographic algorithms
   
   Diskretn. Anal. Issled. Oper., 31:2 (2024),  96–107
2. Maximal $k$-intersecting families of subsets and Boolean functions
   
   Diskretn. Anal. Issled. Oper., 25:4 (2018),  15–26
3. On extreme joint probabilities of $k$ events chosen from $n$ events
   
   Prikl. Diskr. Mat., 2018, no. 39,  5–12
4. A Graph Coloring Problem
   
   Mat. Zametki, 97:6 (2015),  942–944
5. Graph coloring games
   
   Tr. Inst. Mat., 23:2 (2015),  56–61
6. On the estimation of efficiency of voting procedures
   
   Teor. Veroyatnost. i Primenen., 42:1 (1997),  74–84
7. Statistical properties of weighted voting
   
   Dokl. Akad. Nauk, 342:5 (1995),  586–588
8. Weighted Voting in Multichannel Systems of Discrete Signal Transmission
   
   Probl. Peredachi Inf., 31:4 (1995),  22–36
9. Taught and self-taught weighted voting procedures
   
   Zh. Vychisl. Mat. Mat. Fiz., 35:1 (1995),  104–121
10. “Accelerated” perceptron and self-learning procedures in weighted voting
    
    Dokl. Akad. Nauk, 328:2 (1993),  160–163
11. Combinatorial-probability and geometric methods in threshold logic
    
    Diskr. Mat., 3:2 (1991),  47–57
12. Asymptotics of the logarithm of the number of Boolean threshold functions
    
    Dokl. Akad. Nauk SSSR, 306:3 (1989),  528–530
13. The worst case for decision-making by a majority vote
    
    Zh. Vychisl. Mat. Mat. Fiz., 29:8 (1989),  1256–1257
14. Statistical properties for decision making by majority vote in problems of classification
    
    Dokl. Akad. Nauk SSSR, 288:2 (1986),  320–322
15. Probabilistic model of a committee of classifiers
    
    Zh. Vychisl. Mat. Mat. Fiz., 26:2 (1986),  276–292
16. The relation of linear inequalities to monotone Boolean functions
    
    Zh. Vychisl. Mat. Mat. Fiz., 24:5 (1984),  780–781
17. 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
18. 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
19. A set-covering problem: the combinatorial-local approach and the branch and bound method
    
    Zh. Vychisl. Mat. Mat. Fiz., 19:6 (1979),  1566–1576
20. Approximation of a partial Boolean function by a monotone Boolean function
    
    Zh. Vychisl. Mat. Mat. Fiz., 18:6 (1978),  1571–1578