{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:55:32Z","timestamp":1773327332831,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540513711","type":"print"},{"value":"9783540462019","type":"electronic"}],"license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/bfb0035792","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T04:00:28Z","timestamp":1133409628000},"page":"687-703","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Memory versus randomization in on-line algorithms"],"prefix":"10.1007","author":[{"given":"Prabhakar","family":"Raghavan","sequence":"first","affiliation":[]},{"given":"Marc","family":"Snir","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,11,29]]},"reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"A. Borodin, N. Linial, and M. Saks. An optimal online algorithm for metrical task systems. In Nineteenth Annual ACM Symposium on Theory of Computing, pages 373\u2013382, 1987.","DOI":"10.1145\/28395.28435"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"A. K. Chandra, P. Raghavan, W.L. Ruzzo, R. Smolensky, and P. Tiwari. The electrical resistance of a graph captures its commute and cover times. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, Seattle, May 1989.","DOI":"10.1145\/73007.73062"},{"key":"45_CR3","unstructured":"P. Chew. There exist planar graphs almost as good as the complete graph. 1988. To appear, JCSS."},{"key":"45_CR4","unstructured":"A. Fiat, R. Karp, M. Luby, L. McGeoch, D. Sleator, and N. Young. Randomized algorithms for paging problems. 1988. In preparation."},{"issue":"1","key":"45_CR5","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/BF01762111","volume":"3","author":"A. R. Karlin","year":"1988","unstructured":"A. R. Karlin, M. S. Manasse, L. Rudolph, and D.D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):70\u2013119, 1988.","journal-title":"Algorithmica"},{"key":"45_CR6","doi-asserted-by":"crossref","unstructured":"M.S. Manasse, L.A McGeooch, and D.D. Sleator. Competitive algorithms for online problems. In Twentieth ACM Annual Symposium on Theory of Computing, pages 322\u2013333, 1988.","DOI":"10.1145\/62212.62243"},{"key":"45_CR7","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202\u2013208, February 1985.","journal-title":"Communications of the ACM"},{"issue":"6","key":"45_CR8","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1109\/12.2208","volume":"37","author":"K. So","year":"1988","unstructured":"K. So and R.N. Rechtschaffen. Cache operations by MRU change. IEEE Trans. Computers, 37(6):700\u2013709, June 1988.","journal-title":"IEEE Trans. Computers"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035792","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:24:06Z","timestamp":1578525846000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035792"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540513711","9783540462019"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0035792","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989]]},"assertion":[{"value":"29 November 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}