{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T02:51:26Z","timestamp":1676947886681},"reference-count":13,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1051\/ita\/2011105","type":"journal-article","created":{"date-parts":[[2011,6,25]],"date-time":"2011-06-25T18:37:09Z","timestamp":1309027029000},"page":"249-267","source":"Crossref","is-referenced-by-count":30,"title":["Advice Complexity and Barely Random Algorithms"],"prefix":"10.1051","volume":"45","author":[{"given":"Dennis","family":"Komm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Kr\u00e1lovi\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,6,24]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0304-3975(98)00116-9","volume":"234","author":"Achlioptas","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"R2","unstructured":"H.-J. B\u00f6ckenhauer, D. Komm, R. Kr\u00e1lovi\u010d, R. Kr\u00e1lovi\u010d and T. M\u00f6mke, On the advice complexity of online problems, in20th International Symposium on Algorithms and Computation (ISAAC\u00a02009) Lect. Notes Comput. Sci.5878(2009) 331\u2013340."},{"key":"R3","unstructured":"H.-J. B\u00f6ckenhauer, D. Komm, R. Kr\u00e1lovi\u010d, R. Kr\u00e1lovi\u010d and T. M\u00f6mke, Online algorithms with advice. To appear."},{"key":"R4","unstructured":"A. Borodin and R. El-Yaniv,Online computation and competitive analysis. Cambridge University Press, New York (1998)."},{"key":"R5","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF02276919","volume":"40","author":"Brucker","year":"1988","journal-title":"Computing"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"S. Dobrev, R. Kr\u00e1lovi\u010d and D. Pardubsk\u00e1, How much information about the future is needed?, in34th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)(2008) 247\u2013258.","DOI":"10.1007\/978-3-540-77566-9_21"},{"key":"R7","doi-asserted-by":"crossref","first-page":"2642","DOI":"10.1016\/j.tcs.2010.08.007","volume":"412","author":"Emek","year":"2010","journal-title":"Theoret. Comput. Sci."},{"key":"R8","unstructured":"J. Hromkovi\u010d,Design and analysis of randomized algorithms: Introduction to design paradigms.Springer-Verlag, New York (2006)."},{"key":"R9","unstructured":"J. Hromkovi\u010d, R. Kr\u00e1lovi\u010d and R. Kr\u00e1lovi\u010d, Information complexity of online problems, in35th International Symposium on Mathematical Foundations of Computer Science (MFCS\u00a02010). Lect. Notes Comput. Sci.6281(2010) 24\u201336."},{"key":"R10","first-page":"1","volume":"2","author":"Hromkovi\u010d","year":"2007","journal-title":"Algorithmic Operations Research"},{"key":"R11","unstructured":"D. Komm and R. Kr\u00e1lovi\u010d, Advice complexity and barely random algorithms, in37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM\u00a02011). Lect. Notes Comput. Sci.6543(2011) 332\u2013343."},{"key":"R12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1051\/ita:2008024","volume":"43","author":"M\u00f6mke","year":"2009","journal-title":"RAIRO-Theor. Inf. Appl."},{"key":"R13","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF01294261","volume":"11","author":"Reingold","year":"1994","journal-title":"Algorithmica"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2011105\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T09:31:53Z","timestamp":1560331913000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2011105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":13,"journal-issue":{"issue":"2"},"alternative-id":["ita100064"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2011105","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4]]}}}