{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:25:40Z","timestamp":1760441140421},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387678"},{"type":"electronic","value":"9783642387685"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38768-5_44","type":"book-chapter","created":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T00:31:28Z","timestamp":1368750688000},"page":"493-505","source":"Crossref","is-referenced-by-count":9,"title":["The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity"],"prefix":"10.1007","author":[{"given":"Hans-Joachim","family":"B\u00f6ckenhauer","sequence":"first","affiliation":[]},{"given":"Juraj","family":"Hromkovi\u010d","sequence":"additional","affiliation":[]},{"given":"Dennis","family":"Komm","sequence":"additional","affiliation":[]},{"given":"Sacha","family":"Krug","sequence":"additional","affiliation":[]},{"given":"Jasmin","family":"Smula","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Sprock","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"44_CR1","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1137\/060661946","volume":"39","author":"N. Alon","year":"2009","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: The online set cover problem. SIAM Journal on Computing\u00a039(2), 361\u2013370 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"44_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-642-32241-9_44","volume-title":"Computing and Combinatorics","author":"M.P. Bianchi","year":"2012","unstructured":"Bianchi, M.P., B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Keller, L.: Online coloring of bipartite graphs with and without advice. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol.\u00a07434, pp. 519\u2013530. Springer, Heidelberg (2012)"},{"key":"44_CR3","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)"},{"key":"44_CR4","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":"44_CR5","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":"44_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-29344-3_6","volume-title":"LATIN 2012: Theoretical Informatics","author":"H.-J. B\u00f6ckenhauer","year":"2012","unstructured":"B\u00f6ckenhauer, H.-J., Komm, D., Kr\u00e1lovi\u010d, R., Rossmanith, P.: On the advice complexity of the knapsack problem. In: Fern\u00e1ndez-Baca, D. (ed.) LATIN 2012. LNCS, vol.\u00a07256, pp. 61\u201372. Springer, Heidelberg (2012)"},{"key":"44_CR7","unstructured":"Boyar, J., Kamali, S., Larsen, K.S., L\u00f3pez-Ortiz, A.: Online bin packing with advice. Technical Report 1212.4016, arXiv 2012 (2012), \n                    \n                      http:\/\/arxiv.org\/abs\/1212.4016"},{"key":"44_CR8","unstructured":"Cohnen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering Codes. Elsevier (1997)"},{"key":"44_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-642-35261-4_17","volume-title":"Algorithms and Computation","author":"R. Dorrigiv","year":"2012","unstructured":"Dorrigiv, R., He, M., Zeh, N.: On the advice complexity of buffer management. In: Chao, K.-M., Hsu, T.-S., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol.\u00a07676, pp. 136\u2013145. Springer, Heidelberg (2012)"},{"key":"44_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/3-540-44411-4_21","volume-title":"SOFSEM 2000: Theory and Practice of Informatics","author":"M. Demange","year":"2000","unstructured":"Demange, M., Paradon, X., Paschos, V.T.: On-line maximum-order induced hereditary subgraph problems. In: Jeffery, K., Hlav\u00e1\u010d, V., Wiedermann, J. (eds.) SOFSEM 2000. LNCS, vol.\u00a01963, pp. 327\u2013335. Springer, Heidelberg (2000)"},{"key":"44_CR11","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)"},{"issue":"24","key":"44_CR12","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0412(24), 2642\u20132656 (2011)","journal-title":"Theoretical Computer Science"},{"key":"44_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-28332-1_20","volume-title":"Language and Automata Theory and Applications","author":"M. Fori\u0161ek","year":"2012","unstructured":"Fori\u0161ek, M., Keller, L., Steinov\u00e1, M.: Advice complexity of online coloring for paths. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol.\u00a07183, pp. 228\u2013239. Springer, Heidelberg (2012)"},{"key":"44_CR14","unstructured":"Guruswami, V., Rudra, A., Sudan, M.: Essential Coding Theory (2012), Draft available at \n                    \n                      http:\/\/www.cse.buffalo.edu\/~atri\/courses\/coding-theory\/book\/"},{"key":"44_CR15","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)"},{"issue":"2","key":"44_CR16","first-page":"249","volume":"45","author":"D. Komm","year":"2011","unstructured":"Komm, D., Kr\u00e1lovi\u010d, R.: Advice complexity and barely random algorithms. RAIRO ITA\u00a045(2), 249\u2013267 (2011)","journal-title":"RAIRO ITA"},{"key":"44_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-642-30642-6_23","volume-title":"Computer Science \u2013 Theory and Applications","author":"D. Komm","year":"2012","unstructured":"Komm, D., Kr\u00e1lovi\u010d, R., M\u00f6mke, T.: On the advice complexity of the set cover problem. In: Hirsch, E.A., Karhum\u00e4ki, J., Lepist\u00f6, A., Prilutskii, M. (eds.) CSR 2012. LNCS, vol.\u00a07353, pp. 241\u2013252. Springer, Heidelberg (2012)"},{"key":"44_CR18","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, 2nd edn. North-Holland Publishing Company (1978)"},{"key":"44_CR19","doi-asserted-by":"crossref","unstructured":"Moser, R., Scheder, D.: A full derandomization of Sch\u00f6ning\u2019s k-SAT algorithm. In: Proc.\u00a0of STOC\u00a02011, pp. 245\u2013252. ACM (2011)","DOI":"10.1145\/1993636.1993670"},{"key":"44_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-642-29116-6_17","volume-title":"Approximation and Online Algorithms","author":"M.P. 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.\u00a07164, pp. 198\u2013210. Springer, Heidelberg (2012)"},{"issue":"2","key":"44_CR21","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM\u00a028(2), 202\u2013208 (1985)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38768-5_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T22:18:28Z","timestamp":1557699508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38768-5_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387678","9783642387685"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38768-5_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}