{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:49:33Z","timestamp":1725511773667},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709176"},{"type":"electronic","value":"9783540709183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70918-3_56","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T23:41:23Z","timestamp":1179963683000},"page":"658-669","source":"Crossref","is-referenced-by-count":1,"title":["Improved Online Algorithms for the Sorting Buffer Problem"],"prefix":"10.1007","author":[{"given":"Iftah","family":"Gamzu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Segev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"56_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/11671411_6","volume-title":"Approximation and Online Algorithms","author":"R. Bar-Yehuda","year":"2006","unstructured":"Bar-Yehuda, R., Laserson, J.: Exploiting locality: Approximating sorting buffers. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol.\u00a03879, pp. 69\u201381. Springer, Heidelberg (2006)"},{"key":"56_CR2","doi-asserted-by":"crossref","unstructured":"Bartal, Y.: Probabilistic approximations of metric spaces and its algorithmic applications. In: 37th FOCS, pp. 184\u2013193 (1996)","DOI":"10.1109\/SFCS.1996.548477"},{"key":"56_CR3","doi-asserted-by":"crossref","unstructured":"Bartal, Y.: On approximating arbitrary metrices by tree metrics. In: 30th STOC, pp. 161\u2013168 (1998)","DOI":"10.1145\/276698.276725"},{"key":"56_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/11764298_17","volume-title":"Experimental Algorithms","author":"M. Englert","year":"2006","unstructured":"Englert, M., R\u00f6glin, H., Westermann, M.: Evaluation of online strategies for reordering buffers. In: \u00c0lvarez, C., Serna, M.J. (eds.) WEA 2006. LNCS, vol.\u00a04007, pp. 183\u2013194. Springer, Heidelberg (2006)"},{"key":"56_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1007\/11523468_51","volume-title":"Automata, Languages and Programming","author":"M. Englert","year":"2005","unstructured":"Englert, M., Westermann, M.: Reordering buffer management for non-uniform cost models. In: Caires, L., et al. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 627\u2013638. Springer, Heidelberg (2005)"},{"issue":"3","key":"56_CR6","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.jcss.2004.04.011","volume":"69","author":"J. Fakcharoenphol","year":"2004","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. Journal of Computer and System Sciences\u00a069(3), 485\u2013497 (2004)","journal-title":"Journal of Computer and System Sciences"},{"key":"56_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/11672142_48","volume-title":"STACS 2006","author":"R. Khandekar","year":"2006","unstructured":"Khandekar, R., Pandit, V.: Online sorting buffers on line. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 584\u2013595. Springer, Heidelberg (2006)"},{"key":"56_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/978-3-540-24698-5_23","volume-title":"LATIN 2004: Theoretical Informatics","author":"J.S. Kohrt","year":"2004","unstructured":"Kohrt, J.S., Pruhs, K.: A constant approximation algorithm for sorting buffers. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 193\u2013202. Springer, Heidelberg (2004)"},{"key":"56_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1007\/3-540-45749-6_71","volume-title":"Algorithms - ESA 2002","author":"H. R\u00e4cke","year":"2002","unstructured":"R\u00e4cke, H., Sohler, C., Westermann, M.: Online scheduling for sorting buffers. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 820\u2013832. Springer, Heidelberg (2002)"},{"key":"56_CR10","volume-title":"Applied operating system concepts","author":"A. Silberschatz","year":"2000","unstructured":"Silberschatz, A., Galvin, P.B., Gagne, G.: Applied operating system concepts (Disk scheduling is discussed in Section 13.2). Wiley, Chichester (2000)"},{"key":"56_CR11","volume-title":"Modern Operating Systems","author":"A.S. Tanenbaum","year":"2001","unstructured":"Tanenbaum, A.S.: Modern Operating Systems (Disk scheduling is discussed in Section 5.4). Prentice-Hall, Englewood Cliffs (2001)"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_56.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:12:00Z","timestamp":1605762720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709176","9783540709183"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_56","relation":{},"subject":[]}}