{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:48Z","timestamp":1725456048859},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540543430"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0028266","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T05:52:14Z","timestamp":1132638734000},"page":"240-248","source":"Crossref","is-referenced-by-count":1,"title":["Competitive algorithms for the weighted list update problem"],"prefix":"10.1007","author":[{"given":"Fabrizio","family":"d'Amore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Marchetti-Spaccamela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Umberto","family":"Nanni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"23_CR1","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1145\/3341.3349","volume":"28","author":"J. L. Bentley","year":"1985","unstructured":"J. L. Bentley, and C. McGeogh, Amortized Analyses of Self-Organizing Sequential Search Heuristics, Communications of the ACM 28, 4 (April 1985), 404\u2013411.","journal-title":"Communications of the ACM"},{"issue":"1","key":"23_CR2","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1137\/0208007","volume":"8","author":"J. R. Bitner","year":"1979","unstructured":"J. R. Bitner, Heuristics that Dynamically Organize Data Structures, SIAM J. of Computing 8, 1 (February 1979), 82\u2013110.","journal-title":"SIAM J. of Computing"},{"key":"23_CR3","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, in Proceedings of the 20th ACM Annual Symposium on Theory of Computing, May 1990, 379\u2013386.","DOI":"10.1145\/100216.100268"},{"key":"23_CR4","unstructured":"F. d'Amore, U. Nanni, and A. Marchetti-Spaccamela, Robust Algorithms for Diagnosis, Technical Report, Dipartimento di Informatica e Sistemistica, Univ. of Roma \u201cLa Sapienza\u201d, 1991."},{"key":"23_CR5","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1145\/322276.322285","volume":"28","author":"S. Gnesi","year":"1981","unstructured":"S. Gnesi, U. Montanari, and A. Martelli, Dynamic programming as graph searching: An algebraic approach, Journal of ACM 28, (1981), 737\u2013751.","journal-title":"Journal of ACM"},{"issue":"3","key":"23_CR6","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1145\/5505.5507","volume":"17","author":"J. H. Hester","year":"1985","unstructured":"J. H. Hester, and D. S. Hirschberg, Self-Organizing Linear Search, ACM Computing Surveys 17, 3 (September 1985), 295\u2013311.","journal-title":"ACM Computing Surveys"},{"key":"23_CR7","unstructured":"S. Irani, N. Reingold, J. Westbrook, and D. D. Sleator, Randomized Competitive Algorithms for the List Update Problem, in Proceedings of the 2nd ACM-SIAM Annual Symposium on Discrete Algorithms, San Francisco, CA, January 1991, 251\u2013260."},{"key":"23_CR8","series-title":"Technical Report","volume-title":"Two Results on the List Update Problem","author":"S. Irani","year":"1990","unstructured":"S. Irani, Two Results on the List Update Problem, Technical Report TR-90-037, Computer Science Division, U.C. Berkeley, California, August 1990."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"M. S. Manasse, L. A. McGeoch, and D. D. Sleator, Competitive Algorithms for Online Problems, in Proceedings of the 18th ACM Annual Symposium on Theory of Computing, May 1988, 322\u2013333.","DOI":"10.1145\/62212.62243"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"N. J. Nilsson, Principles of Artificial Intelligence, Springer Verlag, (1982).","DOI":"10.1007\/978-3-662-09438-9"},{"key":"23_CR11","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0004-3702(87)90062-2","volume":"32","author":"R. Reiter","year":"1987","unstructured":"R. Reiter, A Theory of Diagnosis from First Principles, Artificial Intelligence 32, (1987), 57\u201395.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"23_CR12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/359997.360000","volume":"19","author":"R. Rivest","year":"1976","unstructured":"R. Rivest, On Self-Organizing Sequential Search Heuristics, Communications of the ACM 19, 2 (February 1976), 63\u201367.","journal-title":"Communications of the ACM"},{"key":"23_CR13","doi-asserted-by":"crossref","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, 2 (February 1985), 202\u2013208.","journal-title":"Communications of the ACM"},{"issue":"2","key":"23_CR14","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R. E. Tarjan","year":"1985","unstructured":"R. E. Tarjan, Amortized Computational Complexity, SIAM J. Alg. Disc. Meth. 6, 2 (April 1985), 306\u2013318.","journal-title":"SIAM J. Alg. Disc. Meth."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028266.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:58:38Z","timestamp":1607551118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028266"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540543430"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0028266","relation":{},"subject":[]}}