V'yugin Vladimir Vyacheslavovich

Publications in Math-Net.Ru

1. Online algorithm for aggregating experts' predictions with unbounded quadratic loss
   
   Uspekhi Mat. Nauk, 75:5(455) (2020),  197–198
2. Applications of combined financial strategies based on universal adaptive forecasting
   
   Avtomat. i Telemekh., 2016, no. 8,  136–158
3. On universal algorithms for adaptive forecasting
   
   Probl. Peredachi Inf., 47:2 (2011),  90–116
4. Distribution of Investments in the Stock Market, Information Types, and Algorithmic Complexity
   
   Probl. Peredachi Inf., 42:3 (2006),  97–108
5. Theorems on Concentration for the Entropy of Free Energy
   
   Probl. Peredachi Inf., 41:2 (2005),  72–88
6. On Extremal Relations between Additive Loss Functions and the Kolmogorov Complexity
   
   Probl. Peredachi Inf., 39:4 (2003),  71–87
7. Problems of Robustness for Universal Coding Schemes
   
   Probl. Peredachi Inf., 39:1 (2003),  36–52
8. Nonrobustness Property of the Individual Ergodic Theorem
   
   Probl. Peredachi Inf., 37:2 (2001),  27–39
9. On the longest head-run in an individual random sequence
   
   Teor. Veroyatnost. i Primenen., 42:3 (1997),  608–615
10. Effective convergence in probability and an ergodic theorem for individual random sequences
    
    Teor. Veroyatnost. i Primenen., 42:1 (1997),  35–50
11. An ergodic theorem for an individual random sequence
    
    Uspekhi Mat. Nauk, 51:6(312) (1996),  191–192
12. On Randomness Defect of a Finite Object Relative to Measures with Given Complexity Bounds
    
    Teor. Veroyatnost. i Primenen., 32:3 (1987),  558–563
13. On Nonstochastic Objects
    
    Probl. Peredachi Inf., 21:2 (1985),  3–9
14. Methods for determining the parameters for mathematical modeling of health service personnel
    
    Avtomat. i Telemekh., 1984, no. 4,  104–110
15. On Computability of the Parameter in a Bernoulli Scheme
    
    Probl. Peredachi Inf., 19:1 (1983),  100–105
16. Algebra of Invariant Properties of Binary Sequences
    
    Probl. Peredachi Inf., 18:2 (1982),  83–100
17. On Turing invariant sets
    
    Dokl. Akad. Nauk SSSR, 229:4 (1976),  790–793
18. Segments of recursively enumerable $m$-degrees
    
    Algebra Logika, 13:6 (1974),  635–654
19. On upper semilattices of numerations
    
    Dokl. Akad. Nauk SSSR, 217:4 (1974),  749–751
20. Certain examples of upper semilattices of computable numerations
    
    Algebra Logika, 12:5 (1973),  512–529
21. On minimal enumerations of computable classes of recursively enumerable sets
    
    Dokl. Akad. Nauk SSSR, 212:2 (1973),  273–275
22. Discrete classes of recursively enumerable sets
    
    Algebra Logika, 11:3 (1972),  243–256