{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:11Z","timestamp":1759638911424},"reference-count":9,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1991,12]]},"DOI":"10.1016\/0196-6774(91)90035-w","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T13:03:10Z","timestamp":1099746190000},"page":"607-614","source":"Crossref","is-referenced-by-count":14,"title":["On fast algorithms for two servers"],"prefix":"10.1016","volume":"12","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":"78","reference":[{"key":"10.1016\/0196-6774(91)90035-W_BIB1","series-title":"Proceedings First Annual ACM-SIAM Symposium on Discrete Algorithms","article-title":"A competitive algorithm for three servers","author":"Berman","year":"1990"},{"key":"10.1016\/0196-6774(91)90035-W_BIB2","series-title":"Proceedings, First Annual ACM-SIAM Symposium on Discrete Algorithms","article-title":"New results on server problems","author":"Chrobak","year":"1990"},{"key":"10.1016\/0196-6774(91)90035-W_BIB3","doi-asserted-by":"crossref","unstructured":"M. Chrobak and L. Larmore, An optimal on-line algorithm for trees, SIAM J. Comput., to appear.","DOI":"10.1137\/0220008"},{"key":"10.1016\/0196-6774(91)90035-W_BIB4","unstructured":"M. Chrobak and L. Larmore, A new approach to the server problem, submitted."},{"key":"10.1016\/0196-6774(91)90035-W_BIB5","unstructured":"D. Coppersmith, P. G. Doyle, P. Raghavan and M. Snir, Random walks on weighted graphs and applications to on-line algorithms, manuscript."},{"key":"10.1016\/0196-6774(91)90035-W_BIB6","unstructured":"S. Irani and R. Rubinfeld, A competitive 2-server algorithm, manuscript."},{"key":"10.1016\/0196-6774(91)90035-W_BIB7","unstructured":"M. Manasse, private communication."},{"key":"10.1016\/0196-6774(91)90035-W_BIB8","series-title":"Proceedings, 20th ACM STOC","first-page":"322","article-title":"Competitive algorithms for server problems","author":"Manasse","year":"1988"},{"key":"10.1016\/0196-6774(91)90035-W_BIB9","series-title":"Proceedings, ICALP","article-title":"Memory versus randomization in on-line algorithms","author":"Raghavan","year":"1989"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749190035W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749190035W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T03:57:23Z","timestamp":1549079843000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667749190035W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["019667749190035W"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(91)90035-w","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}