|
|
Publications in Math-Net.Ru |
Citations |
|
2020 |
1. |
A. A. Korotin, V. V. V'yugin, E. V. Burnaev, “Online algorithm for aggregating experts' predictions with unbounded quadratic loss”, Uspekhi Mat. Nauk, 75:5(455) (2020), 197–198 ; Russian Math. Surveys, 75:5 (2020), 974–977 |
1
|
|
2016 |
2. |
V. V. V'yugin, V. G. Trunov, “Applications of combined financial strategies based on universal adaptive forecasting”, Avtomat. i Telemekh., 2016, no. 8, 136–158 ; Autom. Remote Control, 77:8 (2016), 1428–1446 |
2
|
|
2011 |
3. |
V. V. V'yugin, “On universal algorithms for adaptive forecasting”, Probl. Peredachi Inf., 47:2 (2011), 90–116 ; Problems Inform. Transmission, 47:2 (2011), 166–189 |
1
|
|
2006 |
4. |
V. V. V'yugin, V. P. Maslov, “Distribution of Investments in the Stock Market, Information
Types, and Algorithmic Complexity”, Probl. Peredachi Inf., 42:3 (2006), 97–108 ; Problems Inform. Transmission, 42:3 (2006), 251–261 |
|
2005 |
5. |
V. V. V'yugin, V. P. Maslov, “Theorems on Concentration for the Entropy of Free Energy”, Probl. Peredachi Inf., 41:2 (2005), 72–88 ; Problems Inform. Transmission, 41:2 (2005), 134–149 |
9
|
|
2003 |
6. |
V. V. V'yugin, V. P. Maslov, “On Extremal Relations between Additive Loss Functions and the Kolmogorov Complexity”, Probl. Peredachi Inf., 39:4 (2003), 71–87 ; Problems Inform. Transmission, 39:4 (2003), 380–394 |
6
|
7. |
V. V. V'yugin, “Problems of Robustness for Universal Coding Schemes”, Probl. Peredachi Inf., 39:1 (2003), 36–52 ; Problems Inform. Transmission, 39:1 (2003), 32–46 |
3
|
|
2001 |
8. |
V. V. V'yugin, “Nonrobustness Property of the Individual Ergodic Theorem”, Probl. Peredachi Inf., 37:2 (2001), 27–39 ; Problems Inform. Transmission, 37:2 (2001), 108–119 |
2
|
|
1997 |
9. |
V. V. V'yugin, “On the longest head-run in an individual random sequence”, Teor. Veroyatnost. i Primenen., 42:3 (1997), 608–615 ; Theory Probab. Appl., 42:3 (1998), 541–546 |
4
|
10. |
V. V. V'yugin, “Effective convergence in probability and an ergodic theorem for individual random sequences”, Teor. Veroyatnost. i Primenen., 42:1 (1997), 35–50 ; Theory Probab. Appl., 42:1 (1998), 39–50 |
33
|
|
1996 |
11. |
V. V. V'yugin, “An ergodic theorem for an individual random sequence”, Uspekhi Mat. Nauk, 51:6(312) (1996), 191–192 ; Russian Math. Surveys, 51:6 (1996), 1231–1232 |
1
|
|
1987 |
12. |
V. V. Vjugin, “On Randomness Defect of a Finite Object Relative to Measures with Given Complexity Bounds”, Teor. Veroyatnost. i Primenen., 32:3 (1987), 558–563 ; Theory Probab. Appl., 32:3 (1987), 508–512 |
20
|
|
1985 |
13. |
V. V. V'yugin, “On Nonstochastic Objects”, Probl. Peredachi Inf., 21:2 (1985), 3–9 ; Problems Inform. Transmission, 21:2 (1985), 77–83 |
4
|
|
1984 |
14. |
A. G. Artem'ev, V. V. V'yugin, B. R. Loginov, “Methods for determining the parameters for mathematical modeling of health service personnel”, Avtomat. i Telemekh., 1984, no. 4, 104–110 ; Autom. Remote Control, 45:4 (1984), 499–504 |
|
1983 |
15. |
V. V. V'yugin, “On Computability of the Parameter in a Bernoulli Scheme”, Probl. Peredachi Inf., 19:1 (1983), 100–105 |
|
1982 |
16. |
V. V. V'yugin, “Algebra of Invariant Properties of Binary Sequences”, Probl. Peredachi Inf., 18:2 (1982), 83–100 ; Problems Inform. Transmission, 18:2 (1982), 147–161 |
1
|
|
1976 |
17. |
V. V. V'yugin, “On Turing invariant sets”, Dokl. Akad. Nauk SSSR, 229:4 (1976), 790–793 |
|
1974 |
18. |
V. V. V'yugin, “Segments of recursively enumerable $m$-degrees”, Algebra Logika, 13:6 (1974), 635–654 |
1
|
19. |
V. V. V'yugin, “On upper semilattices of numerations”, Dokl. Akad. Nauk SSSR, 217:4 (1974), 749–751 |
|
1973 |
20. |
V. V. V'yugin, “Certain examples of upper semilattices of computable numerations”, Algebra Logika, 12:5 (1973), 512–529 |
7
|
21. |
V. V. V'yugin, “On minimal enumerations of computable classes of recursively enumerable sets”, Dokl. Akad. Nauk SSSR, 212:2 (1973), 273–275 |
1
|
|
1972 |
22. |
V. V. V'yugin, “Discrete classes of recursively enumerable sets”, Algebra Logika, 11:3 (1972), 243–256 |
2
|
|
Presentations in Math-Net.Ru |
|
|
Organisations |
|
|
|
|