{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T17:48:52Z","timestamp":1778694532889,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540744559","type":"print"},{"value":"9783540744566","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_61","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"691-702","source":"Crossref","is-referenced-by-count":3,"title":["Online and Offline Access to Short Lists"],"prefix":"10.1007","author":[{"given":"Torben","family":"Hagerup","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"61_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0020-0190(95)00142-Y","volume":"56","author":"S. Albers","year":"1995","unstructured":"Albers, S., von Stengel, B., Werchner, R.: A combined BIT and TIMESTAMP algorithm for the list update problem. Inform. Process. Lett.\u00a056, 135\u2013139 (1995)","journal-title":"Inform. Process. Lett."},{"key":"61_CR2","unstructured":"Albers, S., von Stengel, B., Werchner, R.: List update posets, Manuscript (1996)"},{"key":"61_CR3","first-page":"404","volume":"28","author":"J.L. Bentley","year":"1985","unstructured":"Bentley, J.L., McGeoch, C.C.: Amortized analyses of self-organizing sequential search heuristics. Comm. Assoc. Comput. Mach.\u00a028, 404\u2013411 (1985)","journal-title":"Comm. Assoc. Comput. Mach."},{"key":"61_CR4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1090\/dimacs\/007\/02","volume":"7","author":"M. Chrobak","year":"1992","unstructured":"Chrobak, M., Larmore, L.L.: The server problem and on-line games. DIMACS Series in Disc. Math. and Theoret. Comput. Sci.\u00a07, 11\u201364 (1992)","journal-title":"DIMACS Series in Disc. Math. and Theoret. Comput. Sci."},{"key":"61_CR5","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0020-0190(91)90086-W","volume":"38","author":"S. Irani","year":"1991","unstructured":"Irani, S.: Two results on the list update problem. Inform. Process. Lett.\u00a038, 301\u2013306 (1991)","journal-title":"Inform. Process. Lett."},{"key":"61_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0020-0190(96)00144-5","volume":"60","author":"N. Reingold","year":"1996","unstructured":"Reingold, N., Westbrook, J.: Off-line algorithms for the list update problem. Inform. Process. Lett.\u00a060, 75\u201380 (1996)","journal-title":"Inform. Process. Lett."},{"key":"61_CR7","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF01294261","volume":"11","author":"N. Reingold","year":"1994","unstructured":"Reingold, N., Westbrook, J., Sleator, D.D.: Randomized competitive algorithms for the list update problem. Algorithmica\u00a011, 15\u201332 (1994)","journal-title":"Algorithmica"},{"key":"61_CR8","first-page":"202","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Comm. Assoc. Comput. Mach.\u00a028, 202\u2013208 (1985)","journal-title":"Comm. Assoc. Comput. Mach."},{"key":"61_CR9","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0020-0190(93)90150-8","volume":"47","author":"B. Teia","year":"1993","unstructured":"Teia, B.: A lower bound for randomized list update algorithms. Inform. Process. Lett.\u00a047, 5\u20139 (1993)","journal-title":"Inform. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:29:34Z","timestamp":1619519374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}