Polesskii V P

Publications in Math-Net.Ru

1. On Bounds for the Monotone-Structure Reliability
   
   Probl. Peredachi Inf., 37:4 (2001),  112–129
2. Untying of Clutter-Family Supports and Its Role in the Monotone-Structure Reliability Theory
   
   Probl. Peredachi Inf., 37:2 (2001),  62–76
3. Lower Bound on the Reliability of a Network with a 2-Connected Structure
   
   Probl. Peredachi Inf., 36:3 (2000),  55–64
4. Clutter Untyings, Correlation Inequalities, and Bounds for Combinatorial Reliability
   
   Probl. Peredachi Inf., 33:3 (1997),  50–70
5. The Best Possible Bounds for Full Rank Probability of a Random Submatroid
   
   Probl. Peredachi Inf., 31:4 (1995),  81–99
6. Lower Bounds on Full Rank Probability in Random Matroids
   
   Probl. Peredachi Inf., 29:4 (1993),  58–66
7. Bounds of Two-Terminal Network Reliability and Base Spectrum of Network Graph
   
   Probl. Peredachi Inf., 29:3 (1993),  86–100
8. Lower Bounds of Connectedness Probability for Some Classes of Random Graphs
   
   Probl. Peredachi Inf., 29:2 (1993),  85–95
9. 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
10. A Simple Stable RMA Algorithm for LAN
    
    Probl. Peredachi Inf., 26:2 (1990),  87–97
11. Bounds on Probability of Connectedness of a Random Graph
    
    Probl. Peredachi Inf., 26:1 (1990),  90–98
12. Obstacles to Partitioning a Graph into Trees
    
    Probl. Peredachi Inf., 23:3 (1987),  79–93
13. Isthmus Structure in a Summary Matroid
    
    Probl. Peredachi Inf., 12:4 (1976),  95–104
14. On Minimal Matroid Coverings
    
    Probl. Peredachi Inf., 12:3 (1976),  94–107
15. Covering a Finite Graph by a Minimum Number of of Forests
    
    Probl. Peredachi Inf., 12:2 (1976),  76–82
16. Maximum of the Connectivity Probability
    
    Probl. Peredachi Inf., 8:4 (1972),  68–73
17. Lower Bound of Network Reliability
    
    Probl. Peredachi Inf., 8:2 (1972),  47–53
18. An Upper Bound for the Reliability of Information Networks
    
    Probl. Peredachi Inf., 7:4 (1971),  78–81
19. A Lower Boundary for the Reliability of Information Networks
    
    Probl. Peredachi Inf., 7:2 (1971),  88–96
20. Relationship between Chromatic Number and Branch Connectivity in a Finite Graph
    
    Probl. Peredachi Inf., 7:1 (1971),  105–107