{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:07:52Z","timestamp":1725574072511},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642183805"},{"type":"electronic","value":"9783642183812"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18381-2_28","type":"book-chapter","created":{"date-parts":[[2011,1,4]],"date-time":"2011-01-04T16:01:51Z","timestamp":1294156911000},"page":"332-343","source":"Crossref","is-referenced-by-count":10,"title":["Advice Complexity and Barely Random Algorithms"],"prefix":"10.1007","author":[{"given":"Dennis","family":"Komm","sequence":"first","affiliation":[]},{"given":"Richard","family":"Kr\u00e1lovi\u010d","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1\u20132","key":"28_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0304-3975(98)00116-9","volume":"234","author":"D. Achlioptas","year":"2000","unstructured":"Achlioptas, D., Chrobak, M., Noga, J.: Competitive analysis of randomized paging algorithms. Theoretical Computer Science\u00a0234(1\u20132), 203\u2013218 (2000)","journal-title":"Theoretical Computer Science"},{"key":"28_CR2","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":"28_CR3","unstructured":"B\u00f6ckenhauer, H.-J., Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R., M\u00f6mke, T.: Online Algorithms with Advice. Technical Report 614. ETH Zurich, Department of Computer Science (2009)"},{"key":"28_CR4","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)"},{"issue":"4","key":"28_CR5","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF02276919","volume":"40","author":"P. Brucker","year":"1988","unstructured":"Brucker, P.: An efficient algorithm for the job-shop problem with two jobs. Computing\u00a040(4), 353\u2013359 (1988)","journal-title":"Computing"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Dobrev, S., Kr\u00e1lovi\u010d, R., Pardubsk\u00e1, D.: How much information about the future is needed? In: 34th Conf.\u00a0on Current Trends in Theory and Practice of Computer Science (SOFSEM\u00a02008), pp. 247\u2013258 (2008)","DOI":"10.1007\/978-3-540-77566-9_21"},{"key":"28_CR7","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., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05555, pp. 427\u2013438. Springer, Heidelberg (2009)"},{"issue":"1","key":"28_CR8","first-page":"1","volume":"2","author":"J. Hromkovi\u010d","year":"2007","unstructured":"Hromkovi\u010d, J., M\u00f6mke, T., Steinh\u00f6fel, K., Widmayer, P.: Job shop scheduling with unit length tasks: bounds and algorithms. Algorithmic Operations Research\u00a02(1), 1\u201314 (2007)","journal-title":"Algorithmic Operations Research"},{"key":"28_CR9","volume-title":"Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms","author":"J. Hromkovi\u010d","year":"2006","unstructured":"Hromkovi\u010d, J.: Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms. Springer, New York (2006)"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Komm, D., Kr\u00e1lovi\u010d, R.: Advice Complexity and Barely Random Algorithms. Technical Report 684. ETH Zurich, Department of Computer Science (2010)","DOI":"10.1007\/978-3-642-18381-2_28"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1051\/ita:2008024","volume":"43","author":"T. M\u00f6mke","year":"2009","unstructured":"M\u00f6mke, T.: On the power of randomization for job shop scheduling with k-units length tasks. RAIRO Theoretical Informatics and Applications\u00a043, 189\u2013207 (2009)","journal-title":"RAIRO Theoretical Informatics and Applications"},{"issue":"1","key":"28_CR12","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF01294261","volume":"11","author":"N. Reingold","year":"1994","unstructured":"Reingold, N., Westbrook, J., Sleator, D.: Randomized competitive algorithms for the list update problem. Algorithmica\u00a011(1), 15\u201332 (1994)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2011: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18381-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,16]],"date-time":"2021-11-16T21:26:48Z","timestamp":1637098008000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18381-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642183805","9783642183812"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18381-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}