Michael V. Vyugin

According to our database, Michael V. Vyugin authored at least 18 papers between 2000 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2014

Generalised entropies and asymptotic complexities of languages.

Yuri Kalnishkan, Michael V. Vyugin, Vladimir Vovk

Inf. Comput., 2014

2007

Non-reducible descriptions for conditional Kolmogorov complexity.

Andrej Muchnik, Alexander Shen, Mikhail Ustinov, Nikolai K. Vereshchagin, Michael V. Vyugin

Theor. Comput. Sci., 2007

Generalised Entropy and Asymptotic Complexities of Languages.

Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin

Proceedings of the Learning Theory, 20th Annual Conference on Learning Theory, 2007

2006

Non-reducible Descriptions for Conditional Kolmogorov Complexity.

Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin, Michael V. Vyugin

Proceedings of the Theory and Applications of Models of Computation, 2006

2005

The Weak Aggregating Algorithm and Weak Mixability.

Yuri Kalnishkan, Michael V. Vyugin

Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005

2004

A Criterion for the Existence of Predictive Complexity for Binary Games.

Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin

Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

2003

Systems of Strings with High Mutual Complexity.

Michael V. Vyugin

Probl. Inf. Transm., 2003

How Many Strings Are Easy to Predict?

Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin

Proceedings of the Computational Learning Theory and Kernel Machines, 2003

2002

On Complexity of Easy Predictable Sequences.

Michael V. Vyugin, Vladimir V. V'yugin

Inf. Comput., 2002

Predictive Complexity and Information.

Michael V. Vyugin, Vladimir V. V'yugin

Proceedings of the Computational Learning Theory, 2002

Mixability and the Existence of Weak Complexities.

Yuri Kalnishkan, Michael V. Vyugin

Proceedings of the Computational Learning Theory, 2002

On the Absence of Predictive Complexity for Some Games.

Yuri Kalnishkan, Michael V. Vyugin

Proceedings of the Algorithmic Learning Theory, 13th International Conference, 2002

2001

Non-linear Inequalities between Predictive and Kolmogorov Complexity

Michael V. Vyugin, Vladimir V. V'yugin

Electron. Colloquium Comput. Complex., 2001

Pattern Recognition and Density Estimation under the General i.i.d. Assumption.

Ilia Nouretdinov, Volodya Vovk, Michael V. Vyugin, Alex Gammerman

Proceedings of the Computational Learning Theory, 2001

Non-linear Inequalities between Predictive and Kolmogorov Complexities.

Michael V. Vyugin, Vladimir V. V'yugin

Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001

Loss Functions, Complexities, and the Legendre Transformation.

Yuri Kalnishkan, Michael V. Vyugin, Volodya Vovk

Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001

2000

Information Distance and Conditional Complexities

Michael V. Vyugin

Electron. Colloquium Comput. Complex., 2000

Independent Minimum Length Programs to Translate between Given Strings.

Nikolai K. Vereshchagin, Michael V. Vyugin

Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000