{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:16:01Z","timestamp":1725560161947},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407201"},{"type":"electronic","value":"9783540451679"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45167-9_38","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T23:10:53Z","timestamp":1279840253000},"page":"522-536","source":"Crossref","is-referenced-by-count":0,"title":["How Many Strings Are Easy to Predict?"],"prefix":"10.1007","author":[{"given":"Yuri","family":"Kalnishkan","sequence":"first","affiliation":[]},{"given":"Volodya","family":"Vovk","sequence":"additional","affiliation":[]},{"given":"Michael V.","family":"Vyugin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"38_CR1","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/258128.258179","volume":"44","author":"N. Cesa-Bianchi","year":"1997","unstructured":"Cesa-Bianchi, N., Freund, Y., Haussler, D., Helmbold, D.P., Schapire, R.E., Warmuth, M.K.: How to use expert advice. Journal of the ACM\u00a044(3), 427\u2013485 (1997)","journal-title":"Journal of the ACM"},{"key":"38_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566172","volume-title":"Convexity.","author":"H.G. Eggleston","year":"1958","unstructured":"Eggleston, H.G.: Convexity. Cambridge University Press, Cambridge (1958)"},{"key":"38_CR3","unstructured":"Gallager, R.G.: Information Theory and Reliable Communication. John Wiley and Sons, Inc., Chichester (1968)"},{"issue":"5","key":"38_CR4","doi-asserted-by":"publisher","first-page":"1906","DOI":"10.1109\/18.705569","volume":"44","author":"D. Haussler","year":"1998","unstructured":"Haussler, D., Kivinen, J., Warmuth, M.K.: Sequential prediction of individual sequences under general loss functions. IEEE Transactions on Information Theory\u00a044(5), 1906\u20131925 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Karlin, S., Taylor, H.M.: A First Course in Stochastic Processes. Academic Press, Inc., London (1975)","DOI":"10.1016\/B978-0-08-057041-9.50005-2"},{"key":"38_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M. Li","year":"1997","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 2nd edn. Springer, New York (1997)","edition":"2"},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N. Littlestone","year":"1994","unstructured":"Littlestone, N., Warmuth, M.K.: The weighted majority algorithm. Information and Computation\u00a0108, 212\u2013261 (1994)","journal-title":"Information and Computation"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Vovk, V., Watkins, C.J.H.C.: Universal portfolio selection. In: Proceedings of the 11th Annual Conference on Computational Learning Theory, pp. 12\u201323 (1998)","DOI":"10.1145\/279943.279947"},{"key":"38_CR9","first-page":"357","volume":"13","author":"V.V. V\u2019yugin","year":"1994","unstructured":"V\u2019yugin, V.V.: Algorithmic entropy (complexity) of finite objects and its applications to defining randomness and amount of information. Selecta Mathematica formerly Sovietica\u00a013, 357\u2013389 (1994)","journal-title":"Selecta Mathematica formerly Sovietica"},{"key":"38_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813658","volume-title":"Probability with Martingales","author":"D. Williams","year":"1991","unstructured":"Williams, D.: Probability with Martingales. Cambridge University Press, Cambridge (1991)"},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","volume":"25","author":"A.K. Zvonkin","year":"1970","unstructured":"Zvonkin, A.K., Levin, L.A.: The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Math. Surveys\u00a025, 83\u2013124 (1970)","journal-title":"Russian Math. Surveys"}],"container-title":["Lecture Notes in Computer Science","Learning Theory and Kernel Machines"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45167-9_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T12:59:15Z","timestamp":1559307555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45167-9_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407201","9783540451679"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45167-9_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}