{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:58:11Z","timestamp":1750309091615,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,27]],"date-time":"2004-06-27T00:00:00Z","timestamp":1088294400000},"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":[[2004,6,27]]},"DOI":"10.1145\/1007912.1007923","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"64-73","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Fighting against two adversaries"],"prefix":"10.1145","author":[{"given":"Marcin","family":"Bienkowski","sequence":"first","affiliation":[{"name":"University of Paderborn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miroslaw","family":"Korzeniowski","sequence":"additional","affiliation":[{"name":"University of Paderborn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"additional","affiliation":[{"name":"University of Paderborn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,6,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167142"},{"key":"e_1_3_2_1_2_1","first-page":"97","volume-title":"Online Algorithms","author":"Bartal Y.","year":"1996","unstructured":"Y. Bartal . Distributed paging . In Online Algorithms , pages 97 -- 117 , 1996 . Y. Bartal. Distributed paging. In Online Algorithms, pages 97--117, 1996."},{"key":"e_1_3_2_1_3_1","first-page":"43","volume-title":"Proc. of the 8th ACM-SIAM Symp. on Discrete Algorithms (SODA)","author":"Bartal Y.","year":"1997","unstructured":"Y. Bartal , M. Charikar , and P. Indyk . On page migration and other relaxed task systems . In Proc. of the 8th ACM-SIAM Symp. on Discrete Algorithms (SODA) , pages 43 -- 52 , 1997 . Y. Bartal, M. Charikar, and P. Indyk. On page migration and other relaxed task systems. In Proc. of the 8th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 43--52, 1997."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129717"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946319"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100268"},{"key":"e_1_3_2_1_8_1","volume-title":"Online Computation and Competitive Analysis","author":"Borodin A.","year":"1998","unstructured":"A. Borodin and R. El-Yaniv . Online Computation and Competitive Analysis . Cambridge University Press , 1998 . A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/646336.688251"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0013-1","volume-title":"Handbook of Randomized Computing","author":"Rajesekaran S.","year":"2001","unstructured":"S. Rajesekaran , P. M. Pardalos , J. H. Reif , and J. Rolim . Handbook of Randomized Computing , volume II . Kluwer Academic Publishers , 2001 . S. Rajesekaran, P. M. Pardalos, J. H. Reif, and J. Rolim. Handbook of Randomized Computing, volume II. Kluwer Academic Publishers, 2001."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1037083"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509936"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"e_1_3_2_1_15_1","first-page":"135","volume-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","volume":"7","author":"Westbrook J.","year":"1992","unstructured":"J. Westbrook . Randomized algorithms for multiprocessor page migration . In DIMACS Series in Discrete Mathematics and Theoretical Computer Science , volume 7 , pages 135 -- 150 , 1992 . J. Westbrook. Randomized algorithms for multiprocessor page migration. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 7, pages 135--150, 1992."}],"event":{"name":"SPAA04: 16th ACM Symposium on Parallelism in Algorithms and Architectures 2004","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Barcelona Spain","acronym":"SPAA04"},"container-title":["Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007912.1007923","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1007912.1007923","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:43:39Z","timestamp":1750286619000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007912.1007923"}},"subtitle":["page migration in dynamic networks"],"short-title":[],"issued":{"date-parts":[[2004,6,27]]},"references-count":14,"alternative-id":["10.1145\/1007912.1007923","10.1145\/1007912"],"URL":"https:\/\/doi.org\/10.1145\/1007912.1007923","relation":{},"subject":[],"published":{"date-parts":[[2004,6,27]]},"assertion":[{"value":"2004-06-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}