{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:40:26Z","timestamp":1777596026547,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540602200","type":"print"},{"value":"9783540447474","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60220-8_58","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:52:11Z","timestamp":1330278731000},"page":"147-158","source":"Crossref","is-referenced-by-count":9,"title":["Page migration with limited local memory capacity"],"prefix":"10.1007","author":[{"given":"Susanne","family":"Albers","sequence":"first","affiliation":[]},{"given":"Hisashi","family":"Koga","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Y. Bartal and A. Fiat. Competitive distributed file allocation. In Proc. 25th Annual ACM Symposium on Theory of Computing, pages 164\u2013173, 1993.","DOI":"10.1145\/167088.167142"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Y. Bartal and A. Fiat. Heat & Dump: Competitive Distributed Paging. In Proc. 34th Annual IEEE Symposium on Foundations of Computer Science, pages 22\u201332, 1993.","DOI":"10.1109\/SFCS.1993.366885"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"S. Albers and H. Koga. New on-line algorithms for the page replication problem. In Proc. 4th Scandinavian Workshop on Algorithm Theory, pages 25\u201336, 1994.","DOI":"10.1007\/3-540-58218-5_3"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/BF01294260","volume":"11","author":"S. Ben-David","year":"1994","unstructured":"S. Ben-David, A. Borodin, R.M. Karp, G. Tardos and A. Wigderson. On the power of randomization in on-line algorithms. Algorithmica, 11:2\u201314,1994.","journal-title":"Algorithmica"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Y. Bartal, A. Fiat and Y. Rabani. Competitive algorithms for distributed data management. In Proc. 24th Annual ACM Symposium on Theory of Computing, pages 39\u201350, 1992.","DOI":"10.1145\/129712.129717"},{"key":"13_CR6","unstructured":"D.L. Black and D.D. Sleator. Competitive algorithms for replication and migration problems. Technical Report Carnegie Mellon University, CMU-CS-89-201, 1989."},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/0196-6774(91)90041-V","volume":"12","author":"A. Fiat","year":"1991","unstructured":"A. Fiat, R.M. Karp, M. Luby, L.A. McGeoch, D.D. Sleator and N.E. Young. Competitive paging algorithm. Journal of Algorithm, 12:685\u2013699, 1991.","journal-title":"Journal of Algorithm"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"H. Koga. Randomized on-line algorithms for the page replication problem. In Proc. 4th International Annual Symposium on Algorithms and Computation, pages 436\u2013445, 1993.","DOI":"10.1007\/3-540-57568-5_275"},{"key":"13_CR9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"A.R. Karlin","year":"1988","unstructured":"A.R. Karlin, M.S. Manasse, L. Rudolph and D.D. Sleator. Competitive snoopy caching. Algorithmica, 3:79\u2013119, 1988.","journal-title":"Algorithmica"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"C. Lund, N. Reingold, J. Westbrook and D. Yan. On-line distributed data management. In Proc. 2nd Annual European Symposium on Algorithms, pages 202\u2013214, 1994.","DOI":"10.1007\/BFb0049409"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communication of the ACM, 28:202\u2013208, 1985.","journal-title":"Communication of the ACM"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"J. Westbrook. Randomized Algorithms for the multiprocessor page migration. In Proc. of the DIMACS Workshop on On-Line Algorithms, pages 135\u2013149, 1992.","DOI":"10.1090\/dimacs\/007\/10"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60220-8_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:56:08Z","timestamp":1605646568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60220-8_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602200","9783540447474"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-60220-8_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}