Michael V. Vyugin

Available identifiers

Publication	Date of Publication	Type
Generalised entropies and asymptotic complexities of languages	2014-07-18	Paper
Learning Theory and Kernel Machines	2010-03-23	Paper
The weak aggregating algorithm and weak mixability	2008-12-12	Paper
Generalised Entropy and Asymptotic Complexities of Languages	2008-01-03	Paper
Non-reducible descriptions for conditional Kolmogorov complexity	2007-09-28	Paper
Theory and Applications of Models of Computation	2007-04-30	Paper
Learning Theory	2006-06-22	Paper
How many strings are easy to predict?	2005-09-22	Paper
Systems of strings with high mutual complexity	2005-09-14	Paper
Algorithmic Learning Theory	2005-08-18	Paper
Predictive complexity and information	2005-06-13	Paper
https://portal.mardi4nfdi.de/entity/Q3046698	2004-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q3046697	2004-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q4473554	2004-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4473553	2004-08-04	Paper
Loss functions, complexities, and the Legendre transformation.	2004-03-14	Paper
https://portal.mardi4nfdi.de/entity/Q4420748	2003-08-18	Paper
On complexity of easy predictable sequences	2003-01-14	Paper
https://portal.mardi4nfdi.de/entity/Q3148814	2002-09-22	Paper
Independent minimum length programs to translate between given strings	2002-03-03	Paper
Information distance and conditional complexities	2002-03-03	Paper

This page was built for person: Michael V. Vyugin