RUS  ENG
Full version
PEOPLE

Rybko Aleksandr Nikolaevich

Publications in Math-Net.Ru

  1. Propagation of chaos and Poisson hypothesis

    Probl. Peredachi Inf., 54:3 (2018),  102–111
  2. Poisson hypothesis for open networks at low load

    Mosc. Math. J., 17:1 (2017),  145–160
  3. Queueing networks with mobile servers: the mean-field approach

    Probl. Peredachi Inf., 52:2 (2016),  86–110
  4. On products of skew rotations

    Mosc. Math. J., 12:4 (2012),  705–717
  5. Phase transitions in the queuing networks and the violation of the Poisson hypothesis

    Mosc. Math. J., 8:1 (2008),  159–180
  6. Self-averaging Property of Queueing Systems

    Probl. Peredachi Inf., 42:4 (2006),  91–103
  7. Poisson hypothesis for information networks. II

    Mosc. Math. J., 5:4 (2005),  927–959
  8. Poisson hypothesis for information networks. I

    Mosc. Math. J., 5:3 (2005),  679–704
  9. Poisson Hypothesis: Combinatorial Aspect

    Probl. Peredachi Inf., 41:3 (2005),  51–57
  10. Random walks and chemical networks

    Mosc. Math. J., 4:2 (2004),  441–453
  11. Steady solutions for FIFO networks

    Mosc. Math. J., 1:3 (2001),  407–419
  12. Asymptotic Behavior of the Thermodynamical Limit for Symmetric Closed Queueing Networks

    Probl. Peredachi Inf., 36:2 (2000),  69–95
  13. Nonergodicity of a Queueing Network under Nonstability of Its Fluid Model

    Probl. Peredachi Inf., 36:1 (2000),  26–47
  14. On a model of plane switching circuits

    Diskr. Mat., 7:4 (1995),  40–50
  15. Ergodicity of Stochastic Processes Describing the Operation of Open Queueing Networks

    Probl. Peredachi Inf., 28:3 (1992),  3–26
  16. On Jackson Circuits on Countable Graphs

    Teor. Veroyatnost. i Primenen., 33:2 (1988),  379–382
  17. Capacity Region for Circuit-Switched Networks

    Probl. Peredachi Inf., 22:1 (1986),  66–84
  18. Existence Conditions for a Steady-State Mode for Two Types of Communications Networks with Message Switching

    Probl. Peredachi Inf., 18:1 (1982),  94–103
  19. Stationary Distributions of Time-Homogeneous Markov Processes Modeling Message-Switching Communication Networks

    Probl. Peredachi Inf., 17:1 (1981),  71–89

  20. Fridrikh Izrailevich Karpelevich. In Memoriam

    Probl. Peredachi Inf., 37:2 (2001),  110–111
  21. Robert Adol'fovich Minlos (on his 70th birthday)

    Uspekhi Mat. Nauk, 56:4(340) (2001),  173–176
  22. Fridrikh Israilevich Karpelevich (obituary)

    Uspekhi Mat. Nauk, 56:1(337) (2001),  147–152
  23. Letter to the Editor

    Probl. Peredachi Inf., 36:3 (2000),  95
  24. In Memory of Roland L'vovich Dobrushin

    Probl. Peredachi Inf., 32:3 (1996),  3–24


© Steklov Math. Inst. of RAS, 2025