{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:29:31Z","timestamp":1725568171903},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287001"},{"type":"electronic","value":"9783540319252"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11549468_105","type":"book-chapter","created":{"date-parts":[[2010,10,25]],"date-time":"2010-10-25T17:18:34Z","timestamp":1288027114000},"page":"962-971","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Dynamic Page Migration Under Brownian Motion"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Bienkowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miroslaw","family":"Korzeniowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"105_CR1","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Bartal, Y., Fiat, A.: Competitive distributed file allocation. In: Proc. of the 25th ACM Symp. on Theory of Computing (STOC), pp. 164\u2013173 (1993)","DOI":"10.1145\/167088.167142"},{"issue":"1","key":"105_CR2","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. Theoretical Computer Science\u00a0268(1), 43\u201366 (2001)","journal-title":"Theoretical Computer Science"},{"key":"105_CR3","doi-asserted-by":"crossref","unstructured":"Bienkowski, M., Dynia, M., Korzeniowski, M.: Improved algorithms for dynamic page migration. In: Proc. of the 22nd Symp. on Theoretical Aspects of Computer Science (STACS), pp. 365\u2013376 (2005)","DOI":"10.1007\/978-3-540-31856-9_30"},{"key":"105_CR4","doi-asserted-by":"crossref","unstructured":"Bienkowski, M., Korzeniowski, M., Meyer auf der Heide, F.: Fighting against two adversaries: Page migration in dynamic networks. In: Proc. of the 16th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pp. 64\u201373 (2004)","DOI":"10.1145\/1007912.1007923"},{"key":"105_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)"},{"key":"105_CR6","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"105_CR7","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Larmore, L.L., Reingold, N., Westbrook, J.: Page migration algorithms using work functions. In: Proc. of the 4th Int. Symp. on Algorithms and Computation (ISAAC), pp. 406\u2013415 (1993)","DOI":"10.1007\/3-540-57568-5_272"},{"issue":"3","key":"105_CR8","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.C.K.: Competitive online algorithms for distributed data management. SIAM Journal on Computing\u00a028(3), 1086\u20131111 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"105_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0013-1","volume-title":"Handbook of Randomized Computing","author":"S. Rajesekaran","year":"2001","unstructured":"Rajesekaran, S., Pardalos, P.M., Reif, J.H., Rolim, J.: Handbook of Randomized Computing, vol.\u00a0II. Kluwer Academic Publishers, Dordrecht (2001)"},{"issue":"3","key":"105_CR10","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1137\/1037083","volume":"37","author":"J.S. Rosenthal","year":"1995","unstructured":"Rosenthal, J.S.: Convergence rates for Markov chains. SIAM Review\u00a037(3), 387\u2013405 (1995)","journal-title":"SIAM Review"},{"issue":"2","key":"105_CR11","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM\u00a028(2), 202\u2013208 (1985)","journal-title":"Communications of the ACM"},{"key":"105_CR12","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1090\/dimacs\/007\/10","volume":"7","author":"J. Westbrook","year":"1992","unstructured":"Westbrook, J.: Randomized algorithms for multiprocessor page migration. DIMACS Series in Discrete Mathematics and Theoretical Computer Science\u00a07, 135\u2013150 (1992)","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2005 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549468_105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:11:43Z","timestamp":1587341503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549468_105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287001","9783540319252"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11549468_105","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}