{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:04Z","timestamp":1759638964530},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319445427"},{"type":"electronic","value":"9783319445434"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44543-4_16","type":"book-chapter","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T07:49:58Z","timestamp":1470642598000},"page":"203-212","source":"Crossref","is-referenced-by-count":2,"title":["Advice Complexity of the Online Search Problem"],"prefix":"10.1007","author":[{"given":"Jhoirene","family":"Clemente","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juraj","family":"Hromkovi\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dennis","family":"Komm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Kudahl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,9]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/978-3-319-04298-5_9","volume-title":"SOFSEM 2014: Theory and Practice of Computer Science","author":"K Barhum","year":"2014","unstructured":"Barhum, K., B\u00f6ckenhauer, H.-J., Fori\u0161ek, M., Gebauer, H., Hromkovi\u010d, J., Krug, S., Smula, J., Steffen, B.: On the power of advice and randomization for the disjoint path allocation problem. In: Geffert, V., Preneel, B., Rovan, B., \u0160tuller, J., Tjoa, A.M. (eds.) SOFSEM 2014. LNCS, vol. 8327, pp. 89\u2013101. Springer, Heidelberg (2014)"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Komm, D., Krug, S., Smula, J., Sprock, A.:The string guessing problem as a method to prove lower bounds on the advice complexity.Theor. Comput. Sci. 554, 95\u2013108 (2014). Elsevier Science Publishers","DOI":"10.1016\/j.tcs.2014.06.006"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","first-page":"207","volume-title":"Proc. of the 38th international colloquium on Automata, languages and programming","author":"H-J B\u00f6ckenhauer","year":"2013","unstructured":"B\u00f6ckenhauer, H.-J., Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R.: On the advice complexity of the k-server problem. In: Du, D.-Z., Zhang, G. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 207\u2013218. Springer, Heidelberg (2013)"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","first-page":"331","volume-title":"Proc. of the 20th International Symposium on Algorithms and Computation (ISAAC 2009)","author":"H-J B\u00f6ckenhauer","year":"2013","unstructured":"B\u00f6ckenhauer, H.-J., Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R., M\u00f6mke, T.: On the advice complexity of the online problem. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 331\u2013340. Springer, Heidelberg (2013)"},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.tcs.2014.01.027","volume":"527","author":"H-J B\u00f6ckenhauer","year":"2014","unstructured":"B\u00f6ckenhauer, H.-J., Komm, D., Kr\u00e1lovi\u010d, R., Rossmanith, P.: The online knapsack problem: advice and randomization. Theor. Comput. Sci. 527, 61\u201372 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR6","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, New York (1998)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/978-3-642-29700-7_28","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"J Boyar","year":"2012","unstructured":"Boyar, J., Larsen, K.S., Maiti, A.: A comparison of performance measures via online search. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) FAW-AAIM 2012. LNCS, vol. 7285, pp. 303\u2013314. Springer, Heidelberg (2012)"},{"key":"16_CR8","unstructured":"Boyar, J., Favrholdt, L.M., Kudahl, C., Mikkelsen, J.W.: Advice complexity for a class of online problems. In: Proceedings of the 32nd Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics, vol. 30, pp. 116\u2013129. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2015)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/978-3-540-77566-9_21","volume-title":"SOFSEM 2008: Theory and Practice of Computer Science","author":"S Dobrev","year":"2008","unstructured":"Dobrev, S., Kr\u00e1lovi\u010d, R., Pardubsk\u00e1, D.: How much information about the future is needed? In: Geffert, V., Karhum\u00e4ki, J., Bertoni, A., Preneel, B., N\u00e1vrat, P., Bielikov\u00e1, M. (eds.) SOFSEM 2008. LNCS, vol. 4910, pp. 247\u2013258. Springer, Heidelberg (2008)"},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/s00453-001-0003-0","volume":"30","author":"R El-Yaniv","year":"2001","unstructured":"El-Yaniv, R., Fiat, A., Karp, R., Turpin, G.: Optimal search and one-way trading online algorithms. Algorithmica 30, 101\u2013139 (2001)","journal-title":"Algorithmica"},{"issue":"24","key":"16_CR11","doi-asserted-by":"crossref","first-page":"2642","DOI":"10.1016\/j.tcs.2010.08.007","volume":"412","author":"Y Emek","year":"2011","unstructured":"Emek, Y., Fraigniaud, P., Korman, A., Ros\u00e9n, A.: Online computation with advice. Theor. Comput. Sci. 412(24), 2642\u20132656 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-3-319-03578-9_5","volume-title":"Structural Information and Communication Complexity","author":"S Gupta","year":"2013","unstructured":"Gupta, S., Kamali, S., L\u00f3pez-Ortiz, A.: On advice complexity of the k-server problem under sparse metrics. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol. 8179, pp. 55\u201367. Springer, Heidelberg (2013)"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/978-3-642-15155-2_3","volume-title":"Mathematical Foundations of Computer Science 2010","author":"J Hromkovi\u010d","year":"2010","unstructured":"Hromkovi\u010d, J., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R.: Information complexity of online problems. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 24\u201336. Springer, Heidelberg (2010)"},{"issue":"2","key":"16_CR14","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1051\/ita\/2011105","volume":"45","author":"D Komm","year":"2011","unstructured":"Komm, D., Kr\u00e1lovi\u010d, R.: Advice complexity and barely random algorithms. Theor. Inform. Appl. (RAIRO) 45(2), 249\u2013267 (2011)","journal-title":"Theor. Inform. Appl. (RAIRO)"},{"issue":"2","key":"16_CR15","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s00453-008-9217-8","volume":"55","author":"J Lorenz","year":"2009","unstructured":"Lorenz, J., Panagiotou, K., Steger, A.: Optimal algorithms for $$k$$ -search with application in option pricing. Algorithmica 55(2), 311\u2013328 (2009)","journal-title":"Algorithmica"},{"key":"16_CR16","unstructured":"Mikkelsen, J.: Randomization can be as helpful as a glimpse of the future in online computation. CoRR, abs\/1511.05886 (2015)"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/978-3-642-29116-6_17","volume-title":"Approximation and Online Algorithms","author":"MP Renault","year":"2012","unstructured":"Renault, M.P., Ros\u00e9n, A.: On Online Algorithms with Advice for the k-Server Problem. In: Solis-Oba, R., Persiano, G. (eds.) WAOA 2011. LNCS, vol. 7164, pp. 198\u2013210. Springer, Heidelberg (2012)"},{"issue":"2","key":"16_CR18","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1985)","journal-title":"Commun. ACM"},{"issue":"3","key":"16_CR19","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/j.tcs.2009.09.026","volume":"412","author":"Y Xu","year":"2011","unstructured":"Xu, Y., Zhang, W., Zheng, F.: Optimal algorithms for the online time series search problem. Theoret. Comput. Sci. 412(3), 192\u2013197 (2011)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44543-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T16:11:13Z","timestamp":1498320673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44543-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319445427","9783319445434"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44543-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}