RUS  ENG
Full version
PEOPLE

Osipova Marina Anatol'evna

Publications in Math-Net.Ru

  1. Optimal algorithm for converting an acyclic digraph to a cluster

    Prikl. Diskr. Mat., 2021, no. 54,  94–98
  2. Protection of the network structure by autonomous vehicles

    Dal'nevost. Mat. Zh., 18:2 (2018),  177–182
  3. Application of multi-server queuing systems with failures to the construction of telecommunication networks

    Dal'nevost. Mat. Zh., 18:1 (2018),  123–126
  4. Probability of detecting an extraneous mobile object by Autonomous unmanned underwater vehicles is as a solution of Buffon problem

    Dal'nevost. Mat. Zh., 17:2 (2017),  191–200
  5. Stationary flows in acyclic queuing networks

    Dal'nevost. Mat. Zh., 16:2 (2016),  223–228
  6. Convergence to limit distributions in models of growing random networks

    Dal'nevost. Mat. Zh., 14:1 (2014),  100–108
  7. Proof of asymptotic constants in disconnection probability for weighted planar graph

    Prikl. Diskr. Mat., 2014, no. 2(24),  97–100
  8. Asymptotics for connectivity probability of graph with low reliable arcs

    Prikl. Diskr. Mat., 2013, no. 1(19),  93–98
  9. Asymptotics of connectivity probabilities for pairs of graph nodes

    Prikl. Diskr. Mat. Suppl., 2013, no. 6,  90–92
  10. A zero-or-one law in aggregated closed queueing networks

    Probl. Peredachi Inf., 47:1 (2011),  66–73
  11. Overload at the queuing network nodes

    Avtomat. i Telemekh., 2010, no. 9,  185–189
  12. Cooperative effects in closed queueing networks

    Dal'nevost. Mat. Zh., 10:1 (2010),  66–69
  13. Accuracy solution of A.A. Novikov problem for reaching moments of autoregressive sequence

    Dal'nevost. Mat. Zh., 9:1-2 (2009),  182–189
  14. Parameter estimation for product-form distributions of queueing networks

    Probl. Peredachi Inf., 45:4 (2009),  115–120
  15. Limiting Distributions in Queueing Networks with Unreliable Elements

    Probl. Peredachi Inf., 44:4 (2008),  109–119
  16. Queueing models with different schemes of customers transformation

    Dal'nevost. Mat. Zh., 7:1-2 (2007),  101–107
  17. Probability Distribution in Varying-Structure Queueing Networks

    Probl. Peredachi Inf., 42:2 (2006),  101–108
  18. New Multiplicative Theorems for Queueing Networks

    Probl. Peredachi Inf., 41:2 (2005),  111–122
  19. Construction of queueing networks with stationary product distributions

    Dal'nevost. Mat. Zh., 5:1 (2004),  82–88
  20. The product theorem for interacting queueing system

    Dal'nevost. Mat. Zh., 3:1 (2002),  61–63
  21. Stochastic control of discrete Markov process parameter

    Dal'nevost. Mat. Zh., 3:1 (2002),  58–60
  22. Calculation of stationary distributions in adoptive queueing networks

    Dal'nevost. Mat. Zh., 2:2 (2001),  99–105
  23. Transition phenomena in mathematical theory of epidemic

    Dal'nevost. Mat. Zh., 2:1 (2001),  58–67
  24. Investigation of stationary characteristics in some variable queueing systems

    Dal'nevost. Mat. Zh., 1:1 (2000),  58–62
  25. Collective insurance of weakly dependent risks

    Dal'nevost. Mat. Zh., 1:1 (2000),  51–57
  26. Programming on the basis of command layers and the structure of digital computers

    Zh. Vychisl. Mat. Mat. Fiz., 4:3 (1964),  525–535


© Steklov Math. Inst. of RAS, 2024