Michael V. Vyugin

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from VLDB 2026 / reviewers in the wild / expert

dblp:66/6041 · DBLP profile ↗

← Back

19ranked-venue papers

5as first author

0since 2021 · last 2014

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 11 · 3 first-authorArtificial intelligence and machine learning · 8 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science 6 papers		Information theory · 51% Computational complexity · 47% Automata and formal languages · 2%
Artificial intelligence 3 papers		Learning theory · 100%

Topics — the 6 heaviest of 9, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Information theory › information measures › entropy generalized entropy	0.3	2	2014	Generalised entropies and asymptotic complexities of languages · Inf. Comput. 2014 Generalised Entropy and Asymptotic Complexities of Languages · COLT 2007
Information theory algorithmic information theory	0.1	2	2002	On Complexity of Easy Predictable Sequences · Inf. Comput. 2002 Predictive Complexity and Information · COLT 2002
Machine learning › Learning theory › online learning prediction with expert advice	0.1	1	2005	The Weak Aggregating Algorithm and Weak Mixability · COLT 2005
Machine learning › Learning theory › online learning › prediction with expert advice mixability	0.0	1	2002	Mixability and the Existence of Weak Complexities · COLT 2002
Computational complexity complexity	0.0	1	2002	On Complexity of Easy Predictable Sequences · Inf. Comput. 2002
Computational complexity kolmogorov complexity	0.0	1	2000	Independent Minimum Length Programs to Translate between Given Strings · CCC 2000

Methods — techniques the papers use, named apart from their topics

entropy measures · 0.2kolmogorov complexity · 0.1

Year	Publication	Venue	Position
2014	Generalised entropies and asymptotic complexities of languages Yuri Kalnishkan, Michael V. Vyugin, Vladimir Vovk	Inf. Comput.	2
2008	The weak aggregating algorithm and weak mixability Yuri Kalnishkan, Michael V. Vyugin	J. Comput. Syst. Sci.	2
2007	Generalised Entropy and Asymptotic Complexities of Languages Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin	COLT	3
2007	Non-reducible descriptions for conditional Kolmogorov complexity Andrej Muchnik, Alexander Shen 0001, Mikhail Ustinov, Nikolai K. Vereshchagin, Michael V. Vyugin	Theor. Comput. Sci.	5
2006	Non-reducible Descriptions for Conditional Kolmogorov Complexity Andrej Muchnik, Alexander Shen 0001, Nikolai K. Vereshchagin, Michael V. Vyugin	TAMC	4
2005	The Weak Aggregating Algorithm and Weak Mixability Yuri Kalnishkan, Michael V. Vyugin	COLT	2
2005	How many strings are easy to predict? Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin	Inf. Comput.	3
2005	Predictive complexity and information Michael V. Vyugin, Vladimir V. V'yugin	J. Comput. Syst. Sci.	1
2004	A Criterion for the Existence of Predictive Complexity for Binary Games Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin	ALT	3
2004	Loss functions, complexities, and the Legendre transformation Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin	Theor. Comput. Sci.	3
2002	On the Absence of Predictive Complexity for Some Games Yuri Kalnishkan, Michael V. Vyugin	ALT	2
2002	Mixability and the Existence of Weak Complexities Yuri Kalnishkan, Michael V. Vyugin	COLT	2
2002	Predictive Complexity and Information Michael V. Vyugin, Vladimir V. V'yugin	COLT	1
2002	On Complexity of Easy Predictable Sequences Michael V. Vyugin, Vladimir V. V'yugin	Inf. Comput.	1
2002	Independent minimum length programs to translate between given strings Nikolai K. Vereshchagin, Michael V. Vyugin	Theor. Comput. Sci.	2
2002	Information distance and conditional complexities Michael V. Vyugin	Theor. Comput. Sci.	1
2001	Loss Functions, Complexities, and the Legendre Transformation Yuri Kalnishkan, Michael V. Vyugin, Vladimir Vovk	ALT	2
2001	Non-linear Inequalities between Predictive and Kolmogorov Complexities Michael V. Vyugin, Vladimir V. V'yugin	ALT	1
2000	Independent Minimum Length Programs to Translate between Given Strings Nikolai K. Vereshchagin, Michael V. Vyugin	CCC	2