{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:27:26Z","timestamp":1725460046310},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642380150"},{"type":"electronic","value":"9783642380167"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38016-7_10","type":"book-chapter","created":{"date-parts":[[2013,4,30]],"date-time":"2013-04-30T13:58:58Z","timestamp":1367330338000},"page":"107-119","source":"Crossref","is-referenced-by-count":0,"title":["Asymptotically Optimal Online Page Migration on Three Points"],"prefix":"10.1007","author":[{"given":"Akira","family":"Matsubayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1006\/jagm.1998.0924","volume":"28","author":"B. Awerbuch","year":"1998","unstructured":"Awerbuch, B., Bartal, Y., Fiat, A.: Distributed paging for general networks. J. Algorithms\u00a028(1), 67\u2013104 (1998)","journal-title":"J. Algorithms"},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0890-5401(03)00055-5","volume":"185","author":"B. Awerbuch","year":"2003","unstructured":"Awerbuch, B., Bartal, Y., Fiat, A.: Competitive distributed file allocation. Information and Computation\u00a0185(1), 1\u201340 (2003)","journal-title":"Information and Computation"},{"issue":"1","key":"10_CR3","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. Theoret. Comput. Sci.\u00a0268(1), 43\u201366 (2001)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10_CR4","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.\u00a051(3), 341\u2013358 (1995)","journal-title":"J. Comput. Sys. Sci."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0304-3975(01)00305-X","volume":"289","author":"W.W. Bein","year":"2002","unstructured":"Bein, W.W., Chrobak, M., Larmore, L.L.: The 3-server problem in the plane. Theoret. Comput. Sci.\u00a0289, 335\u2013354 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Bienkowski, M.: Migrating and replicating data in networks. Comput. Sci. Res. Dev. (2011), doi:10.1007\/s00450-011-0150-8","DOI":"10.1007\/s00450-011-0150-8"},{"issue":"4","key":"10_CR7","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/j.jda.2008.07.006","volume":"7","author":"M. Bienkowski","year":"2009","unstructured":"Bienkowski, M., Byrka, J., Korzeniowski, M., Meyer auf der Heide, F.: Optimal algorithms for page migration in dynamic networks. J. Discrete Algorithms\u00a07(4), 545\u2013569 (2009)","journal-title":"J. Discrete Algorithms"},{"key":"10_CR8","unstructured":"Black, D.L., Sleator, D.D.: Competitive algorithms for replication and migration problems. Tech. Rep. CMU-CS-89-201, Department of Computer Science, Carnegie Mellon University (1989)"},{"key":"10_CR9","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)"},{"issue":"1","key":"10_CR10","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\u00a024(1), 124\u2013157 (1997)","journal-title":"J. Algorithms"},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"A. Karlin","year":"1988","unstructured":"Karlin, A., Manasse, M., Rudolph, L., Sleator, D.: Competitive snoopy caching. Algorithmica\u00a03(1), 79\u2013119 (1988)","journal-title":"Algorithmica"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1145\/210118.210128","volume":"42","author":"E. Koutsoupias","year":"1995","unstructured":"Koutsoupias, E., Papadimitriou, C.: On the k-server conjecture. J. ACM\u00a042, 971\u2013983 (1995)","journal-title":"J. ACM"},{"issue":"3","key":"10_CR13","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.\u00a028(3), 1086\u20131111 (1999)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10_CR14","first-page":"161","volume":"42","author":"A. Matsubayashi","year":"2007","unstructured":"Matsubayashi, A.: Uniform page migration on general networks. International Journal of Pure and Applied Mathematics\u00a042(2), 161\u2013168 (2007)","journal-title":"International Journal of Pure and Applied Mathematics"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Westbrook, J.: Randomized algorithms for multiprocessor page migration. In: DIMACS. Discrete Mathematics and Theoretical Computer Science, vol.\u00a07, pp. 135\u2013150 (1992)","DOI":"10.1090\/dimacs\/007\/10"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38016-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T11:15:17Z","timestamp":1557659717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38016-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642380150","9783642380167"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38016-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}