{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T20:54:17Z","timestamp":1725656057266},"publisher-location":"New York, NY, USA","reference-count":24,"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":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003194","name":"Agent\u00fara Ministerstva akolstva, vedy, v\u00fdskumu a aportu SR","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003194","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.3087577","type":"proceedings-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T17:51:38Z","timestamp":1500573098000},"page":"265-274","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Optimal Local Buffer Management for Information Gathering with Adversarial Traffic"],"prefix":"10.1145","author":[{"given":"Stefan","family":"Dobrev","sequence":"first","affiliation":[{"name":"Slovak Academy of Sciences, Bratislava, Slovakia"}]},{"given":"Manuel","family":"Lafond","sequence":"additional","affiliation":[{"name":"Universite d'Ottawa, Ottawa, PQ, Canada"}]},{"given":"Lata","family":"Narayanan","sequence":"additional","affiliation":[{"name":"Concordia University, Montreal, PQ, Canada"}]},{"given":"Jaroslav","family":"Opatrny","sequence":"additional","affiliation":[{"name":"Concordia University, Montreal, PQ, Canada"}]}],"member":"320","published-online":{"date-parts":[[2017,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.04.004"},{"volume-title":"Proceedings of SODA. 771--780","author":"Aiello W.","key":"e_1_3_2_1_2_1","unstructured":"W. Aiello , R. Ostrovsky , E. Kushilevitz , and A. Ros\u00e9n . 2003. Dynamic routing with fixed size buffers . In Proceedings of SODA. 771--780 . W. Aiello, R. Ostrovsky, E. Kushilevitz, and A. Ros\u00e9n. 2003. Dynamic routing with fixed size buffers. In Proceedings of SODA. 771--780."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703435522"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00096-8"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/363647.363677"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1082036.1082040"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9143-1"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/050639272"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_44"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703426805"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/363647.363659"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/378580.378588"},{"volume-title":"Proceedings of ICALP, Part II. 139--150","author":"Even G.","key":"e_1_3_2_1_13_1","unstructured":"G. Even and M. Medina . 2010. An O(log n)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines . In Proceedings of ICALP, Part II. 139--150 . G. Even and M. Medina. 2010. An O(log n)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines. In Proceedings of ICALP, Part II. 139--150."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989525"},{"key":"#cr-split#-e_1_3_2_1_15_1.1","doi-asserted-by":"crossref","unstructured":"G. Even and M. Medina. 2016. Online packet routing in grids with bounded buffers. Algorithmica (2016). https:\/\/doi.org\/10.1007\/s00453-016-0177-0 10.1007\/s00453-016-0177-0","DOI":"10.1007\/s00453-016-0177-0"},{"key":"#cr-split#-e_1_3_2_1_15_1.2","doi-asserted-by":"crossref","unstructured":"G. Even and M. Medina. 2016. Online packet routing in grids with bounded buffers. Algorithmica (2016). https:\/\/doi.org\/10.1007\/s00453-016-0177-0","DOI":"10.1007\/s00453-016-0177-0"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073856"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777471"},{"volume-title":"Proceedings of International Conference on Distributed Computing in Sensor Systems.","author":"Kothapalli K.","key":"e_1_3_2_1_18_1","unstructured":"K. Kothapalli and C. Scheideler . 2006. Lower bounds for information gathering in adversarial systems . In Proceedings of International Conference on Distributed Computing in Sensor Systems. K. Kothapalli and C. Scheideler. 2006. Lower bounds for information gathering in adversarial systems. In Proceedings of International Conference on Distributed Computing in Sensor Systems."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36108-1_6"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702413306"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53426-7_24"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087803"},{"volume-title":"Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures ((SPAA)). 305--314","author":"Ros\u00e9n A.","key":"e_1_3_2_1_23_1","unstructured":"A. Ros\u00e9n and G. Scalosub . 2007. Rate vs. Buffer Size: Greedy Information Gathering on the Line . In Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures ((SPAA)). 305--314 . A. Ros\u00e9n and G. Scalosub. 2007. Rate vs. Buffer Size: Greedy Information Gathering on the Line. In Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures ((SPAA)). 305--314."}],"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\/pdf\/10.1145\/3087556.3087577","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T06:48:57Z","timestamp":1673074137000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087556.3087577"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,24]]},"references-count":24,"alternative-id":["10.1145\/3087556.3087577","10.1145\/3087556"],"URL":"https:\/\/doi.org\/10.1145\/3087556.3087577","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"}}]}}