×

V’yugin, Vladimir V.

Compute Distance To:
Author ID: vyugin.vladimir-v Recent zbMATH articles by "V’yugin, Vladimir V."
Published as: V’yugin, V. V.; V’yugin, Vladimir V.; V’yugin, Vladimir
Documents Indexed: 57 Publications since 1973
Co-Authors: 12 Co-Authors with 19 Joint Publications
375 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

31 Publications have been cited 103 times in 74 Documents Cited by Year
Ergodic theorems for individual random sequences. Zbl 0915.68092
V’yugin, V. V.
19
1998
On the empirical validity of the Bayesian method. Zbl 0788.62006
Vovk, V. G.; V’yugin, V. V.
12
1993
Effective convergence in probability and an ergodic theorem for individual random sequences. Zbl 0917.60039
V’yugin, V. V.
10
1997
Algorithmic complexity and stochastic properties of finite binary sequences. Zbl 0937.68062
V’yugin, V. V.
7
1999
On some examples of upper semilattices of computable enumerations. Zbl 0305.02059
V’yugin, V. V.
5
1975
Invariant properties of informational bulks. Zbl 0409.94019
Levin, L. A.; V’yugin, V. V.
5
1977
Non-stochastic infinite and finite sequences. Zbl 0915.68079
V’yugin, V. V.
5
1998
Nonstochastic estimates. Zbl 0578.94009
V’yugin, V. V.
4
1985
On the defect of randomness of a finite object with respect to measures with given complexity bounds. Zbl 0643.68059
V’yugin, V. V.
4
1987
On calibration error of randomized forecasting algorithms. Zbl 1167.68027
V’yugin, Vladimir V.
3
2009
Does snooping help? Zbl 1002.68072
V’yugin, V. V.
3
2002
On sequences with non-learnable subsequences. Zbl 1142.68410
V’yugin, Vladimir V.
2
2008
Algorithmic entropy (complexity) of finite objects and its application to the definition of randomness and quantity of information. Zbl 0564.94006
V’yugin, V. V.
2
1981
Suboptimal measures of predictive complexity for absolute loss function. Zbl 1012.68089
V’yugin, V. V.
2
2002
On complexity of easy predictable sequences. Zbl 1012.68090
Vyugin, Michael V.; V’yugin, Vladimir V.
2
2002
Prequential level of impossibility with some applications. Zbl 0795.62001
Vovk, V. G.; V’yugin, V. V.
2
1994
Extremal relations between additive loss functions and the Kolmogorov complexity. Zbl 1091.94015
V’yugin, V. V.; Maslov, V. P.
2
2003
Bayesianism: An algorithmic analysis. Zbl 0855.68043
V’yugin, Vladimir V.
1
1996
On minimal enumerations of computable classes of recursively enumerable sets. Zbl 0298.02033
V’yugin, V. V.
1
1973
Non-linear inequalities between predictive and Kolmogorov complexities. Zbl 1050.68079
Vyugin, Michael V.; V’yugin, Vladimir V.
1
2001
Predictive complexity and information. Zbl 1050.68080
Vyugin, Michael V.; V’yugin, Vladimir V.
1
2002
Nonrobustness property of the individual ergodic theorem. Zbl 1012.37003
V’yugin, V. V.
1
2001
Most sequences are stochastic. Zbl 1007.68080
V’yugin, V. V.
1
2001
Algorithmic entropy (complexity) of finite objects and its application to defining randomness and amount of information. Zbl 0807.94005
V’yugin, V. V.
1
1981
On the longest head-run in an individual random sequence. Zbl 0908.60067
V’yugin, V. V.
1
1997
Transductive confidence machine is universal. Zbl 1263.68141
Nouretdinov, Ilia; V’yugin, Vladimir; Gammerman, Alex
1
2003
Predictive complexity and information. Zbl 1101.68617
Vyugin, Michael V.; V’yugin, Vladimir V.
1
2005
Problems of robustness for universal coding schemes. Zbl 1077.94010
V’yugin, V. V.
1
2003
Concentration theorems for entropy and free energy. Zbl 1090.94011
V’yugin, V. V.; Maslov, V. P.
1
2005
On randomness defect of a finite object relative to measures with given complexity bounds. Zbl 0638.68029
V’yugin, V. V.
1
1987
Algebra of invariant properties of binary sequences. Zbl 0525.03035
V’yugin, V. V.
1
1982
On calibration error of randomized forecasting algorithms. Zbl 1167.68027
V’yugin, Vladimir V.
3
2009
On sequences with non-learnable subsequences. Zbl 1142.68410
V’yugin, Vladimir V.
2
2008
Predictive complexity and information. Zbl 1101.68617
Vyugin, Michael V.; V’yugin, Vladimir V.
1
2005
Concentration theorems for entropy and free energy. Zbl 1090.94011
V’yugin, V. V.; Maslov, V. P.
1
2005
Extremal relations between additive loss functions and the Kolmogorov complexity. Zbl 1091.94015
V’yugin, V. V.; Maslov, V. P.
2
2003
Transductive confidence machine is universal. Zbl 1263.68141
Nouretdinov, Ilia; V’yugin, Vladimir; Gammerman, Alex
1
2003
Problems of robustness for universal coding schemes. Zbl 1077.94010
V’yugin, V. V.
1
2003
Does snooping help? Zbl 1002.68072
V’yugin, V. V.
3
2002
Suboptimal measures of predictive complexity for absolute loss function. Zbl 1012.68089
V’yugin, V. V.
2
2002
On complexity of easy predictable sequences. Zbl 1012.68090
Vyugin, Michael V.; V’yugin, Vladimir V.
2
2002
Predictive complexity and information. Zbl 1050.68080
Vyugin, Michael V.; V’yugin, Vladimir V.
1
2002
Non-linear inequalities between predictive and Kolmogorov complexities. Zbl 1050.68079
Vyugin, Michael V.; V’yugin, Vladimir V.
1
2001
Nonrobustness property of the individual ergodic theorem. Zbl 1012.37003
V’yugin, V. V.
1
2001
Most sequences are stochastic. Zbl 1007.68080
V’yugin, V. V.
1
2001
Algorithmic complexity and stochastic properties of finite binary sequences. Zbl 0937.68062
V’yugin, V. V.
7
1999
Ergodic theorems for individual random sequences. Zbl 0915.68092
V’yugin, V. V.
19
1998
Non-stochastic infinite and finite sequences. Zbl 0915.68079
V’yugin, V. V.
5
1998
Effective convergence in probability and an ergodic theorem for individual random sequences. Zbl 0917.60039
V’yugin, V. V.
10
1997
On the longest head-run in an individual random sequence. Zbl 0908.60067
V’yugin, V. V.
1
1997
Bayesianism: An algorithmic analysis. Zbl 0855.68043
V’yugin, Vladimir V.
1
1996
Prequential level of impossibility with some applications. Zbl 0795.62001
Vovk, V. G.; V’yugin, V. V.
2
1994
On the empirical validity of the Bayesian method. Zbl 0788.62006
Vovk, V. G.; V’yugin, V. V.
12
1993
On the defect of randomness of a finite object with respect to measures with given complexity bounds. Zbl 0643.68059
V’yugin, V. V.
4
1987
On randomness defect of a finite object relative to measures with given complexity bounds. Zbl 0638.68029
V’yugin, V. V.
1
1987
Nonstochastic estimates. Zbl 0578.94009
V’yugin, V. V.
4
1985
Algebra of invariant properties of binary sequences. Zbl 0525.03035
V’yugin, V. V.
1
1982
Algorithmic entropy (complexity) of finite objects and its application to the definition of randomness and quantity of information. Zbl 0564.94006
V’yugin, V. V.
2
1981
Algorithmic entropy (complexity) of finite objects and its application to defining randomness and amount of information. Zbl 0807.94005
V’yugin, V. V.
1
1981
Invariant properties of informational bulks. Zbl 0409.94019
Levin, L. A.; V’yugin, V. V.
5
1977
On some examples of upper semilattices of computable enumerations. Zbl 0305.02059
V’yugin, V. V.
5
1975
On minimal enumerations of computable classes of recursively enumerable sets. Zbl 0298.02033
V’yugin, V. V.
1
1973

Citations by Year