2008 |
25 | EE | Yuri Kalnishkan,
Michael V. Vyugin:
The weak aggregating algorithm and weak mixability.
J. Comput. Syst. Sci. 74(8): 1228-1244 (2008) |
2007 |
24 | EE | Yuri Kalnishkan,
Vladimir Vovk,
Michael V. Vyugin:
Generalised Entropy and Asymptotic Complexities of Languages.
COLT 2007: 293-307 |
23 | EE | Andrej Muchnik,
Alexander Shen,
Mikhail Ustinov,
Nikolai K. Vereshchagin,
Michael V. Vyugin:
Non-reducible descriptions for conditional Kolmogorov complexity.
Theor. Comput. Sci. 384(1): 77-86 (2007) |
2006 |
22 | EE | Andrej Muchnik,
Alexander Shen,
Nikolai K. Vereshchagin,
Michael V. Vyugin:
Non-reducible Descriptions for Conditional Kolmogorov Complexity.
TAMC 2006: 308-317 |
2005 |
21 | EE | Yuri Kalnishkan,
Michael V. Vyugin:
The Weak Aggregating Algorithm and Weak Mixability.
COLT 2005: 188-203 |
20 | EE | Yuri Kalnishkan,
Vladimir Vovk,
Michael V. Vyugin:
How many strings are easy to predict?
Inf. Comput. 201(1): 55-71 (2005) |
19 | EE | Michael V. Vyugin,
Vladimir V. V'yugin:
Predictive complexity and information.
J. Comput. Syst. Sci. 70(4): 539-554 (2005) |
2004 |
18 | EE | Yuri Kalnishkan,
Vladimir Vovk,
Michael V. Vyugin:
A Criterion for the Existence of Predictive Complexity for Binary Games.
ALT 2004: 249-263 |
17 | EE | Andrei A. Muchnik,
Alexander Shen,
Nikolai K. Vereshchagin,
Michael V. Vyugin:
Non-reducible descriptions for conditional Kolmogorov complexity
Electronic Colloquium on Computational Complexity (ECCC)(054): (2004) |
16 | EE | Yuri Kalnishkan,
Volodya Vovk,
Michael V. Vyugin:
Loss functions, complexities, and the Legendre transformation.
Theor. Comput. Sci. 313(2): 195-207 (2004) |
2003 |
15 | EE | Yuri Kalnishkan,
Vladimir Vovk,
Michael V. Vyugin:
How Many Strings Are Easy to Predict?
COLT 2003: 522-536 |
2002 |
14 | EE | Yuri Kalnishkan,
Michael V. Vyugin:
On the Absence of Predictive Complexity for Some Games.
ALT 2002: 164-172 |
13 | EE | Yuri Kalnishkan,
Michael V. Vyugin:
Mixability and the Existence of Weak Complexities.
COLT 2002: 105-120 |
12 | EE | Michael V. Vyugin,
Vladimir V. V'yugin:
Predictive Complexity and Information.
COLT 2002: 90-104 |
11 | EE | Michael V. Vyugin,
Vladimir V. V'yugin:
On Complexity of Easy Predictable Sequences.
Inf. Comput. 178(1): 241-252 (2002) |
10 | EE | Nikolai K. Vereshchagin,
Michael V. Vyugin:
Independent minimum length programs to translate between given strings.
Theor. Comput. Sci. 271(1-2): 131-143 (2002) |
9 | EE | Michael V. Vyugin:
Information distance and conditional complexities.
Theor. Comput. Sci. 271(1-2): 145-150 (2002) |
2001 |
8 | EE | Yuri Kalnishkan,
Michael V. Vyugin,
Volodya Vovk:
Loss Functions, Complexities, and the Legendre Transformation.
ALT 2001: 181-189 |
7 | EE | Michael V. Vyugin,
Vladimir V. V'yugin:
Non-linear Inequalities between Predictive and Kolmogorov Complexities.
ALT 2001: 190-204 |
6 | EE | Ilia Nouretdinov,
Volodya Vovk,
Michael V. Vyugin,
Alexander Gammerman:
Pattern Recognition and Density Estimation under the General i.i.d. Assumption.
COLT/EuroCOLT 2001: 337-353 |
5 | EE | Michael V. Vyugin,
Vladimir V. V'yugin:
Predictive complexity and information
Electronic Colloquium on Computational Complexity (ECCC) 8(43): (2001) |
4 | EE | Michael V. Vyugin,
Vladimir V. V'yugin:
Non-linear Inequalities between Predictive and Kolmogorov Complexity
Electronic Colloquium on Computational Complexity (ECCC) 8(52): (2001) |
2000 |
3 | EE | Nikolai K. Vereshchagin,
Michael V. Vyugin:
Independent Minimum Length Programs to Translate between Given Strings.
IEEE Conference on Computational Complexity 2000: 138- |
2 | EE | Michael V. Vyugin:
Information Distance and Conditional Complexities
Electronic Colloquium on Computational Complexity (ECCC) 7(16): (2000) |
1 | EE | Nikolai K. Vereshchagin,
Michael V. Vyugin:
Independent minimum length programs to translate between given strings
Electronic Colloquium on Computational Complexity (ECCC) 7(35): (2000) |