{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T06:29:59Z","timestamp":1774592999533,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642283314","type":"print"},{"value":"9783642283321","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-28332-1_20","type":"book-chapter","created":{"date-parts":[[2012,2,29]],"date-time":"2012-02-29T09:45:36Z","timestamp":1330508736000},"page":"228-239","source":"Crossref","is-referenced-by-count":20,"title":["Advice Complexity of Online Coloring for Paths"],"prefix":"10.1007","author":[{"given":"Michal","family":"Fori\u0161ek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucia","family":"Keller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monika","family":"Steinov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1137\/S009753979833965X","volume":"36","author":"Y. Bartal","year":"2006","unstructured":"Bartal, Y., Fiat, A., Leonardi, S.: Lower bounds for on-line graph problems with application to on-line circuit and optical routing. SIAM J. Comput.\u00a036, 354\u2013393 (2006)","journal-title":"SIAM J. Comput."},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-22006-7_18","volume-title":"Automata, Languages and Programming","author":"H.-J. B\u00f6ckenhauer","year":"2011","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: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol.\u00a06755, pp. 207\u2013218. Springer, Heidelberg (2011)"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-642-10631-6_35","volume-title":"Algorithms and Computation","author":"H.-J. B\u00f6ckenhauer","year":"2009","unstructured":"B\u00f6ckenhauer, H.-J., Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R., M\u00f6mke, T.: On the Advice Complexity of Online Problems. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 331\u2013340. Springer, Heidelberg (2009)"},{"key":"20_CR4","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)"},{"key":"20_CR5","unstructured":"Cie\u015blik, I.: On-line graph coloring. Ph.D. thesis, Jagiellonian University Krak\u00f3w (2006)"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a04910, pp. 247\u2013258. Springer, Heidelberg (2008)"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","volume":"21","author":"P. Elias","year":"1975","unstructured":"Elias, P.: Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory\u00a021, 194\u2013203 (1975)","journal-title":"IEEE Transactions on Information Theory"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-642-02927-1_36","volume-title":"Automata, Languages and Programming","author":"Y. Emek","year":"2009","unstructured":"Emek, Y., Fraigniaud, P., Korman, A., Ros\u00e9n, A.: Online Computation with Advice. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S.E., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05555, pp. 427\u2013438. Springer, Heidelberg (2009)"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Finch, S.R.: Mathematical Constants (Encyclopedia of Mathematics and its Applications). Cambridge University Press (August 2003)","DOI":"10.1017\/CBO9780511550447"},{"issue":"2","key":"20_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/jgt.3190120212","volume":"12","author":"A. Gyrfs","year":"1988","unstructured":"Gyrfs, A., Lehel, J.: On-line and first fit colorings of graphs. Journal of Graph Theory\u00a012(2), 217\u2013227 (1988)","journal-title":"Journal of Graph Theory"},{"key":"20_CR11","first-page":"211","volume-title":"Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1992","author":"M.M. Halld\u00f3rsson","year":"1992","unstructured":"Halld\u00f3rsson, M.M., Szegedy, M.: Lower bounds for on-line graph coloring. In: Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1992, pp. 211\u2013216. Society for Industrial and Applied Mathematics, Philadelphia (1992)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Hromkovi\u010d, J.: Design and analysis of randomized algorithms. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2005)","DOI":"10.1007\/3-540-27903-2"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a06281, pp. 24\u201336. Springer, Heidelberg (2010)"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-642-18381-2_28","volume-title":"SOFSEM 2011: Theory and Practice of Computer Science","author":"D. Komm","year":"2011","unstructured":"Komm, D., Kr\u00e1lovi\u010d, R.: Advice Complexity and Barely Random Algorithms. In: \u010cern\u00e1, I., Gyim\u00f3thy, T., Hromkovi\u010d, J., Jeffery, K.G., Kr\u00e1lovi\u010d, R., Vukolic, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol.\u00a06543, pp. 332\u2013343. Springer, Heidelberg (2011)"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s11139-006-0075-1","volume":"12","author":"J. Sondow","year":"2006","unstructured":"Sondow, J., Zudilin, W.: Eulers constant, q-logarithms, and formulas of Ramanujan and Gosper. The Ramanujan Journal\u00a012, 225\u2013244 (2006)","journal-title":"The Ramanujan Journal"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28332-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T04:24:23Z","timestamp":1556425463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28332-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642283314","9783642283321"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28332-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}