| A Closer Look at Adaptive Regret D Adamskiy, WM Koolen, A Chernov, V Vovk | 103* | |
| Upper semi-lattice of binary strings with the relation A Chernov, A Muchnik, A Romashchenko, A Shen, N Vereshchagin Theoretical Computer Science 271 (1-2), 69-95, 2002 | 49* | 2002 |
| Prediction with advice of unknown number of experts A Chernov, V Vovk Arxiv preprint arXiv:1006.0475, 2010 | 48 | 2010 |
| Prediction with expert evaluators’ advice A Chernov, V Vovk Algorithmic Learning Theory, 8-22, 2009 | 46 | 2009 |
| Prediction with expert advice under discounted loss A Chernov, F Zhdanov Algorithmic Learning Theory, 255-269, 2010 | 34 | 2010 |
| An Investigation on Online Versus Batch Learning in Predicting User Behaviour N Burlutskiy, M Petridis, A Fish, A Chernov, N Ali Research and Development in Intelligent Systems XXXIII: Incorporating …, 2016 | 27 | 2016 |
| Supermartingales in prediction with expert advice A Chernov, Y Kalnishkan, F Zhdanov, V Vovk Theoretical Computer Science 411 (29), 2647-2669, 2010 | 23 | 2010 |
| On-line probability, complexity and randomness A Chernov, A Shen, N Vereshchagin, V Vovk Algorithmic Learning Theory, 138-153, 2008 | 23 | 2008 |
| Reconstructing persistent graph structures from noisy images. A Chernov, V Kurlin Image-a.= Imagen-a. 3 (5), 19-22, 2013 | 19 | 2013 |
| Specialist experts for prediction with side information Y Kalnishkan, D Adamskiy, A Chernov, T Scarfe 2015 IEEE international conference on data mining workshop (ICDMW), 1470-1477, 2015 | 12 | 2015 |
| Algorithmic complexity bounds on future prediction errors A Chernov, M Hutter, J Schmidhuber Information and Computation 205 (2), 242-261, 2007 | 12* | 2007 |
| Variants of realizability for propositional formulas and the logic of the weak law of excluded middle AV Chernov, DP Skvortsov, EZ Skvortsova, NK Vereshchagin Computer Science Logic, 74-88, 2002 | 8 | 2002 |
| Supermartingales in prediction with expert advice A Chernov, Y Kalnishkan, F Zhdanov, V Vovk Algorithmic Learning Theory, 199-213, 2008 | 6 | 2008 |
| Monotone conditional complexity bounds on future prediction errors A Chernov, M Hutter Algorithmic Learning Theory, 414-428, 2005 | 4 | 2005 |
| Complexity of sets obtained as values of propositional formulas AV Chernov Mathematical Notes 75 (1), 131-139, 2004 | 4 | 2004 |
| Aggregating Algorithm competing with Banach lattices F Zhdanov, A Chernov, Y Kalnishkan Arxiv preprint arXiv:1002.0709, 2010 | 3 | 2010 |
| Variants of Realizability for Propositional Formulas and the Logic of Weak Excluded Middle NK Vereshchagin, DP Skvortsov, EZ Skvortsova, AV Chernov Trudy Matematicheskogo Instituta imeni VA Steklova 242, 77-97, 2003 | 2 | 2003 |
| On Theorem 2.3 in" Prediction, Learning, and Games" by Cesa-Bianchi and Lugosi A Chernov Arxiv preprint arXiv:1011.5668, 2010 | 1 | 2010 |
| Asymmetric Planning for Incremental Real-Time Heuristic Search A Chernov, J Schmidhuber Technical Report No. IDSIA-15-06, 2006 | 1 | 2006 |
| Prefix-like Complexities of Finite and Infinite Sequences on Generalized Turing Machines A Chernov, J Schmidhuber Technical Report IDSIA-11-05, IDSIA, Manno (Lugano), Switzerland, 2005 | 1 | 2005 |
Vladimir VovkDepartment of Computer Science, Royal Holloway, University of LondonVerified email at rhul.ac.uk
