{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:26Z","timestamp":1750306346420,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T00:00:00Z","timestamp":1468195200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["CCF-1409130"],"award-info":[{"award-number":["CCF-1409130"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,11]]},"DOI":"10.1145\/2935764.2935824","type":"proceedings-article","created":{"date-parts":[[2016,7,8]],"date-time":"2016-07-08T15:03:00Z","timestamp":1467990180000},"page":"207-209","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Brief Announcement"],"prefix":"10.1145","author":[{"given":"Sungjin","family":"Im","sequence":"first","affiliation":[{"name":"University of California, Merced, Merced, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maryam","family":"Shadloo","sequence":"additional","affiliation":[{"name":"University of California, Merced, Merced, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1735223.1735245"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989539"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"E. Angel E. Bampis and V. Chau. Throughput maximization in the speed-scaling setting. arXiv preprint arXiv:1309.1732 2013.  E. Angel E. Bampis and V. Chau. Throughput maximization in the speed-scaling setting. arXiv preprint arXiv:1309.1732 2013.","DOI":"10.1007\/978-3-319-13075-0_20"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32820-6_15"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-013-0312-6"},{"key":"e_1_3_2_1_6_1","first-page":"449","volume-title":"FSTTCS","author":"Bampis E.","year":"2013"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35261-4_14"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13075-0_21"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1333875.1334231"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799354138"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPA.2008.128"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.38"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183907.1183908"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1060.0218"},{"key":"e_1_3_2_1_15_1","first-page":"107","volume-title":"Approximation and Online Algorithms","author":"Cohen-Addad V.","year":"2014"},{"key":"e_1_3_2_1_16_1","first-page":"360","volume-title":"Mathematical Foundations of Computer Science","author":"Huang C.-C.","year":"2014"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/2722129.2722201"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1067309.1067324"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-006-7910-6"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0510886103"},{"key":"e_1_3_2_1_21_1","unstructured":"J. Markoff and S. Lohr. Intel's huge bet turns iffy new york times september 29 2002.  J. Markoff and S. Lohr. Intel's huge bet turns iffy new york times september 29 2002."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/795662.796264"}],"event":{"name":"SPAA '16: 28th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Pacific Grove California USA","acronym":"SPAA '16"},"container-title":["Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2935764.2935824","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2935764.2935824","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:55:49Z","timestamp":1750222549000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2935764.2935824"}},"subtitle":["A QPTAS for Non-preemptive Speed-scaling"],"short-title":[],"issued":{"date-parts":[[2016,7,11]]},"references-count":22,"alternative-id":["10.1145\/2935764.2935824","10.1145\/2935764"],"URL":"https:\/\/doi.org\/10.1145\/2935764.2935824","relation":{},"subject":[],"published":{"date-parts":[[2016,7,11]]},"assertion":[{"value":"2016-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}