RUS  ENG
Full version
PEOPLE

Tsitsiashvili Gurami Shalvovich

Publications in Math-Net.Ru

  1. Zoning of districts of the region according to the proximity to the external border

    Mat. Teor. Igr Pril., 16:1 (2024),  78–91
  2. Optimal algorithm for converting an acyclic digraph to a cluster

    Prikl. Diskr. Mat., 2021, no. 54,  94–98
  3. The computational complexity of optimal blocking of vertices in the digraph

    Dal'nevost. Mat. Zh., 20:2 (2020),  267–270
  4. Ergodicity of statistical estimates of Poisson flow intensity

    Dal'nevost. Mat. Zh., 19:2 (2019),  256–260
  5. Logical-probabilistic modeling on the modular principle

    Dal'nevost. Mat. Zh., 19:1 (2019),  114–118
  6. An algorithm for predicting the critical events in the generalized indicator

    Dal'nevost. Mat. Zh., 19:1 (2019),  20–23
  7. Invariant properties of queuing systems with multiple flows

    Dal'nevost. Mat. Zh., 18:2 (2018),  267–270
  8. Protection of the network structure by autonomous vehicles

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

    Dal'nevost. Mat. Zh., 18:1 (2018),  123–126
  10. Solution of balance equations and investigation of Poisson flows in Jackson networks

    Dal'nevost. Mat. Zh., 18:1 (2018),  117–122
  11. 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
  12. Stationary flows in acyclic queuing networks

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

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

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

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

    Prikl. Diskr. Mat. Suppl., 2013, no. 6,  90–92
  17. Properties of connectivity components in parallel-sequantial connections

    Dal'nevost. Mat. Zh., 12:1 (2012),  12–19
  18. Connectivity of the planar graph with highly reliable edges

    Prikl. Diskr. Mat., 2012, no. 3(17),  103–107
  19. A zero-or-one law in aggregated closed queueing networks

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

    Avtomat. i Telemekh., 2010, no. 9,  185–189
  21. Calculating reliability of the recursively definable networks

    Avtomat. i Telemekh., 2010, no. 7,  136–142
  22. Comparison analysis of reliability of networks with identical edges

    Dal'nevost. Mat. Zh., 10:2 (2010),  192–198
  23. Continuity theorems and algorithmical problems in classical risk model

    Dal'nevost. Mat. Zh., 10:2 (2010),  153–161
  24. Asymptotic formulas for a calculation of a lattice reliability

    Dal'nevost. Mat. Zh., 10:1 (2010),  86–90
  25. Continuity of reaching moment distribution for autoregressive random sequence

    Dal'nevost. Mat. Zh., 10:1 (2010),  80–85
  26. Cooperative effects in closed queueing networks

    Dal'nevost. Mat. Zh., 10:1 (2010),  66–69
  27. Calculation of cohesiveness probability for recursively defined random networks

    Dal'nevost. Mat. Zh., 10:1 (2010),  60–65
  28. Computing ruin probability in the classical risk model

    Avtomat. i Telemekh., 2009, no. 12,  187–194
  29. Probability and deterministic problems of minimal interval

    Dal'nevost. Mat. Zh., 9:1-2 (2009),  190–193
  30. Accuracy solution of A.A. Novikov problem for reaching moments of autoregressive sequence

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

    Probl. Peredachi Inf., 45:4 (2009),  115–120
  32. Application of the Floyd algorithm to the asymptotic analysis of networks with unreliable ribs

    Avtomat. i Telemekh., 2008, no. 7,  181–184
  33. Asymptotic formulas of network operation time distribution

    Avtomat. i Telemekh., 2008, no. 1,  180–182
  34. Variations estimates

    Dal'nevost. Mat. Zh., 8:2 (2008),  229–234
  35. Analysis of ports reliabilities

    Dal'nevost. Mat. Zh., 8:2 (2008),  223–228
  36. Limiting Distributions in Queueing Networks with Unreliable Elements

    Probl. Peredachi Inf., 44:4 (2008),  109–119
  37. Parametric and structural optimization of the queuing network throughput

    Avtomat. i Telemekh., 2007, no. 7,  64–73
  38. Queueing models with different schemes of customers transformation

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

    Probl. Peredachi Inf., 42:2 (2006),  101–108
  40. Optimization of ability to handle customers of opened queueing network

    Dal'nevost. Mat. Zh., 6:1-2 (2005),  88–93
  41. Two sided bounds of rate convergence in limit theorem for minimum of random vectors

    Dal'nevost. Mat. Zh., 6:1-2 (2005),  82–87
  42. New Multiplicative Theorems for Queueing Networks

    Probl. Peredachi Inf., 41:2 (2005),  111–122
  43. Multi-server queueing system with competition between servers

    Dal'nevost. Mat. Zh., 5:2 (2004),  218–225
  44. Construction of queueing networks with stationary product distributions

    Dal'nevost. Mat. Zh., 5:1 (2004),  82–88
  45. Anomalous diffusion on interval with reflecting edges

    Dal'nevost. Mat. Zh., 4:2 (2003),  231–241
  46. Asymptotic characteristics of output flows in queueing networks

    Dal'nevost. Mat. Zh., 4:1 (2003),  36–43
  47. Investigation of applied stochastic models by means of random variables indeces

    Dal'nevost. Mat. Zh., 4:1 (2003),  27–35
  48. Application of data base for construction of dusty gas combustion models

    Dal'nevost. Mat. Zh., 3:2 (2002),  302–310
  49. Connection between stochastic control of Markov process parameter and transportation problem

    Dal'nevost. Mat. Zh., 3:2 (2002),  216–226
  50. Stochastic control of discrete Markov process parameter

    Dal'nevost. Mat. Zh., 3:1 (2002),  58–60
  51. Asymptotic invariants in one channel queueing system $G|G|1|\infty$

    Dal'nevost. Mat. Zh., 3:1 (2002),  52–57
  52. Transition phenomena in unity of renewal systems with total reserve

    Dal'nevost. Mat. Zh., 2:2 (2001),  106–114
  53. Calculation of stationary distributions in adoptive queueing networks

    Dal'nevost. Mat. Zh., 2:2 (2001),  99–105
  54. Numerical modelling of dust gas mixture burning

    Dal'nevost. Mat. Zh., 2:1 (2001),  90–97
  55. Supertails in risk theory

    Dal'nevost. Mat. Zh., 2:1 (2001),  68–76
  56. Transition phenomena in mathematical theory of epidemic

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

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

    Dal'nevost. Mat. Zh., 1:1 (2000),  51–57
  59. Two-Sided Bounds of Random Sums with Subexponential Summands

    Probl. Peredachi Inf., 35:3 (1999),  67–79
  60. Reduction of the problem of the mutual discharge of debts to the transportation problem

    Dokl. Akad. Nauk, 352:6 (1997),  730
  61. Some methods of investigating regeneration times in queueing networks

    Teor. Veroyatnost. i Primenen., 35:2 (1990),  376–379
  62. Stability analysis of queueing systems

    Zap. Nauchn. Sem. LOMI, 87 (1979),  41–61
  63. Piecewise linear Markov chains and analysis of their stability

    Teor. Veroyatnost. i Primenen., 20:2 (1975),  345–357

  64. Итоги научной деятельности лаборатории вероятностных методов и системного анализа ИПМ ДВО РАН за 1988–2008 гг.

    Dal'nevost. Mat. Zh., 8:1 (2008),  111–120

© Steklov Math. Inst. of RAS, 2025