|
|
|
Publications in Math-Net.Ru |
Citations |
|
2007 |
| 1. |
A. A. Chernyak, S. V. Suzdal', “Комбинаторная надежность сетевых гиперграфов”, Diskretn. Anal. Issled. Oper., Ser. 1, 14:2 (2007), 68–94    |
|
2000 |
| 2. |
A. A. Chernyak, “Domination of cyclic monotone $(s,t)$-graphs”, Mat. Zametki, 67:2 (2000), 288–294 ; Math. Notes, 67:2 (2000), 233–238  |
|
1999 |
| 3. |
A. A. Chernyak, “Residual reliability of $P$-threshold graphs”, Diskretn. Anal. Issled. Oper., Ser. 1, 6:3 (1999), 71–86 |
| 4. |
A. A. Chernyak, “Structure-complex systems with threshold survival”, Diskr. Mat., 11:4 (1999), 65–78 ; Discrete Math. Appl., 9:5 (1999), 481–495 |
| 5. |
A. A. Chernyak, Zh. A. Chernyak, “Reliability of binary systems”, Diskr. Mat., 11:1 (1999), 129–139 ; Discrete Math. Appl., 9:1 (1999), 101–112 |
2
|
| 6. |
A. A. Chernyak, “Universal Graph Model of Cyclic Networks and Their Reliability”, Probl. Peredachi Inf., 35:2 (1999), 90–99 ; Problems Inform. Transmission, 35:2 (1999), 172–179 |
|
1998 |
| 7. |
A. A. Chernyak, Zh. A. Chernyak, “A logical-probabilistic method for the analysis of the reliability of large-scale multivalued systems”, Avtomat. i Telemekh., 1998, no. 1, 171–180 ; Autom. Remote Control, 59:1 (1998), 141–148 |
1
|
| 8. |
A. A. Chernyak, “On the algorithmic complexity of the classical reliability problem”, Diskretn. Anal. Issled. Oper., Ser. 1, 5:4 (1998), 71–80 |
|
1991 |
| 9. |
A. A. Chernyak, “Combinatorial-graph method for analyzing the reliability of complex systems with monotone Boolean functions”, Avtomat. i Telemekh., 1991, no. 4, 165–174 ; Autom. Remote Control, 52:4 (1991), 572–579 |
4
|
|
1990 |
| 10. |
R. I. Tyshkevich, A. A. Chernyak, “Yet another method of enumerating unmarked combinatorial objects”, Mat. Zametki, 48:6 (1990), 98–105 ; Math. Notes, 48:6 (1990), 1239–1245 |
2
|
| 11. |
A. A. Chernyak, “Minimal Hamiltonian graphs with prescribed degree sets”, Mat. Zametki, 47:4 (1990), 115–127 ; Math. Notes, 47:4 (1990), 391–400 |
|
| Organisations |
|
|
