{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:59Z","timestamp":1750307039877,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214031","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"589-598","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Optimal online buffer scheduling for block devices"],"prefix":"10.1145","author":[{"given":"Anna","family":"Adamaszek","sequence":"first","affiliation":[{"name":"University of Warwick, Coventry, United Kingdom"}]},{"given":"Artur","family":"Czumaj","sequence":"additional","affiliation":[{"name":"University of Warwick, Coventry, United Kingdom"}]},{"given":"Matthias","family":"Englert","sequence":"additional","affiliation":[{"name":"University of Warwick, Coventry, United Kingdom"}]},{"given":"Harald","family":"R\u00e4cke","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, Munich, Germany"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Computer Science Department, The Technion | Israel Institute of Technology","author":"Aboud Amjad","year":"2008","unstructured":"Amjad Aboud . Correlation clustering with penalties and approximating the reordering buffer management problem. Master's thesis , Computer Science Department, The Technion | Israel Institute of Technology , 2008 . Amjad Aboud. Correlation clustering with penalties and approximating the reordering buffer management problem. Master's thesis, Computer Science Department, The Technion | Israel Institute of Technology, 2008."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993717"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095249"},{"key":"e_1_3_2_2_4_1","volume-title":"NP-hardness of the sorting buffer problem on the uniform metric. Unpublished manuscript","author":"Asahiro Yuichi","year":"2010","unstructured":"Yuichi Asahiro , Kenichi Kawahara , and Eiji Miyano . NP-hardness of the sorting buffer problem on the uniform metric. Unpublished manuscript , 2010 . Yuichi Asahiro, Kenichi Kawahara, and Eiji Miyano. NP-hardness of the sorting buffer problem on the uniform metric. Unpublished manuscript, 2010."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873603"},{"key":"e_1_3_2_2_6_1","volume-title":"A constant factor approximation algorithm for reordering buffer management. arXiv:1202.4504","author":"Avigdor-Elgrabli Noa","year":"2012","unstructured":"Noa Avigdor-Elgrabli and Yuval Rabani . A constant factor approximation algorithm for reordering buffer management. arXiv:1202.4504 , 2012 . Noa Avigdor-Elgrabli and Yuval Rabani. A constant factor approximation algorithm for reordering buffer management. arXiv:1202.4504, 2012."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.63"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.7"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374412"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11671411_6"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/882455.875020"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_61"},{"key":"e_1_3_2_2_13_1","volume-title":"The sorting buffer problem is NP-hard.CoRR, abs\/1009.4355","author":"Chan Ho-Leung","year":"2010","unstructured":"Ho-Leung Chan , Nicole Megow , Rob van Stee , and Rene Sitters . The sorting buffer problem is NP-hard.CoRR, abs\/1009.4355 , 2010 . Ho-Leung Chan, Nicole Megow, Rob van Stee, and Rene Sitters. The sorting buffer problem is NP-hard.CoRR, abs\/1009.4355, 2010."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250871"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498698.1564503"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_51"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1763424.1763502"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207540310001646821"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2008.08.002"},{"key":"e_1_3_2_2_20_1","first-page":"193","volume-title":"Proceedings of the 6th Latin American Symposium on Theoretical Informatics (LATIN)","author":"Jens","year":"2004","unstructured":"Jens S. Kohrt and Kirk Pruhs. A constant factor approximation algorithm for sorting buffers . In Proceedings of the 6th Latin American Symposium on Theoretical Informatics (LATIN) , pages 193 -- 202 , 2004 . Jens S. Kohrt and Kirk Pruhs. A constant factor approximation algorithm for sorting buffers. In Proceedings of the 6th Latin American Symposium on Theoretical Informatics (LATIN), pages 193--202, 2004."},{"key":"e_1_3_2_2_21_1","first-page":"217","volume-title":"Proceedings of the 9th International Fall Workshop Vision, Modeling, and Visualization (VMV)","author":"Krokowski Jens","year":"2004","unstructured":"Jens Krokowski , Harald Racke , Christian Sohler , and Matthias Westermann . Reducing state changes with a pipeline buffer . In Proceedings of the 9th International Fall Workshop Vision, Modeling, and Visualization (VMV) , pages 217 -- 224 , 2004 . Jens Krokowski, Harald Racke, Christian Sohler, and Matthias Westermann. Reducing state changes with a pipeline buffer. In Proceedings of the 9th International Fall Workshop Vision, Modeling, and Visualization (VMV), pages 217--224, 2004."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/647912.740811"}],"event":{"name":"STOC'12: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"New York New York USA","acronym":"STOC'12"},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214031","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:54Z","timestamp":1750238454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":22,"alternative-id":["10.1145\/2213977.2214031","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214031","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}