{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:39Z","timestamp":1725663399592},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540549451"},{"type":"electronic","value":"9783540466000"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54945-5_73","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:19:15Z","timestamp":1330193955000},"page":"284-293","source":"Crossref","is-referenced-by-count":1,"title":["Competitiveness and response time in on-line algorithms"],"prefix":"10.1007","author":[{"given":"Vladimir","family":"Estivill-Castro","sequence":"first","affiliation":[]},{"given":"Murray","family":"Sherk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"4","key":"32_CR1","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1287\/moor.10.4.585","volume":"10","author":"A.R. Calderbank","year":"1985","unstructured":"A.R. Calderbank, E.G. Coffman Jr, and L. Flatto. Sequence problems in two-server systems. Mathematics of Operations Research, 10(4):585\u2013598, November 1985.","journal-title":"Mathematics of Operations Research"},{"key":"32_CR2","unstructured":"M. Chrobak, H. Karloff, T. Payne, and S. Vishwanathan. New results on server problems. In Proc. of the Symp. on Discrete Algorithms, pages 291\u2013300. SIAM, 1990."},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"A. Fiat, Y. Rabani, and Y. Ravid. Competitive k-server algorithms. In Proceedings of the Symposium on Foundations of Computer Science, pages 454\u2013463. IEEE, 1990.","DOI":"10.1109\/FSCS.1990.89566"},{"key":"32_CR4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0020-0190(83)90030-3","volume":"16","author":"M. Hofri","year":"1983","unstructured":"M. Hofri. Should the two-headed disk be greedy? \u2014 yes, it should. Information Processing Letters, 16:83\u201385, February 1983.","journal-title":"Information Processing Letters"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn. Data Structures and Algorithms, Vol 1: Sorting and Searching. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1984.","DOI":"10.1007\/978-3-642-69672-5_2"},{"key":"32_CR6","first-page":"322","volume-title":"Proceedings of the Symposium on Theory of Computing","author":"M. Manasse","year":"1988","unstructured":"M. Manasse, L. McGeoch, and D. Sleator. Competitive algorithms for on-line problems. In Proceedings of the Symposium on Theory of Computing, pages 322\u2013333, New York, 1988. ACM."},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"M. Sherk. Self-Adjusting k-ary Search Trees and Self-Adjusting Balanced Search Trees. PhD thesis, U. of Toronto, 1990. Available as Comp. Sci. Technical Report 234\/90.","DOI":"10.1007\/3-540-51542-9_32"},{"key":"32_CR8","first-page":"235","volume-title":"Proceedings of the Symposium on Theory of Computing","author":"D. Sleator","year":"1983","unstructured":"D. Sleator and R. Tarjan. Self-adjusting binary trees. In Proceedings of the Symposium on Theory of Computing, pages 235\u2013245, New York, 1983. ACM."},{"issue":"2","key":"32_CR9","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"D. Sleator and R. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2):202\u2013208, February 1985.","journal-title":"Communications of the ACM"},{"key":"32_CR10","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D. Sleator","year":"1985","unstructured":"D. Sleator and R. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32:652\u2013686, July 1985.","journal-title":"Journal of the ACM"},{"issue":"2","key":"32_CR11","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R. Tarjan","year":"1985","unstructured":"R. Tarjan. Amortized computational complexity. SIAM Journal of Alg. Disc. Meth., 6(2):306\u2013318, April 1985.","journal-title":"SIAM Journal of Alg. Disc. Meth."}],"container-title":["Lecture Notes in Computer Science","ISA'91 Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54945-5_73.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:56:56Z","timestamp":1605628616000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54945-5_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540549451","9783540466000"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-54945-5_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}