{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:39Z","timestamp":1725663699843},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540557067"},{"type":"electronic","value":"9783540472759"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55706-7_16","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:32:40Z","timestamp":1330252360000},"page":"178-191","source":"Crossref","is-referenced-by-count":0,"title":["The list update problem and the retrieval of sets"],"prefix":"10.1007","author":[{"given":"Fabrizio","family":"d'Amore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincenzo","family":"Liberatore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/BFb0028266","volume":"519","author":"F. d'Amore","year":"1991","unstructured":"d'Amore, F., Marchetti-Spaccamela, A., Nanni, U.: Competitive Algorithms for the Weighted List Update Problem. Proc. 2nd Workshop on Algorithms and Data Structures, Ottawa, Canada, August 1991, (Lecture Notes in Computer Science, 519, 1991, 240\u2013248).","journal-title":"Lecture Notes in Computer Science"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"d'Amore, F., Marchetti-Spaccamela, A., Nanni, U.: The Weighted List Update Problem and the Lazy Adversary. Theoretical Computer Science, (to appear).","DOI":"10.1016\/0304-3975(93)90201-4"},{"issue":"4","key":"16_CR3","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1145\/3341.3349","volume":"28","author":"J.L. Bentley","year":"1985","unstructured":"Bentley, J.L., McGeoch, C.C.: Amortized Analyses of Self-Organizing Sequential Search Heuristics. Communications of the ACM, 28, 4, April 1985, 404\u2013411.","journal-title":"Communications of the ACM"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Ben-David, S., Borodin, A., Karp, R., Tardos, G., Wigderson, A.: On the Power of Randomization in Online Algorithms. Proc. 22nd Annual ACM Symposium on Theory of Computing, Baltimore, MD, May 1990, 379\u2013386.","DOI":"10.1145\/100216.100268"},{"issue":"3","key":"16_CR5","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1145\/5505.5507","volume":"17","author":"J.H. Hester","year":"1985","unstructured":"Hester, J.H., Hirschberg, D.S.: Self-Organizing Linear Search. ACM Computing Surveys, 17, 3, September 1985, 295\u2013311.","journal-title":"ACM Computing Surveys"},{"key":"16_CR6","volume-title":"Tech. Rep. TR-90-037","author":"S. Irani","year":"1990","unstructured":"Irani, S.: Two Results on the List Update Problem. Tech. Rep. TR-90-037, Computer Science Division, U.C. Berkeley, CA, August 1990."},{"key":"16_CR7","unstructured":"Irani, S., Reingold, N., Westbrook, J., Sleator, D.D.: Randomized Competitive Algorithms for the List Update Problem. Proc. 2nd ACM-SIAM annual Symp. on Disc. Algorithms, San Francisco, CA, January 1991, 251\u2013260."},{"key":"16_CR8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"A.R. Karlin","year":"1988","unstructured":"Karlin, A.R., Manasse, M.S., Rudolph, L., Sleator, D.D.: Competitive Snoopy Caching. Algorithmica, 3, 1988, 79\u2013119.","journal-title":"Algorithmica"},{"key":"16_CR9","volume-title":"Tech. Rep. TR-90-037","author":"R. Karp","year":"1990","unstructured":"Karp, R., Raghavan, P.:-Private communication reported in [6]."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Manasse, M.S., McGeoch, L.A., Sleator, D.D.: Competitive Algorithms for On-line Problems. Proc. 20th Annual ACM Symposium on Theory of Computing, Chicago, IL, May 1988, 322\u2013333.","DOI":"10.1145\/62212.62243"},{"key":"16_CR11","unstructured":"Reingold, N., Westbrook, J.: Optimum Off-line Algorithms for The List Update Problem. Tech. Rep. YALEU\/DCS\/TR-805, Department of Computer Science, Yale U., August 1990."},{"issue":"2","key":"16_CR12","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D.: Private communication reported in: Tarjan, R.E.: Amortized Computational Complexity. SIAM J. Alg. Disc. Meth., 6, 2, April 1985, 306\u2013318.","journal-title":"SIAM J. Alg. Disc. Meth."},{"issue":"2","key":"16_CR13","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized Efficiency of List Update and Paging Rules. Communications of the ACM, 28, 2, February 1985, 202\u2013208.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT '92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55706-7_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:34:38Z","timestamp":1619573678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55706-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540557067","9783540472759"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-55706-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}