default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael V. Vyugin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j10]Yuri Kalnishkan
, Michael V. Vyugin, Vladimir Vovk:
Generalised entropies and asymptotic complexities of languages. Inf. Comput. 237: 101-141 (2014)
2000 – 2009
- 2008
- [j9]Yuri Kalnishkan, Michael V. Vyugin:
The weak aggregating algorithm and weak mixability. J. Comput. Syst. Sci. 74(8): 1228-1244 (2008) - 2007
- [j8]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) - [c12]Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin:
Generalised Entropy and Asymptotic Complexities of Languages. COLT 2007: 293-307 - 2006
- [c11]Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin, Michael V. Vyugin:
Non-reducible Descriptions for Conditional Kolmogorov Complexity. TAMC 2006: 308-317 - 2005
- [j7]Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin:
How many strings are easy to predict? Inf. Comput. 201(1): 55-71 (2005) - [j6]Michael V. Vyugin, Vladimir V. V'yugin:
Predictive complexity and information. J. Comput. Syst. Sci. 70(4): 539-554 (2005) - [c10]Yuri Kalnishkan, Michael V. Vyugin:
The Weak Aggregating Algorithm and Weak Mixability. COLT 2005: 188-203 - 2004
- [j5]Yuri Kalnishkan, Volodya Vovk, Michael V. Vyugin:
Loss functions, complexities, and the Legendre transformation. Theor. Comput. Sci. 313(2): 195-207 (2004) - [c9]Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin:
A Criterion for the Existence of Predictive Complexity for Binary Games. ALT 2004: 249-263 - [i5]Andrei A. Muchnik, Alexander Shen, Nikolai K. Vereshchagin, Michael V. Vyugin:
Non-reducible descriptions for conditional Kolmogorov complexity. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j4]Michael V. Vyugin:
Systems of Strings with High Mutual Complexity. Probl. Inf. Transm. 39(4): 395-399 (2003) - [c8]Yuri Kalnishkan, Vladimir Vovk, Michael V. Vyugin:
How Many Strings Are Easy to Predict? COLT 2003: 522-536 - 2002
- [j3]Michael V. Vyugin, Vladimir V. V'yugin:
On Complexity of Easy Predictable Sequences. Inf. Comput. 178(1): 241-252 (2002) - [j2]Nikolai K. Vereshchagin, Michael V. Vyugin:
Independent minimum length programs to translate between given strings. Theor. Comput. Sci. 271(1-2): 131-143 (2002) - [j1]Michael V. Vyugin:
Information distance and conditional complexities. Theor. Comput. Sci. 271(1-2): 145-150 (2002) - [c7]Yuri Kalnishkan, Michael V. Vyugin:
On the Absence of Predictive Complexity for Some Games. ALT 2002: 164-172 - [c6]Michael V. Vyugin, Vladimir V. V'yugin:
Predictive Complexity and Information. COLT 2002: 90-104 - [c5]Yuri Kalnishkan, Michael V. Vyugin:
Mixability and the Existence of Weak Complexities. COLT 2002: 105-120 - 2001
- [c4]Yuri Kalnishkan, Michael V. Vyugin, Volodya Vovk:
Loss Functions, Complexities, and the Legendre Transformation. ALT 2001: 181-189 - [c3]Michael V. Vyugin, Vladimir V. V'yugin:
Non-linear Inequalities between Predictive and Kolmogorov Complexities. ALT 2001: 190-204 - [c2]Ilia Nouretdinov, Volodya Vovk, Michael V. Vyugin, Alex Gammerman:
Pattern Recognition and Density Estimation under the General i.i.d. Assumption. COLT/EuroCOLT 2001: 337-353 - [i4]Michael V. Vyugin, Vladimir V. V'yugin:
Predictive complexity and information. Electron. Colloquium Comput. Complex. TR01 (2001) - [i3]Michael V. Vyugin, Vladimir V. V'yugin:
Non-linear Inequalities between Predictive and Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [c1]Nikolai K. Vereshchagin, Michael V. Vyugin:
Independent Minimum Length Programs to Translate between Given Strings. CCC 2000: 138- - [i2]Michael V. Vyugin:
Information Distance and Conditional Complexities. Electron. Colloquium Comput. Complex. TR00 (2000) - [i1]Nikolai K. Vereshchagin, Michael V. Vyugin:
Independent minimum length programs to translate between given strings. Electron. Colloquium Comput. Complex. TR00 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-26 01:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
