{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:06Z","timestamp":1725664086710},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582182"},{"type":"electronic","value":"9783540485773"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58218-5_3","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:37:31Z","timestamp":1330252651000},"page":"25-36","source":"Crossref","is-referenced-by-count":4,"title":["New on-line algorithms for the page replication problem"],"prefix":"10.1007","author":[{"given":"Susanne","family":"Albers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hisashi","family":"Koga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"3_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":"3_CR2","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"},{"issue":"1","key":"3_CR3","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, special issue on on-line algorithms, 11(1):2\u201314, 1994.","journal-title":"Algorithmica"},{"key":"3_CR4","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":"3_CR5","first-page":"406","volume":"762","author":"M. Chrobak","year":"1993","unstructured":"M. Chrobak, L.L. Larmore, N. Reingold and J. Westbrook. Page migration algorithms using work functions. In Proc. 4th International Annual Symposium on Algorithms and Complexity, Springer LNCS Vol. 762, pages 406\u2013415, 1993.","journal-title":"Springer LNCS"},{"issue":"2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1145\/356876.356883","volume":"14","author":"D. Downey","year":"1982","unstructured":"D. Downey and D. Foster. Comparative models of the file assignment problem. Computing Surveys, 14(2):287\u2013313, 1982.","journal-title":"Computing Surveys"},{"key":"3_CR7","first-page":"436","volume":"762","author":"H. Koga","year":"1993","unstructured":"H. Koga. Randomized on-line algorithms for the page replication problem. In Proc. 4th International Annual Symposium on Algorithms and Complexity, Springer LNCS Vol. 762, pages 436\u2013445, 1993.","journal-title":"Springer LNCS"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"C. Lund, N. Reingold, J. Westbrook and D. Yan. On-line distributed data management. Manuscript, submitted, 1994.","DOI":"10.1007\/BFb0049409"},{"key":"3_CR9","first-page":"687","volume":"372","author":"P. Raghavan","year":"1989","unstructured":"P. Raghavan and M. Snir. Memory versus randomization in on-line algorithms. In Proc. 16th International Colloquium on Automata, Languages and Progamming, Springer LNCS Vol. 372, pages 687\u2013703, 1989.","journal-title":"Springer LNCS"},{"issue":"8","key":"3_CR10","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1109\/12.30869","volume":"38","author":"C. Scheurich","year":"1989","unstructured":"C. Scheurich and M. Dubois. Dynamic page migration in multiprocessors with distributed global memory. IEEE Transactions on Computers, 38(8):1154\u20131163, 1989.","journal-title":"IEEE Transactions on Computers"},{"key":"3_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":"3_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, AMS, pages 135\u2013149, 1992.","DOI":"10.1090\/dimacs\/007\/10"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT '94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58218-5_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:18:49Z","timestamp":1605629929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58218-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582182","9783540485773"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-58218-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}