{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:49Z","timestamp":1740109309255,"version":"3.37.3"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T00:00:00Z","timestamp":1584921600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T00:00:00Z","timestamp":1584921600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["26330008"],"award-info":[{"award-number":["26330008"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s00453-020-00696-5","type":"journal-article","created":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T12:02:58Z","timestamp":1584964978000},"page":"2535-2563","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A $$3+\\varOmega (1)$$ Lower Bound for Page Migration"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7861-4876","authenticated-orcid":false,"given":"Akira","family":"Matsubayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,23]]},"reference":[{"issue":"1","key":"696_CR1","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0304-3975(00)00259-0","volume":"268","author":"Y Bartal","year":"2001","unstructured":"Bartal, Y., Charikar, M., Indyk, P.: On page migration and other relaxed task systems. Theor. Comput. Sci. 268(1), 43\u201366 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"696_CR2","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1006\/jcss.1995.1073","volume":"51","author":"Y Bartal","year":"1995","unstructured":"Bartal, Y., Fiat, A., Rabani, Y.: Competitive algorithms for distributed data management. J. Comput. Sys. Sci. 51(3), 341\u2013358 (1995)","journal-title":"J. Comput. Sys. Sci."},{"issue":"3","key":"696_CR3","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s00450-011-0150-8","volume":"27","author":"M Bienkowski","year":"2012","unstructured":"Bienkowski, M.: Migrating and replicating data in networks. Comput. Sci. Res. Dev. 27(3), 169\u2013179 (2012)","journal-title":"Comput. Sci. Res. Dev."},{"key":"696_CR4","unstructured":"Bienkowski, M., Byrka, J., Mucha, M.: Dynamic beats fixed: On phase-based algorithms for file migration. In: I.\u00a0Chatzigiannakis, P.\u00a0Indyk, F.\u00a0Kuhn, A.\u00a0Muscholl (eds.) 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a080, pp. 13:1\u201313:14. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2017)"},{"key":"696_CR5","unstructured":"Black, D.L., Sleator, D.D.: Competitive algorithms for replication and migration problems. Technical Report CMU-CS-89-201, Department of Computer Science, Carnegie Mellon University (1989)"},{"issue":"1","key":"696_CR6","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/jagm.1996.0853","volume":"24","author":"M Chrobak","year":"1997","unstructured":"Chrobak, M., Larmore, L.L., Reingold, N., Westbrook, J.: Page migration algorithms using work functions. J. Algorithms 24(1), 124\u2013157 (1997)","journal-title":"J. Algorithms"},{"issue":"3","key":"696_CR7","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1137\/S0097539795287824","volume":"28","author":"C Lund","year":"1999","unstructured":"Lund, C., Reingold, N., Westbrook, J., Yan, D.: Competitive on-line algorithms for distributed data management. SIAM J. Comput. 28(3), 1086\u20131111 (1999)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"696_CR8","first-page":"161","volume":"42","author":"A Matsubayashi","year":"2008","unstructured":"Matsubayashi, A.: Uniform page migration on general networks. Int. J. Pure Appl. Math. 42(2), 161\u2013168 (2008)","journal-title":"Int. J. Pure Appl. Math."},{"issue":"4","key":"696_CR9","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1007\/s00453-013-9841-9","volume":"71","author":"A Matsubayashi","year":"2015","unstructured":"Matsubayashi, A.: Asymptotically optimal online page migration on three points. Algorithmica 71(4), 1035\u20131064 (2015)","journal-title":"Algorithmica"},{"issue":"5","key":"696_CR10","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1137\/S0097539791199796","volume":"23","author":"J Westbrook","year":"1994","unstructured":"Westbrook, J.: Randomized algorithms for multiprocessor page migration. SIAM J. Comput. 23(5), 951\u2013965 (1994)","journal-title":"SIAM J. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00696-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-020-00696-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00696-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T00:31:56Z","timestamp":1616459516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-020-00696-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,23]]},"references-count":10,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["696"],"URL":"https:\/\/doi.org\/10.1007\/s00453-020-00696-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2020,3,23]]},"assertion":[{"value":"13 September 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}