{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:36:59Z","timestamp":1743111419668,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646822"},{"type":"electronic","value":"9783540691068"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054374","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T07:43:28Z","timestamp":1149666208000},"page":"264-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Randomized online multi-threaded paging"],"prefix":"10.1007","author":[{"given":"Steven S.","family":"Seiden","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"issue":"3","key":"25_CR1","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/PL00009158","volume":"18","author":"S. Albers","year":"1997","unstructured":"Albers, S. On the influence of lookahead in competitive paging algorithms. Algorithmica 18, 3 (Jul 1997), 283\u2013305.","journal-title":"Algorithmica"},{"issue":"1","key":"25_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/BF01294260","volume":"11","author":"S. Ben-David","year":"1994","unstructured":"Ben-David, S., Borodin, A., Karp, R., Tardos, G., and Wigderson, A. On the power of randomization in on-line algorithms. Algorithmica 11, 1 (Jan 1994), 2\u201314.","journal-title":"Algorithmica"},{"issue":"2","key":"25_CR3","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1006\/jcss.1995.1021","volume":"50","author":"A. Borodin","year":"1995","unstructured":"Borodin, A., Irani, S., Raghavan, P., and Schieber, B. Competitive paging with locality of reference. Journal of Computer and System Sciences 50, 2 (Apr 1995), 244\u2013258.","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"25_CR4","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1145\/146585.146588","volume":"39","author":"A. Borodin","year":"1992","unstructured":"Borodin, A., Linial, N., and Saks, M. An optimal online algorithm for metrical task system. Journal of the Association for Computing Machinery 39, 4 (Oct 1992), 745\u2013763.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Feuerstein, E., and Strejilevich de Loma, A. On multi-threaded paging. In Proceedings of the 7th International Symposium on Algorithms and Computation (Dec 1996), pp. 417\u2013426.","DOI":"10.1007\/BFb0009518"},{"issue":"4","key":"25_CR6","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/0196-6774(91)90041-V","volume":"12","author":"A. Fiat","year":"1991","unstructured":"Fiat, A., Karp, R., Luby, M., McGeoch, L., Sleator, D., and Young, N. Competitive paging algorithms. Journal of Algorithms 12, 4 (Dec 1991), 685\u2013699.","journal-title":"Journal of Algorithms"},{"issue":"3","key":"25_CR7","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1137\/S0097539792236353","volume":"25","author":"S. Irani","year":"1996","unstructured":"Irani, S., Karlin, A., and Phillips, S. Strongly competitive algorithms for paging with locality of reference. SIAM Journal on Computing 25, 3 (Jun 1996), 477\u2013497.","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"25_CR8","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/BF01189993","volume":"11","author":"A. Karlin","year":"1994","unstructured":"Karlin, A., Manasse, M., McGeoch, L., and Owicki, S. Competitive randomized algorithms for nonuniform problems. Algorithmica 11, 6 (Jun 1994), 542\u2013571.","journal-title":"Algorithmica"},{"issue":"1","key":"25_CR9","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., and Sleator, D. Competitive snoopy caching. Algorithmica 3, 1 (1988), 79\u2013119.","journal-title":"Algorithmica"},{"issue":"2","key":"25_CR10","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","author":"M. Manasse","year":"1990","unstructured":"Manasse, M., McGeoch, L., and Sleator, D. Competitive algorithms for server problems. Journal of Algorithms 11, 2 (Jun 1990), 208\u2013230.","journal-title":"Journal of Algorithms"},{"issue":"6","key":"25_CR11","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1007\/BF01759073","volume":"6","author":"L. McGeoch","year":"1991","unstructured":"McGeoch, L., and Sleator, D. A strongly competitive randomized paging algorithm. Algorithmica 6, 6 (1991), 816\u2013825.","journal-title":"Algorithmica"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Motwani, R., and Raghavan, P. Randomized Algorithms. Cambridge University Press, 1997.","DOI":"10.1201\/9781420049503-c16"},{"key":"25_CR13","unstructured":"P. Cao, E.W. Felten, K. L. Application-controlled file caching policies. In Proc. of the Summer USENIX Conference (1994)."},{"key":"25_CR14","unstructured":"R. D. Barve, E. F. Grove, J. S. V. Application-controlled paging for a shared cache. In Proc. 36th Symp. on Foundations of Computer Science (1995), pp. 204\u2013213."},{"issue":"2","key":"25_CR15","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"Sleator, D., and Tarjan, R. Amortized efficiency of list update and paging rules. Communications of the ACM 28, 2 (Feb 1985), 202\u2013208.","journal-title":"Communications of the ACM"},{"issue":"3","key":"25_CR16","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D. Sleator","year":"1985","unstructured":"Sleator, D., and Tarjan, R. Self adjusting binary search trees. Journal of the ACM 32, 3 (Jul 1985), 652\u2013686.","journal-title":"Journal of the ACM"},{"key":"25_CR17","unstructured":"Strejilevich de Loma, A. New results on fair multi-threaded paging. In Proceedings of the 1st Argentine Workshop on Theoretical Informatics (1997), pp. 111\u2013122."},{"key":"25_CR18","unstructured":"Von Neumann, J., and Morgenstern, O. Theory of games and economic behavior, 1st ed. Princeton University Press, 1944."},{"issue":"5","key":"25_CR19","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1137\/S0097539791199796","volume":"23","author":"J. Westbrook","year":"1994","unstructured":"Westbrook, J. Randomized algorithms for multiprocessor page migration. SIAM Journal on Computing 23, 5 (Oct 1994), 951\u2013965.","journal-title":"SIAM Journal on Computing"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Yao, A. C. C. Probabilistic computations: Toward a unified measure of complexity. In Proc. 18th IEEE Symposium on Foundations of Computer Science (FOCS) (1977), pp. 222\u2013227.","DOI":"10.1109\/SFCS.1977.24"},{"issue":"6","key":"25_CR21","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/BF01189992","volume":"11","author":"N. Young","year":"1994","unstructured":"Young, N. The k-server dual and loose competitiveness for paging. Algorithmica 11, 6 (Jun 1994), 525\u201341.","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'98"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054374","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T20:12:49Z","timestamp":1675714369000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0054374"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646822","9783540691068"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0054374","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"26 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}