Michael V. Vyugin

Publication Activity (10 Years)

Years Active: 2000-2014
Publications (10 Years): 0

Top Topics

Laplace Transform

Multilingual Information Retrieval

Expected Values

Top Venues

Publications

Yuri Kalnishkan, Michael V. Vyugin, Vladimir Vovk
Generalised entropies and asymptotic complexities of languages. Inf. Comput. 237 (2014)
Yuri Kalnishkan, Michael V. Vyugin
The weak aggregating algorithm and weak mixability. J. Comput. Syst. Sci. 74 (8) (2008)
Andrej Muchnik, Alexander Shen, Mikhail Ustinov, Nikolai K. Vereshchagin, Michael V. Vyugin
Non-reducible descriptions for conditional Kolmogorov complexity. Theor. Comput. Sci. 384 (1) (2007)
Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin
Generalised Entropy and Asymptotic Complexities of Languages. COLT (2007)
Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin, Michael V. Vyugin
Non-reducible Descriptions for Conditional Kolmogorov Complexity. TAMC (2006)
Michael V. Vyugin, Vladimir V. V'yugin
Predictive complexity and information. J. Comput. Syst. Sci. 70 (4) (2005)
Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin
How many strings are easy to predict? Inf. Comput. 201 (1) (2005)
Yuri Kalnishkan, Michael V. Vyugin
The Weak Aggregating Algorithm and Weak Mixability. COLT (2005)
Yuri Kalnishkan, Volodya Vovk, Michael V. Vyugin
Loss functions, complexities, and the Legendre transformation. Theor. Comput. Sci. 313 (2) (2004)
Andrei A. Muchnik, Alexander Shen, Nikolai K. Vereshchagin, Michael V. Vyugin
Non-reducible descriptions for conditional Kolmogorov complexity Electron. Colloquium Comput. Complex. (054) (2004)
Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin
A Criterion for the Existence of Predictive Complexity for Binary Games. ALT (2004)
Michael V. Vyugin
Systems of Strings with High Mutual Complexity. Probl. Inf. Transm. 39 (4) (2003)
Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin
How Many Strings Are Easy to Predict? COLT (2003)
Yuri Kalnishkan, Michael V. Vyugin
Mixability and the Existence of Weak Complexities. COLT (2002)
Michael V. Vyugin, Vladimir V. V'yugin
Predictive Complexity and Information. COLT (2002)
Yuri Kalnishkan, Michael V. Vyugin
On the Absence of Predictive Complexity for Some Games. ALT (2002)
Michael V. Vyugin
Information distance and conditional complexities. Theor. Comput. Sci. 271 (1-2) (2002)
Nikolai K. Vereshchagin, Michael V. Vyugin
Independent minimum length programs to translate between given strings. Theor. Comput. Sci. 271 (1-2) (2002)
Michael V. Vyugin, Vladimir V. V'yugin
On Complexity of Easy Predictable Sequences. Inf. Comput. 178 (1) (2002)
Michael V. Vyugin, Vladimir V. V'yugin
Predictive complexity and information Electron. Colloquium Comput. Complex. 8 (43) (2001)
Ilia Nouretdinov, Volodya Vovk, Michael V. Vyugin, Alexander Gammerman
Pattern Recognition and Density Estimation under the General i.i.d. Assumption. COLT/EuroCOLT (2001)
Michael V. Vyugin, Vladimir V. V'yugin
Non-linear Inequalities between Predictive and Kolmogorov Complexity Electron. Colloquium Comput. Complex. 8 (52) (2001)
Michael V. Vyugin, Vladimir V. V'yugin
Non-linear Inequalities between Predictive and Kolmogorov Complexities. ALT (2001)
Yuri Kalnishkan, Michael V. Vyugin, Volodya Vovk
Loss Functions, Complexities, and the Legendre Transformation. ALT (2001)
Nikolai K. Vereshchagin, Michael V. Vyugin
Independent Minimum Length Programs to Translate between Given Strings. Computational Complexity Conference (2000)
Michael V. Vyugin
Information Distance and Conditional Complexities Electron. Colloquium Comput. Complex. 7 (16) (2000)
Nikolai K. Vereshchagin, Michael V. Vyugin
Independent minimum length programs to translate between given strings Electron. Colloquium Comput. Complex. 7 (35) (2000)