{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:53:15Z","timestamp":1725677595931},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642296994"},{"type":"electronic","value":"9783642297007"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29700-7_28","type":"book-chapter","created":{"date-parts":[[2012,4,28]],"date-time":"2012-04-28T08:25:56Z","timestamp":1335601556000},"page":"303-314","source":"Crossref","is-referenced-by-count":3,"title":["A Comparison of Performance Measures via Online Search"],"prefix":"10.1007","author":[{"given":"Joan","family":"Boyar","sequence":"first","affiliation":[]},{"given":"Kim S.","family":"Larsen","sequence":"additional","affiliation":[]},{"given":"Abyayananda","family":"Maiti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Angelopoulos, S., Dorrigiv, R., L\u00f3pez-Ortiz, A.: On the separation and equivalence of paging strategies. In: 18th Symposium on Discrete Algorithms, pp. 229\u2013237. Philadelphia, PA, USA (2007)","key":"28_CR1"},{"issue":"1","key":"28_CR2","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/PL00009285","volume":"25","author":"S. Al-Binali","year":"1999","unstructured":"Al-Binali, S.: A risk-reward framework for the competitive analysis of financial games. Algorithmica\u00a025(1), 99\u2013115 (1999)","journal-title":"Algorithmica"},{"key":"28_CR3","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, Cambridge (1998)"},{"issue":"2","key":"28_CR4","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/1240233.1240245","volume":"3","author":"J. Boyar","year":"2007","unstructured":"Boyar, J., Favrholdt, L.M.: The relative worst order ratio for online algorithms. ACM Transactions on Algorithms\u00a03(2), article 22(2007)","journal-title":"ACM Transactions on Algorithms"},{"issue":"5","key":"28_CR5","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1016\/j.jcss.2007.03.001","volume":"73","author":"J. Boyar","year":"2007","unstructured":"Boyar, J., Favrholdt, L.M., Larsen, K.S.: The relative worst order ratio applied to paging. Journal of Computer and System Sciences\u00a073(5), 818\u2013843 (2007)","journal-title":"Journal of Computer and System Sciences"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-03367-4_11","volume-title":"Algorithms and Data Structures","author":"J. Boyar","year":"2009","unstructured":"Boyar, J., Irani, S., Larsen, K.S.: A Comparison of Performance Measures for Online Algorithms. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 119\u2013130. Springer, Heidelberg (2009), arXiv: 0806.0983v1 [cs.DS]"},{"unstructured":"Boyar, J., Larsen, K.S., Maiti, A.: A comparison of performance measures via online search. Tech. Rep. arXiv:1106.6136v1 [cs.DS], arXiv (2011)","key":"28_CR7"},{"doi-asserted-by":"crossref","unstructured":"Chen, G.H., Kao, M.Y., Lyuu, Y.D., Wong, H.K.: Optimal buy-and-hold strategies for financial markets with bounded daily returns. SIAM Journal on Computing\u00a031(2) (2001)","key":"28_CR8","DOI":"10.1137\/S0097539799358847"},{"issue":"14","key":"28_CR9","doi-asserted-by":"publisher","first-page":"2810","DOI":"10.1016\/j.dam.2007.11.004","volume":"156","author":"E.G. Coffman Jr.","year":"2008","unstructured":"Coffman Jr., E.G., Csirik, J., R\u00f3nyai, L., Zsb\u00e1n, A.: Random-order bin packing. Discrete Applied Mathematics\u00a0156(14), 2810\u20132816 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"28_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/1086649.1086670","volume":"36","author":"R. Dorrigiv","year":"2005","unstructured":"Dorrigiv, R., L\u00f3pez-Ortiz, A.: A survey of performance measures for on-line algorithms. SIGACT News\u00a036(3), 67\u201381 (2005)","journal-title":"SIGACT News"},{"issue":"38\u201340","key":"28_CR11","doi-asserted-by":"publisher","first-page":"3694","DOI":"10.1016\/j.tcs.2009.04.023","volume":"410","author":"R. Dorrigiv","year":"2009","unstructured":"Dorrigiv, R., L\u00f3pez-Ortiz, A., Munro, J.I.: On the relative dominance of paging algorithms. Theoretical Computer Science\u00a0410(38\u201340), 3694\u20133701 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"28_CR12","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/274440.274442","volume":"30","author":"R. El-Yaniv","year":"1998","unstructured":"El-Yaniv, R.: Competitive solutions for online financial problems. ACM Computing Surveys\u00a030(1), 28\u201369 (1998)","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"28_CR13","doi-asserted-by":"publisher","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.M., Turpin, G.: Optimal search and one-way trading online algorithms. Algorithmica\u00a030(1), 101\u2013139 (2001)","journal-title":"Algorithmica"},{"unstructured":"Kenyon, C.: Best-fit bin-packing with random order. In: 7th Symposium on Discrete Algorithms, pp. 359\u2013364 (1996)","key":"28_CR14"},{"issue":"4","key":"28_CR15","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1086\/260229","volume":"82","author":"M. Rothschild","year":"1974","unstructured":"Rothschild, M.: Searching for the lowest price when the distribution of prices is unknown. Journal of Political Economy\u00a082(4), 689\u2013711 (1974)","journal-title":"Journal of Political Economy"},{"issue":"2","key":"28_CR16","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","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29700-7_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:14:05Z","timestamp":1620112445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29700-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642296994","9783642297007"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29700-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}