default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexey V. Chernov
Person information
- affiliation: University of Brighton, UK
- affiliation (2012 - 2014): University of Bedfordshire, UK
- affiliation (2011 - 2012): Durham University, UK
- affiliation (2007 - 2011): University of London, Royal Holloway, UK
- affiliation (former): LIF, Marseilles, France
- affiliation (former): IDSIA, Lugano, Switzerland
- affiliation (PhD 2003): Moscow State University, Department of Mathematical Logic and Theory of Algorithms, Moscow, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j4]Dmitry Adamskiy, Wouter M. Koolen, Alexey V. Chernov, Vladimir Vovk:
A Closer Look at Adaptive Regret. J. Mach. Learn. Res. 17: 23:1-23:21 (2016)- 2015
- [c10]Yuri Kalnishkan
, Dmitry Adamskiy, Alexey V. Chernov, Tim Scarfe:
Specialist Experts for Prediction with Side Information. ICDM Workshops 2015: 1470-1477 - 2014
- [i10]Alexey V. Chernov, Vladimir Vovk:
Prediction with Advice of Unknown Number of Experts. CoRR abs/1408.2040 (2014) - 2012
- [c9]Dmitry Adamskiy, Wouter M. Koolen, Alexey V. Chernov, Vladimir Vovk:
A Closer Look at Adaptive Regret. ALT 2012: 290-304 - 2010
- [j3]Alexey V. Chernov, Yuri Kalnishkan, Fedor Zhdanov, Vladimir Vovk:
Supermartingales in prediction with expert advice. Theor. Comput. Sci. 411(29-30): 2647-2669 (2010) - [c8]Alexey V. Chernov, Fedor Zhdanov:
Prediction with Expert Advice under Discounted Loss. ALT 2010: 255-269 - [c7]Alexey V. Chernov, Vladimir Vovk:
Prediction with Advice of Unknown Number of Experts. UAI 2010: 117-125 - [i9]Fedor Zhdanov, Alexey V. Chernov, Yuri Kalnishkan:
Aggregating Algorithm competing with Banach lattices. CoRR abs/1002.0709 (2010) - [i8]Alexey V. Chernov, Yuri Kalnishkan, Fedor Zhdanov, Vladimir Vovk:
Supermartingales in Prediction with Expert Advice. CoRR abs/1003.2218 (2010) - [i7]Alexey V. Chernov, Fedor Zhdanov:
Prediction with Expert Advice under Discounted Loss. CoRR abs/1005.1918 (2010) - [i6]Alexey V. Chernov, Vladimir Vovk:
Prediction with Advice of Unknown Number of Experts. CoRR abs/1006.0475 (2010)
2000 – 2009
- 2009
- [c6]Alexey V. Chernov, Vladimir Vovk:
Prediction with Expert Evaluators' Advice. ALT 2009: 8-22 - [i5]Alexey V. Chernov, Vladimir Vovk:
Prediction with expert evaluators' advice. CoRR abs/0902.4127 (2009) - 2008
- [c5]Alexey V. Chernov, Alexander Shen, Nikolai K. Vereshchagin, Vladimir Vovk:
On-Line Probability, Complexity and Randomness. ALT 2008: 138-153 - [c4]Alexey V. Chernov, Yuri Kalnishkan, Fedor Zhdanov, Vladimir Vovk:
Supermartingales in Prediction with Expert Advice. ALT 2008: 199-213 - [i4]Andrej Muchnik, Alexey V. Chernov, Alexander Shen:
Algorithmic randomness and splitting of supermartingales. CoRR abs/0807.3156 (2008) - 2007
- [j2]Alexey V. Chernov, Marcus Hutter, Jürgen Schmidhuber:
Algorithmic complexity bounds on future prediction errors. Inf. Comput. 205(2): 242-261 (2007) - [i3]Alexey V. Chernov, Marcus Hutter, Jürgen Schmidhuber:
Algorithmic Complexity Bounds on Future Prediction Errors. CoRR abs/cs/0701120 (2007) - 2006
- [c3]Alexey V. Chernov, Jürgen Schmidhuber:
Prefix-Like Complexities and Computability in the Limit. CiE 2006: 85-93 - [i2]Alexey V. Chernov, Marcus Hutter, Jürgen Schmidhuber:
Complexity Monotone in Conditions and Future Prediction Errors. Kolmogorov Complexity and Applications 2006 - 2005
- [c2]Alexey V. Chernov, Marcus Hutter:
Monotone Conditional Complexity Bounds on Future Prediction Errors. ALT 2005: 414-428 - [i1]Alexey V. Chernov, Marcus Hutter:
Monotone Conditional Complexity Bounds on Future Prediction Errors. CoRR abs/cs/0507041 (2005) - 2002
- [j1]Alexey V. Chernov, Andrei A. Muchnik, Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin:
Upper semi-lattice of binary strings with the relation "x is simple conditional to y". Theor. Comput. Sci. 271(1-2): 69-95 (2002) - [c1]Alexey V. Chernov, Dmitrij P. Skvortsov, Elena Z. Skvortsova, Nikolai K. Vereshchagin:
Variants of Realizability for Propositional Formulas and the Logic of the Weak Law of Excluded Middle. CSL 2002: 74-88
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-09-13 01:36 CEST 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:
