Michael V. Vyugin

27 papers A* 5A 1B 4C 1Journal 15Unranked 1
YearRankTypeTitle / Venue / Authors
2014 J jnl
Generalised entropies and asymptotic complexities of languages.
Inf. Comput.
Yuri Kalnishkan, Michael V. Vyugin, Vladimir Vovk
2008 J jnl
The weak aggregating algorithm and weak mixability.
J. Comput. Syst. Sci.
Yuri Kalnishkan, Michael V. Vyugin
2007 A* conf
Generalised Entropy and Asymptotic Complexities of Languages.
COLT
Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin
2007 J jnl
Non-reducible descriptions for conditional Kolmogorov complexity.
Theor. Comput. Sci.
Andrej Muchnik, Alexander Shen, Mikhail Ustinov, Nikolai K. Vereshchagin, Michael V. Vyugin
2006 C conf
Non-reducible Descriptions for Conditional Kolmogorov Complexity.
TAMC
Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin, Michael V. Vyugin
2005 J jnl
How many strings are easy to predict?
Inf. Comput.
Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin
2005 J jnl
Predictive complexity and information.
J. Comput. Syst. Sci.
Michael V. Vyugin, Vladimir V. V'yugin
2005 A* conf
The Weak Aggregating Algorithm and Weak Mixability.
COLT
Yuri Kalnishkan, Michael V. Vyugin
2004 B conf
A Criterion for the Existence of Predictive Complexity for Binary Games.
ALT
Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin
2004 J jnl
Loss functions, complexities, and the Legendre transformation.
Theor. Comput. Sci.
Yuri Kalnishkan, Volodya Vovk, Michael V. Vyugin
2004 J jnl
Non-reducible descriptions for conditional Kolmogorov complexity
Electron. Colloquium Comput. Complex.
Andrei A. Muchnik, Alexander Shen, Nikolai K. Vereshchagin, Michael V. Vyugin
2003 A* conf
How Many Strings Are Easy to Predict?
COLT
Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin
2003 J jnl
Systems of Strings with High Mutual Complexity.
Probl. Inf. Transm.
Michael V. Vyugin
2002 J jnl
Independent minimum length programs to translate between given strings.
Theor. Comput. Sci.
Nikolai K. Vereshchagin, Michael V. Vyugin
2002 J jnl
Information distance and conditional complexities.
Theor. Comput. Sci.
Michael V. Vyugin
2002 A* conf
Mixability and the Existence of Weak Complexities.
COLT
Yuri Kalnishkan, Michael V. Vyugin
2002 J jnl
On Complexity of Easy Predictable Sequences.
Inf. Comput.
Michael V. Vyugin, Vladimir V. V'yugin
2002 B conf
On the Absence of Predictive Complexity for Some Games.
ALT
Yuri Kalnishkan, Michael V. Vyugin
2002 A* conf
Predictive Complexity and Information.
COLT
Michael V. Vyugin, Vladimir V. V'yugin
2001 B conf
Loss Functions, Complexities, and the Legendre Transformation.
ALT
Yuri Kalnishkan, Michael V. Vyugin, Volodya Vovk
2001 B conf
Non-linear Inequalities between Predictive and Kolmogorov Complexities.
ALT
Michael V. Vyugin, Vladimir V. V'yugin
2001 J jnl
Non-linear Inequalities between Predictive and Kolmogorov Complexity
Electron. Colloquium Comput. Complex.
Michael V. Vyugin, Vladimir V. V'yugin
2001 — conf
Pattern Recognition and Density Estimation under the General i.i.d. Assumption.
COLT/EuroCOLT
Ilia Nouretdinov, Volodya Vovk, Michael V. Vyugin, Alex Gammerman
2001 J jnl
Predictive complexity and information
Electron. Colloquium Comput. Complex.
Michael V. Vyugin, Vladimir V. V'yugin
2000 A conf
Independent Minimum Length Programs to Translate between Given Strings.
CCC
Nikolai K. Vereshchagin, Michael V. Vyugin
2000 J jnl
Independent minimum length programs to translate between given strings
Electron. Colloquium Comput. Complex.
Nikolai K. Vereshchagin, Michael V. Vyugin
2000 J jnl
Information Distance and Conditional Complexities
Electron. Colloquium Comput. Complex.
Michael V. Vyugin