{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T14:15:06Z","timestamp":1790518506035,"version":"4.1.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030046927","type":"print"},{"value":"9783030046934","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04693-4_19","type":"book-chapter","created":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T00:03:12Z","timestamp":1543363392000},"page":"310-326","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["The Itinerant List Update Problem"],"prefix":"10.1007","author":[{"given":"Neil","family":"Olver","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kirk","family":"Pruhs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kevin","family":"Schewior","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ren\u00e9","family":"Sitters","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leen","family":"Stougie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,11,29]]},"reference":[{"issue":"3","key":"19_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. Inf. Process. Lett. 56(3), 135\u2013139 (1995)","journal-title":"Inf. Process. Lett."},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0029563","volume-title":"Online Algorithms","author":"S Albers","year":"1998","unstructured":"Albers, S., Westbrook, J.: Self-organizing data structures. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms. LNCS, vol. 1442, pp. 13\u201351. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0029563"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/3-540-45253-2_5","volume-title":"Algorithms - ESA 2000","author":"C Amb\u00fchl","year":"2000","unstructured":"Amb\u00fchl, C.: Offline list update is NP-hard. In: Paterson, M.S. (ed.) ESA 2000. LNCS, vol. 1879, pp. 42\u201351. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45253-2_5"},{"issue":"3","key":"19_CR4","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/3138860.3138871","volume":"48","author":"C Amb\u00fchl","year":"2017","unstructured":"Amb\u00fchl, C.: SIGACT news online algorithms column 31. SIGACT News 48(3), 68\u201382 (2017)","journal-title":"SIGACT News"},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"5:1","DOI":"10.1145\/1502793.1502794","volume":"56","author":"S Arora","year":"2009","unstructured":"Arora, S., Rao, S., Vazirani, U.V.: Expander flows, geometric embeddings and graph partitioning. J. ACM 56(2), 5:1\u20135:37 (2009)","journal-title":"J. ACM"},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/581888.581891","volume":"1","author":"O Avissar","year":"2002","unstructured":"Avissar, O., Rajeev, R.B., Stewart, D.: An optimal memory allocation scheme for scratch-pad-based embedded systems. ACM Trans. Embed. Comput. Syst. 1(1), 6\u201326 (2002)","journal-title":"ACM Trans. Embed. Comput. Syst."},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Banakar, R., Steinke, S., Lee, B.S., Balakrishnan, M., Marwedel, P.: Scratchpad memory: design alternative for cache on-chip memory in embedded systems. In: Symposium on Hardware\/Software Codesign, pp. 73\u201378. ACM, New York (2002)","DOI":"10.1145\/774801.774805"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Borodin, A., El-Yaniv, R.: On randomization in online computation. In: IEEE Conference on Computational Complexity (CCC), pp. 226\u2013238 (1997)","DOI":"10.1109\/CCC.1997.612318"},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ipl.2006.07.009","volume":"101","author":"U Feige","year":"2007","unstructured":"Feige, U., Lee, J.R.: An improved approximation ratio for the minimum linear arrangement problem. Inf. Process. Lett. 101(1), 26\u201329 (2007)","journal-title":"Inf. Process. Lett."},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Gu, S., Sha, E., Zhuge, Q., Chen, Y., Hu, J.: Area and performance co-optimization for domain wall memory in application-specific embedded systems. In: Proceedings of the 52nd Annual Design Automation Conference, pp. 20:1\u201320:6. ACM, New York (2015)","DOI":"10.1145\/2744769.2744800"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Hansen, M.D.: Approximation algorithms for geometric embeddings in the plane with applications to parallel processing problems. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 604\u2013609 (1989)","DOI":"10.1109\/SFCS.1989.63542"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-40273-9_17","volume-title":"Space-Efficient Data Structures, Streams, and Algorithms","author":"S Kamali","year":"2013","unstructured":"Kamali, S., L\u00f3pez-Ortiz, A.: A survey of algorithms and models for list update. In: Brodnik, A., L\u00f3pez-Ortiz, A., Raman, V., Viola, A. (eds.) Space-Efficient Data Structures, Streams, and Algorithms. LNCS, vol. 8066, pp. 251\u2013266. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40273-9_17"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Kandemir, M., Ramanujam, J., Choudhary, A.: Exploiting shared scratch pad memory space in embedded multiprocessor systems. In: Design Automation Conference, pp. 219\u2013224 (2002)","DOI":"10.1145\/513918.513974"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Kandemir, M., Ramanujam, J., Irwin, J., Vijaykrishnan, N., Kadayif, I., Parikh, A.: Dynamic management of scratch-pad memory space. In: Proceedings of the 38th Annual Design Automation Conference, pp. 690\u2013695 (2001)","DOI":"10.1145\/378239.379049"},{"issue":"6","key":"19_CR15","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"FT Leighton","year":"1999","unstructured":"Leighton, F.T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46(6), 787\u2013832 (1999)","journal-title":"J. ACM"},{"key":"19_CR16","unstructured":"Panda, P.R., Dutt, N.D., Nicolau, A.: Efficient utilization of scratch-pad memory in embedded processor applications. In: European Design and Test Conference (1997)"},{"issue":"2","key":"19_CR17","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1137\/S0097539702413197","volume":"34","author":"S Rao","year":"2004","unstructured":"Rao, S., Richa, A.W.: New approximation techniques for some linear ordering problems. SIAM J. Comput. 34(2), 388\u2013404 (2004)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"19_CR18","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. Inf. Process. Lett. 60(2), 75\u201380 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"19_CR19","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D Sleator","year":"1985","unstructured":"Sleator, D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. CACM 28(2), 202\u2013208 (1985)","journal-title":"CACM"},{"key":"19_CR20","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. Inf. Process. Lett. 47, 5\u20139 (1993)","journal-title":"Inf. Process. Lett."},{"key":"19_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, Cambridge (2011)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04693-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:24:57Z","timestamp":1775283897000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04693-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046927","9783030046934"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04693-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Helsinki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2018.hiit.fi\/waoa\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}