Chernyak Arkadii Alexandrovich

Publications in Math-Net.Ru

1. Комбинаторная надежность сетевых гиперграфов
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 14:2 (2007),  68–94
2. Domination of cyclic monotone $(s,t)$-graphs
   
   Mat. Zametki, 67:2 (2000),  288–294
3. Residual reliability of $P$-threshold graphs
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 6:3 (1999),  71–86
4. Structure-complex systems with threshold survival
   
   Diskr. Mat., 11:4 (1999),  65–78
5. Reliability of binary systems
   
   Diskr. Mat., 11:1 (1999),  129–139
6. Universal Graph Model of Cyclic Networks and Their Reliability
   
   Probl. Peredachi Inf., 35:2 (1999),  90–99
7. A logical-probabilistic method for the analysis of the reliability of large-scale multivalued systems
   
   Avtomat. i Telemekh., 1998, no. 1,  171–180
8. On the algorithmic complexity of the classical reliability problem
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 5:4 (1998),  71–80
9. Combinatorial-graph method for analyzing the reliability of complex systems with monotone Boolean functions
   
   Avtomat. i Telemekh., 1991, no. 4,  165–174
10. Yet another method of enumerating unmarked combinatorial objects
    
    Mat. Zametki, 48:6 (1990),  98–105
11. Minimal Hamiltonian graphs with prescribed degree sets
    
    Mat. Zametki, 47:4 (1990),  115–127