{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T14:29:17Z","timestamp":1725632957396},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2009,4,1]],"date-time":"2009-04-01T00:00:00Z","timestamp":1238544000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2009,4,1]],"date-time":"2009-04-01T00:00:00Z","timestamp":1238544000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1109\/infcom.2009.5061916","type":"proceedings-article","created":{"date-parts":[[2009,6,3]],"date-time":"2009-06-03T11:10:14Z","timestamp":1244027414000},"page":"145-153","source":"Crossref","is-referenced-by-count":12,"title":["Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach"],"prefix":"10.1109","author":[{"given":"N.","family":"Buchbinder","sequence":"first","affiliation":[{"name":"Microsoft Res., New England, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Lewin-Eytan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Menache","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Naor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Orda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Online Computation and Competitive Analysis","year":"1998","author":"borodin","key":"3"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.23.4.769"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/18.720535"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72709-5_1"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061916"},{"key":"6","first-page":"689","article-title":"online primal-dual algorithms for covering and packing problems","author":"buchbinder","year":"2005","journal-title":"Proc of the 13th Annual European Symposium on Algorithms"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/18.720551"},{"year":"0","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057288"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/18.641562"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.4108\/ICST.WIOPT2008.3233"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367747"}],"event":{"name":"2009 Proceedings IEEE INFOCOM","start":{"date-parts":[[2009,4,19]]},"location":"Rio de Janeiro, Brazil","end":{"date-parts":[[2009,4,25]]}},"container-title":["IEEE INFOCOM 2009"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5061887\/5061888\/05061916.pdf?arnumber=5061916","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T13:22:54Z","timestamp":1677763374000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/5061916\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/infcom.2009.5061916","relation":{},"subject":[],"published":{"date-parts":[[2009,4]]}}}