{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T23:42:39Z","timestamp":1649029359206},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4307,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0304-3975(00)00262-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:49:41Z","timestamp":1027601381000},"page":"107-117","source":"Crossref","is-referenced-by-count":3,"title":["Online algorithms for page replication in rings"],"prefix":"10.1016","volume":"268","author":[{"given":"W\u0142odzimierz","family":"G\u0142azek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00262-0_BIB1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1006\/jagm.1997.0906","article-title":"New on-line algorithms for the page replication problem","volume":"27","author":"Albers","year":"1998","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(00)00262-0_BIB2","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Y. Bartal, A. Fiat, Competitive distributed file alocation. Proc. 25th Ann. ACM Symp. on Theory of Computing, 1993, pp. 164\u2013173.","DOI":"10.1145\/167088.167142"},{"key":"10.1016\/S0304-3975(00)00262-0_BIB3","doi-asserted-by":"crossref","unstructured":"Y. Bartal, A. Fiat, Y. Rabani, Competitive algorithms for distributed data management. Proc. 24th Ann. ACM Symp. on Theory of Computing, 1992, pp. 39\u201350.","DOI":"10.1145\/129712.129717"},{"key":"10.1016\/S0304-3975(00)00262-0_BIB4","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01294260","article-title":"On the power of randomization in online algorithms","volume":"11","author":"Ben-David","year":"1991","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(00)00262-0_BIB5","unstructured":"D.L. Black, D.D. Sleator, Competitive algorithms for replication and migration problems. Tech. Rep. CMU-CS-89-201 Carnegie Mellon University, 1989."},{"key":"10.1016\/S0304-3975(00)00262-0_BIB6","doi-asserted-by":"crossref","unstructured":"R. Fleischer, On the Bahncard problem, Proc. 4th Annual Internat. Computing and Combinatorics Conf., Lecture Notes in Computer Science, vol. 1449, 1998, 65\u201374.","DOI":"10.1007\/3-540-68535-9_10"},{"key":"10.1016\/S0304-3975(00)00262-0_BIB7","doi-asserted-by":"crossref","unstructured":"R. Fleischer, S. Seiden, New results for online page replication, APPROX\u20192000, September 2000, accepted.","DOI":"10.1007\/3-540-44436-X_15"},{"key":"10.1016\/S0304-3975(00)00262-0_BIB8","unstructured":"W. G\u0142 azek, Lower and upper bounds for the problem of page replication in ring networks. Proc. 24th Internat. Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 1672, 1999, pp. 273\u2013283."},{"key":"10.1016\/S0304-3975(00)00262-0_BIB9","series-title":"Local Area Network Architectures","author":"Hutchinson","year":"1988"},{"key":"10.1016\/S0304-3975(00)00262-0_BIB10","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","article-title":"Fast algorithms for bin packing","volume":"8","author":"Johnson","year":"1974","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"10.1016\/S0304-3975(00)00262-0_BIB11","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0203025","article-title":"Worst-case performance bounds for simple one-dimensional packing algorithms","volume":"3","author":"Johnson","year":"1974","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S0304-3975(00)00262-0_BIB12","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","article-title":"Competitive snoopy caching","volume":"3","author":"Karlin","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(00)00262-0_BIB13","doi-asserted-by":"crossref","unstructured":"H. Koga, Randomized on-line algorithms for the page replication problem, Proc. 4th Internat. Annu. Symp. on Algorithms and Computation, Lecture Notes in Computer Science, vol. 762, 1993, pp. 436\u2013445.","DOI":"10.1007\/3-540-57568-5_275"},{"key":"10.1016\/S0304-3975(00)00262-0_BIB14","doi-asserted-by":"crossref","unstructured":"C. Lund, N. Reingold, J. Westbrook, Y. Yan, On-line distributed data management, Proc. 2nd Annu. European Symp. on Algorithms, Lecture Notes in Computer Science, vol. 855, 1994, pp. 202\u2013214.","DOI":"10.1007\/BFb0049409"},{"key":"10.1016\/S0304-3975(00)00262-0_BIB15","unstructured":"P. Raghavan, Lecture notes on randomized algorithms, Technical Report RC 15340 1\/9\/90, (IBM Research Division. T.J. Watson Research Center, New York, 1990."},{"key":"10.1016\/S0304-3975(00)00262-0_BIB16","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Comm. ACM"},{"key":"10.1016\/S0304-3975(00)00262-0_BIB17","series-title":"Introduction to Distributed Algorithms","author":"Tel","year":"1994"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002620?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002620?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,12]],"date-time":"2020-01-12T00:47:37Z","timestamp":1578790057000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002620"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0304397500002620"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00262-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}