{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T20:32:16Z","timestamp":1680467536769},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1994,1]]},"DOI":"10.1007\/bf01294262","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T03:39:14Z","timestamp":1111721954000},"page":"33-52","source":"Crossref","is-referenced-by-count":5,"title":["On-line algorithms for locating checkpoints"],"prefix":"10.1007","volume":"11","author":[{"given":"Marshall","family":"Bern","sequence":"first","affiliation":[]},{"given":"Daniel H.","family":"Greene","sequence":"additional","affiliation":[]},{"given":"Arvind","family":"Raghunathan","sequence":"additional","affiliation":[]},{"given":"Madhu","family":"Sudan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Wigderson, On the Power of Randomization in Online Algorithms,Proc. 22th ACM Symp. on Theory of Computing, 1990, pp. 379?386.","DOI":"10.1145\/100216.100268"},{"key":"CR2","unstructured":"P. Berman, H. Karloff, and G. Tardos, A Competitive Three-Server Algorithm,Proc. 1st ACM-SIAM Symp. on Discrete Algorithms, 1989, pp. 280?290."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"A. Borodin, N. Linial, and M. Saks, An Optimal Online Algorithm for Metrical Task Systems,Proc. 19th ACM Symp. on Theory of Computing, 1987, pp. 373?382.","DOI":"10.1145\/28395.28435"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1287\/moor.10.4.585","volume":"10","author":"A. Calderbank","year":"1985","unstructured":"A. Calderbank, E. Coffman, and L. Flatto, Sequencing Problems in Two-Server Systems,Math. Oper. Res. 10 (1985), 585?595.","journal-title":"Math. Oper. Res."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1137\/0404017","volume":"4","author":"M. Chrobak","year":"1991","unstructured":"M. Chrobak, H. Karloff, T. Payne, and S. Vishwanathan, New Results on Server Problems,SIAM J. Discrete Math. 4 (1991), 172?181.","journal-title":"SIAM J. Discrete Math."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1137\/0220008","volume":"20","author":"M. Chrobak","year":"1991","unstructured":"M. Chrobak and L. Larmore, An Optimal On-Line Algorithm fork Servers on Trees,SIAM J. Comput. 20 (1991), 144?148.","journal-title":"SIAM J. Comput."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"R. Cole and A. Raghunathan, Online Algorithms for Finger Searching,Proc. 31st IEEE Symp. on Foundations of Computer Science, 1990, pp. 480?489.","DOI":"10.1109\/FSCS.1990.89569"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"D. Coppersmith, P. Doyle, P. Raghavan, and M. Snir, Random Walks on Weighted Graphs, and Applications to On-line Algorithms,Proc. 22th ACM Symp. on Theory of Computing, 1990, pp. 369?378.","DOI":"10.1145\/100216.100266"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/63334.63341","volume":"32","author":"E. Fiala","year":"1989","unstructured":"E. Fiala and D. Greene, Data Compression with Finite Windows,Comm. ACM 32 (1989), 490?505.","journal-title":"Comm. ACM"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"E. Grove, The Harmonic OnlineK-Server Algorithm Is Competitive,Proc. 23rd ACM Symp. on Theory of Computing, 1991, pp. 260?266.","DOI":"10.1145\/103418.103448"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"A. Karlin","year":"1988","unstructured":"A. Karlin, M. Manasse, L. Rudolph, and D. Sleator, Competitive Snoopy Caching,Algorithmica 3 (1988), 79?119.","journal-title":"Algorithmica"},{"key":"CR12","unstructured":"R. Korf, Complexity of Reverse Execution, Manuscript, 1981."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","author":"M. Manasse","year":"1990","unstructured":"M. Manasse, L. McGeoch, and D. Sleator, Competitive Algorithms for On-line Problems,J. Algorithms 11 (1990), 208?230.","journal-title":"J. Algorithms"},{"key":"CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos,Computational Geometry: An Introduction, Springer-Verlag, New York, 1985."},{"key":"CR15","first-page":"687","volume-title":"Lecture Notes in Computer Science, vol. 372","author":"P. Raghavan","year":"1989","unstructured":"P. Raghavan and M. Snir, Memory vs. Randomization in Online Algorithms,Proc. 16th Internat. Colloq. on Automata, Languages, and Programming, Lecture Notes in Computer Science, vol. 372, Springer-Verlag, Berlin, 1989, pp. 687?703."},{"key":"CR16","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,Comm. ACM 28 (1985), 202?208.","journal-title":"Comm. ACM"},{"key":"CR17","volume-title":"Data Compression","author":"J. Storer","year":"1988","unstructured":"J. Storer,Data Compression, Computer Science Press, Rockville, MD, 1988."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01294262.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01294262\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01294262","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T13:48:28Z","timestamp":1586180908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01294262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["BF01294262"],"URL":"https:\/\/doi.org\/10.1007\/bf01294262","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}