{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:36:25Z","timestamp":1725474985858},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496946"},{"type":"electronic","value":"9783540496960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940128_10","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T05:57:35Z","timestamp":1164779855000},"page":"81-89","source":"Crossref","is-referenced-by-count":4,"title":["Offline Sorting Buffers on Line"],"prefix":"10.1007","author":[{"given":"Rohit","family":"Khandekar","sequence":"first","affiliation":[]},{"given":"Vinayaka","family":"Pandit","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Bar-Yehuda, R., Laserson, J.: 9-approximation algorithm for the sorting buffers problem. In: 3rd Workshop on Approximation and Online Algorithms (2005)"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Englert, M., Westermann, M.: Reordering buffer management for non-uniform cost models. In: Proceedings of the 32nd International Colloquium on Algorithms, Langauages, and Programming, pp. 627\u2013638 (2005)","DOI":"10.1007\/11523468_51"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Khandekar, R., Pandit, V.: Online sorting buffers on line. In: Proceedings of the Symposium on Theoretical Aspects of Computer Science, pp. 616\u2013625 (2006)","DOI":"10.1007\/11672142_48"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-540-24698-5_23","volume-title":"LATIN 2004: Theoretical Informatics","author":"J. Kohrt","year":"2004","unstructured":"Kohrt, J., 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":"10_CR5","doi-asserted-by":"crossref","unstructured":"R\u00e4cke, H., Sohler, C., Westermann, M.: Online scheduling for sorting buffers. In: Proceedings of the European Symposium on Algorithms, pp. 820\u2013832 (2002)","DOI":"10.1007\/3-540-45749-6_71"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:49:41Z","timestamp":1619509781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/11940128_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}