Falin Gennadi Ivanovitch

Publications in Math-Net.Ru

1. Diffusion approximation for queueing systems with repeated calls
   
   Teor. Veroyatnost. i Primenen., 36:1 (1991),  183–186
2. Some exact formulas for two-dimensional random walks with applications to interacting queues
   
   Avtomat. i Telemekh., 1990, no. 3,  182–185
3. Instability of Slotted ALOHA
   
   Probl. Peredachi Inf., 26:1 (1990),  76–82
4. Approximation of synchronous data transmission systems with a small time cycle
   
   Avtomat. i Telemekh., 1989, no. 4,  116–123
5. Monotonicity Properties of Structurally Complex Switching Systems with Losses
   
   Probl. Peredachi Inf., 25:4 (1989),  69–79
6. Ergodicity of Random walks in the half-strip
   
   Mat. Zametki, 44:2 (1988),  225–230
7. Analysis of a Buffered Floating-Threshold Hybrid Switching System
   
   Probl. Peredachi Inf., 24:4 (1988),  77–83
8. Ergodicity, Stability, and Insensitivity for One Class of Circuit Switching Networks
   
   Probl. Peredachi Inf., 24:1 (1988),  74–88
9. Monotonicity of random walks in partially ordered sets
   
   Uspekhi Mat. Nauk, 43:2(260) (1988),  155–156
10. Ergodicity of some communications systems
    
    Sibirsk. Mat. Zh., 29:2 (1988),  210–211
11. Comparability of Migration Processes
    
    Teor. Veroyatnost. i Primenen., 33:2 (1988),  392–396
12. Virtual waiting time in systems with repeated calls
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1988, no. 6,  7–10
13. Singularly perturbed equations and an asymptotic study of the stationary characteristics of systems with repeated calls
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1988, no. 5,  7–10
14. On the Convergence of Queueing Processes in Composite Systems to Stationary Ones
    
    Teor. Veroyatnost. i Primenen., 32:3 (1987),  577–580
15. Error estimates in the approximation of countable Markov chains, connected with models of repeated calls
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1987, no. 2,  12–15
16. Asymptotic investigation of completely accessible switching systems with a high rate of repetition of blocked calls
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1984, no. 6,  49–53
17. Completely accessible group of channels with controllable access
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1984, no. 5,  26–28
18. Performance Evaluation for a Class of Algorithms of Random Multiple Access to a Radio-Communication Channel
    
    Probl. Peredachi Inf., 18:3 (1982),  85–90
19. Asymptotic Invariance of Probabilistic Characteristics of Structurally Complex Switching Systems with Losses
    
    Probl. Peredachi Inf., 17:2 (1981),  79–85
20. Asymptotic Analysis of a Class of Channel-Switching Networks
    
    Probl. Peredachi Inf., 17:1 (1981),  96–101
21. Switching Systems with Allowance for Repeated Calls
    
    Probl. Peredachi Inf., 16:2 (1980),  83–91


22. Инвариантность и задачи с параметрами
    
    Kvant, 2007, no. 5,  45–47
23. Функциональные уравнения и неравенства (окончание)
    
    Kvant, 2006, no. 6,  34–38
24. Функциональные уравнения и неравенства
    
    Kvant, 2006, no. 5,  39–45
25. Information on the meetings of the general seminar of the Department of Probability, Faculty of Mathematics and Mechanics, Moscow State University
    
    Teor. Veroyatnost. i Primenen., 45:3 (2000),  622