{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:55:10Z","timestamp":1756000510676,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,24]],"date-time":"2017-07-24T00:00:00Z","timestamp":1500854400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1506\/16"],"award-info":[{"award-number":["1506\/16"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Blavatnik Fund"},{"DOI":"10.13039\/501100005386","name":"Israeli Centers for Research Excellence","doi-asserted-by":"publisher","award":["4\/11"],"award-info":[{"award-number":["4\/11"]}],"id":[{"id":"10.13039\/501100005386","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,24]]},"DOI":"10.1145\/3087556.3087570","type":"proceedings-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T17:51:38Z","timestamp":1500573098000},"page":"77-86","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Tight Bounds for Clairvoyant Dynamic Bin Packing"],"prefix":"10.1145","author":[{"given":"Yossi","family":"Azar","sequence":"first","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Vainstein","sequence":"additional","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","article-title":"New lower bounds for certain classes of bin packing algorithms","volume":"441","author":"Balogh J\u00e1nos","year":"2012","unstructured":"J\u00e1nos Balogh , J\u00f3zsef B\u00e9k\u00e9si , and G\u00e1bor Galambos . New lower bounds for certain classes of bin packing algorithms . Theor. Comput. Sci., 440-- 441 : 1 -- 13 , 2012 . J\u00e1nos Balogh, J\u00f3zsef B\u00e9k\u00e9si, and G\u00e1bor Galambos. New lower bounds for certain classes of bin packing algorithms. Theor. Comput. Sci., 440--441:1--13, 2012.","journal-title":"Theor. Comput. Sci., 440--"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9185-z"},{"key":"e_1_3_2_1_4_1","first-page":"1","volume-title":"43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016","author":"Heydrich Sandy","year":"2016","unstructured":"Sandy Heydrich and Rob van Stee . Beating the harmonic lower bound for online bin packing. In 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 , July 11 --15 , 2016 , Rome, Italy, pages 41: 1 -- 41 :14, 2016. Sandy Heydrich and Rob van Stee. Beating the harmonic lower bound for online bin packing. In 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11--15, 2016, Rome, Italy, pages 41:1--41:14, 2016."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/0203025"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212014"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612675"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2015.2450152"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2393868"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935775"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585269"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.07.017"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.42"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90223-I"},{"key":"e_1_3_2_1_15_1","first-page":"44","volume-title":"ISAAC 2012, Taipei, Taiwan, December 19--21, 2012. Proceedings","author":"Wong Prudence W. H.","year":"2012","unstructured":"Prudence W. H. Wong , Fencol C. C. Yung , and Mihai Burcea . An 8\/3 lower bound for online dynamic bin packing. In Algorithms and Computation - 23rd International Symposium , ISAAC 2012, Taipei, Taiwan, December 19--21, 2012. Proceedings , pages 44 -- 53 , 2012 . Prudence W. H. Wong, Fencol C. C. Yung, and Mihai Burcea. An 8\/3 lower bound for online dynamic bin packing. In Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19--21, 2012. Proceedings, pages 44--53, 2012."}],"event":{"name":"SPAA '17: 29th 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","EATCS European Association for Theoretical Computer Science"],"location":"Washington DC USA","acronym":"SPAA '17"},"container-title":["Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087556.3087570","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087556.3087570","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:13Z","timestamp":1750217413000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087556.3087570"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,24]]},"references-count":14,"alternative-id":["10.1145\/3087556.3087570","10.1145\/3087556"],"URL":"https:\/\/doi.org\/10.1145\/3087556.3087570","relation":{},"subject":[],"published":{"date-parts":[[2017,7,24]]},"assertion":[{"value":"2017-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}