|
|
|
Publications in Math-Net.Ru |
Citations |
|
2001 |
| 1. |
V. G. Krivulets, V. P. Polesskii, “On Bounds for the Monotone-Structure Reliability”, Probl. Peredachi Inf., 37:4 (2001), 112–129    ; Problems Inform. Transmission, 37:4 (2001), 380–396 |
2
|
| 2. |
V. P. Polesskii, “Untying of Clutter-Family Supports and Its Role in the Monotone-Structure Reliability Theory”, Probl. Peredachi Inf., 37:2 (2001), 62–76 ; Problems Inform. Transmission, 37:2 (2001), 140–154 |
1
|
|
2000 |
| 3. |
V. P. Polesskii, “Lower Bound on the Reliability of a Network with a 2-Connected Structure”, Probl. Peredachi Inf., 36:3 (2000), 55–64 ; Problems Inform. Transmission, 36:3 (2000), 246–255 |
1
|
|
1997 |
| 4. |
V. P. Polesskii, “Clutter Untyings, Correlation Inequalities, and Bounds for Combinatorial Reliability”, Probl. Peredachi Inf., 33:3 (1997), 50–70 ; Problems Inform. Transmission, 33:3 (1997), 233–250 |
6
|
|
1995 |
| 5. |
V. P. Polesskii, “The Best Possible Bounds for Full Rank Probability of a Random Submatroid”, Probl. Peredachi Inf., 31:4 (1995), 81–99 ; Problems Inform. Transmission, 31:4 (1995), 363–379 |
2
|
|
1993 |
| 6. |
V. P. Polesskii, “Lower Bounds on Full Rank Probability in Random Matroids”, Probl. Peredachi Inf., 29:4 (1993), 58–66 ; Problems Inform. Transmission, 29:4 (1993), 350–357 |
1
|
| 7. |
V. P. Polesskii, “Bounds of Two-Terminal Network Reliability and Base Spectrum of Network Graph”, Probl. Peredachi Inf., 29:3 (1993), 86–100 ; Problems Inform. Transmission, 29:3 (1993), 277–289 |
| 8. |
V. P. Polesskii, “Lower Bounds of Connectedness Probability for Some Classes of Random Graphs”, Probl. Peredachi Inf., 29:2 (1993), 85–95 ; Problems Inform. Transmission, 29:2 (1993), 176–185 |
3
|
|
1992 |
| 9. |
V. P. Polesskii, “Lower Bounds on the Probability of Connectedness in Classes of Random Graphs Generated by 2-Connected Graphs with a Given Base Spectrum”, Probl. Peredachi Inf., 28:2 (1992), 86–95 ; Problems Inform. Transmission, 28:2 (1992), 175–183 |
3
|
|
1990 |
| 10. |
V. P. Polesskii, “A Simple Stable RMA Algorithm for LAN”, Probl. Peredachi Inf., 26:2 (1990), 87–97 ; Problems Inform. Transmission, 26:2 (1990), 161–169 |
| 11. |
V. P. Polesskii, “Bounds on Probability of Connectedness of a Random Graph”, Probl. Peredachi Inf., 26:1 (1990), 90–98 ; Problems Inform. Transmission, 26:1 (1990), 75–82 |
3
|
|
1987 |
| 12. |
V. P. Polesskii, “Obstacles to Partitioning a Graph into Trees”, Probl. Peredachi Inf., 23:3 (1987), 79–93 ; Problems Inform. Transmission, 23:3 (1987), 236–249 |
|
1976 |
| 13. |
V. P. Polesskii, “Isthmus Structure in a Summary Matroid”, Probl. Peredachi Inf., 12:4 (1976), 95–104 ; Problems Inform. Transmission, 12:4 (1976), 315–322 |
| 14. |
A. K. Kel'mans, M. V. Lomonosov, V. P. Polesskii, “On Minimal Matroid Coverings”, Probl. Peredachi Inf., 12:3 (1976), 94–107 ; Problems Inform. Transmission, 12:3 (1976), 231–241 |
1
|
| 15. |
V. P. Polesskii, “Covering a Finite Graph by a Minimum Number of of Forests”, Probl. Peredachi Inf., 12:2 (1976), 76–82 ; Problems Inform. Transmission, 12:4 (1976), 141–146 |
|
1972 |
| 16. |
M. V. Lomonosov, V. P. Polesskii, “Maximum of the Connectivity Probability”, Probl. Peredachi Inf., 8:4 (1972), 68–73 ; Problems Inform. Transmission, 8:4 (1972), 324–328 |
| 17. |
M. V. Lomonosov, V. P. Polesskii, “Lower Bound of Network Reliability”, Probl. Peredachi Inf., 8:2 (1972), 47–53 ; Problems Inform. Transmission, 8:2 (1972), 118–123 |
2
|
|
1971 |
| 18. |
M. V. Lomonosov, V. P. Polesskii, “An Upper Bound for the Reliability of Information Networks”, Probl. Peredachi Inf., 7:4 (1971), 78–81 ; Problems Inform. Transmission, 7:4 (1971), 337–339 |
1
|
| 19. |
V. P. Polesskii, “A Lower Boundary for the Reliability of Information Networks”, Probl. Peredachi Inf., 7:2 (1971), 88–96 ; Problems Inform. Transmission, 7:2 (1971), 165–171 |
1
|
| 20. |
V. P. Polesskii, “Relationship between Chromatic Number and Branch Connectivity in a Finite Graph”, Probl. Peredachi Inf., 7:1 (1971), 105–107 ; Problems Inform. Transmission, 7:1 (1971), 85–87 |
| |
|
|
Contact us: