{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:25Z","timestamp":1725456745977},"publisher-location":"Berlin\/Heidelberg","reference-count":8,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029609","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:33:46Z","timestamp":1133397226000},"page":"202-208","source":"Crossref","is-referenced-by-count":3,"title":["On fast algorithms for two servers"],"prefix":"10.1007","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence L.","family":"Larmore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"P.Berman, H.Karloff, G.Tardos, A competitive algorithm for three servers, in Proc. First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990."},{"key":"18_CR2","unstructured":"M.Chrobak, H.Karloff, T.Payne, S.Vishwanathan, New results on server problems, in Proc. First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990."},{"key":"18_CR3","unstructured":"M.Chrobak, L.Larmore, An optimal on-line algorithm for trees, to appear in SIAM J. Computing."},{"key":"18_CR4","unstructured":"M.Chrobak, L.Larmore, A new approach to the server problem, submitted."},{"key":"18_CR5","unstructured":"D.Coppersmith, P.G.Doyle, P.Raghavan, M.Snir, Random walks on weighted graphs and applications to on-line algorithms, manuscript."},{"key":"18_CR6","unstructured":"S.Irani and R.Rubinfeld, A competitive 2-server algorithm, manuscript."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"M.Manasse, L.A.McGeoch, D.Sleator, Competitive algorithms for server problems, Proc. 20th ACM STOC (1988) 322\u2013333.","DOI":"10.1145\/62212.62243"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"P.Raghavan, M.Snir, Memory versus randomization in on-line algorithms, Proc. ICALP 1989.","DOI":"10.1007\/BFb0035792"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029609","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:15:22Z","timestamp":1586578522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029609"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0029609","relation":{},"subject":[]}}