{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T10:17:46Z","timestamp":1672481866754},"reference-count":19,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1051\/ita\/2015003","type":"journal-article","created":{"date-parts":[[2015,4,27]],"date-time":"2015-04-27T02:33:06Z","timestamp":1430101986000},"page":"139-152","source":"Crossref","is-referenced-by-count":1,"title":["Towards using the history in online computation with advice"],"prefix":"10.1051","volume":"49","author":[{"given":"Sacha","family":"Krug","sequence":"first","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2015,4,27]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"J. Arndt, Matters Compuational: Ideas, Algorithms, Source Code. Springer (2011).","DOI":"10.1007\/978-3-642-14764-7"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"K. Barhum, H.-J. B\u00f6ckenhauer, M. Fori\u0161ek, H. Gebauer, J. Hromkovi\u010d, S. Krug, J. Smula and B. Steffen, On the power of advice and randomization for the disjoint path allocation problem. InProc. of SOFSEM. Vol. 8327 ofLect. Note Comput. Sci.Springer (2014) 89\u2013101.","DOI":"10.1007\/978-3-319-04298-5_9"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"M.P. Bianchi, H.-J. B\u00f6ckenhauer, J. Hromkovi\u010d and L. Keller, Online coloring of bipartite graphs with and without advice. InProc. of COCOON. Vol. 7434 ofLect. Note Comput. Sci.Springer (2012) 519\u2013530.","DOI":"10.1007\/978-3-642-32241-9_44"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"H.-J. B\u00f6ckenhauer, J. Hromkovi\u010d, D. Komm, S. Krug, J. Smula and A. Sprock, The string guessing problem as a method to prove lower bounds on the advice complexity. InProc. of COCOON. Vol. 7936 ofLect. Note Comput. Sci.Springer (2013) 493\u2013504.","DOI":"10.1007\/978-3-642-38768-5_44"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"H.-J. B\u00f6ckenhauer, D. Komm, R. Kr\u00e1lovi\u010d and R. Kr\u00e1lovi\u010d, On the advice complexity of the k-server problem. InProc. of ICALP. Vol. 6755 ofLect. Note Comput. Sci.Springer (2011) 207\u2013218.","DOI":"10.1007\/978-3-642-22006-7_18"},{"key":"R6","doi-asserted-by":"crossref","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. InProc. of ISAAC. Vol. 5878 ofLect. Note Comput. Sci.Springer (2009) 331\u2013340.","DOI":"10.1007\/978-3-642-10631-6_35"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"H.-J. B\u00f6ckenhauer, D. Komm, R. Kr\u00e1lovi\u010d and P. Rossmanith, On the advice complexity of the knapsack problem. InProc. of LATIN. Vol. 7256 ofLect. Note Comput. Sci.Springer (2012) 61\u201372.","DOI":"10.1007\/978-3-642-29344-3_6"},{"key":"R8","unstructured":"A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis. Cambridge University Press (1998)."},{"key":"R9","unstructured":"G. Cohen, I. Honkala, S. Litsyn and A. Lobstein, Covering Codes. Elsevier Science Publishers Ltd. (1997)."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"S. Dobrev, R. Kr\u00e1lovi\u010d and D. Pardubsk\u00e1, How much information about the future is needed? InProc. of SOFSEM. Vol. 4910 ofLect. Note Comput. Sci.Springer (2008) 247\u2013258.","DOI":"10.1007\/978-3-540-77566-9_21"},{"key":"R11","unstructured":"Emek Y., Fraigniaud P., Korman A. and Ros\u00e9n A., Online computation with advice.Theor. Comput. Sci.412(2011) 2642\u20132656."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"M. Fori\u0161ek, L. Keller and M. Steinov\u00e1, Advice complexity of online coloring for paths. InProc. of LATA(2012) 228\u2013239.","DOI":"10.1007\/978-3-642-28332-1_20"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"S. Gupta, S. Kamali and A. L\u00f3pez-Ortiz, On advice complexity of the k-server problem under sparse metrics. InProc. of SIROCCO. Vol. 8179 ofLect. Note Comput. Sci. Springer (2013) 55\u201367.","DOI":"10.1007\/978-3-319-03578-9_5"},{"key":"R14","unstructured":"G. K\u00e9ri, Tables for Bounds on Covering Codes. http:\/\/www.sztaki.hu\/\u02dckeri\/codes\/. Accessed: 2014-05-30."},{"key":"R15","doi-asserted-by":"crossref","unstructured":"D. Komm, R. Kr\u00e1lovi\u010d and T. M\u00f6mke, On the advice complexity of the set cover problem. InProc. of CSR. Vol. 7353 ofLect. Note Comput. Sci. Springer (2012) 241\u2013252.","DOI":"10.1007\/978-3-642-30642-6_23"},{"key":"R16","unstructured":"F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, 2nd edition. North-Holland (1978)."},{"key":"R17","doi-asserted-by":"crossref","unstructured":"M.P. Renault and A. Ros\u00e9n, On online algorithms with advice for the k-server problem. InProc. of WAOA(2011) 198\u2013210.","DOI":"10.1007\/978-3-642-29116-6_17"},{"key":"R18","doi-asserted-by":"crossref","unstructured":"S. Seibert, A. Sprock and W. Unger, Advice complexity of the online coloring problem. InProc. of CIAC. Vol. 7878 ofLect. Note Comput. Sci.Springer (2013) 345\u2013357.","DOI":"10.1007\/978-3-642-38233-8_29"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"Sleator D.D. and Tarjan R.E., Amortized efficiency of list update and paging rules.Commun. ACM28(1985) 202\u2013208.","DOI":"10.1145\/2786.2793"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2015003\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,24]],"date-time":"2019-08-24T00:16:57Z","timestamp":1566605817000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2015003"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4]]},"references-count":19,"journal-issue":{"issue":"2"},"alternative-id":["ita140043"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2015003","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4]]}}}