{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T16:29:38Z","timestamp":1781195378538,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540441809","type":"print"},{"value":"9783540457497","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45749-6_17","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T15:42:44Z","timestamp":1183563764000},"page":"152-164","source":"Crossref","is-referenced-by-count":63,"title":["Two Simplified Algorithms for Maintaining Order in a List"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bender","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard","family":"Cole","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Farach-Colton","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jack","family":"Zito","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1006\/jagm.1998.0951","volume":"29","author":"A. Andersson","year":"1998","unstructured":"A. Andersson and O. Petersson. Approximate indexed lists. Journal of Algorithms, 29(2):256\u2013276, 1998.","journal-title":"Journal of Algorithms"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"L. Arge and J. Vitter. Optimal dynamic interval management in external memory. In FOCS, 1996.","DOI":"10.1109\/SFCS.1996.548515"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"P. Dietz and D. Sleator. Two algorithms for maintaining order in a list. In STOC, 1987.","DOI":"10.1145\/28395.28434"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"P. F. Dietz. Maintaining order in a linked list. In STOC, 1982.","DOI":"10.1145\/800070.802184"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"P. F. Dietz, J. I. Seiferas, and J. Zhang. A tight lower bound for on-line monotonic list labeling. In SWAT, 1994.","DOI":"10.1007\/3-540-58218-5_12"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"P. F. Dietz and J. Zhang. Lower bounds for monotonic list labeling. In SWAT, 1990.","DOI":"10.1007\/3-540-52846-6_87"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"A. Itai, A. Konheim, and M. Rodeh. A sparse table implementation of priority queues. In ICALP, 1981.","DOI":"10.1007\/3-540-10843-2_34"},{"key":"17_CR8","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0202005","volume":"2","author":"J. Nievergelt","year":"1973","unstructured":"J. Nievergelt and E.M. Reingold. Binary search trees of bounded balance. SIComp, 2:33\u201343, 1973.","journal-title":"SIComp"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"W. Pugh. Skip lists: a probabilistic alternative to balanced trees. In WADS, 1989.","DOI":"10.1007\/3-540-51542-9_36"},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF00289142","volume":"21","author":"A.K. Tsakalidis","year":"1984","unstructured":"A.K. Tsakalidis. Maintaining order in a generalized linked list. Acta Informatica, 21(1):101\u2013112, May 1984.","journal-title":"Acta Informatica"},{"key":"17_CR11","unstructured":"D. Willard. Inserting and deleting records in blocked sequential files. Technical Report TM81-45193-5, Bell Laboratories, 1981."},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"D. Willard. Maintaining dense sequential files in a dynamic environment. In STOC, 1982.","DOI":"10.1145\/800070.802183"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"D. Willard. Good worst-case algorithms for inserting and deleting records in dense sequential files. In SIGMOD, 1986.","DOI":"10.1145\/16894.16879"},{"issue":"2","key":"17_CR14","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0890-5401(92)90034-D","volume":"97","author":"D. Willard","year":"1992","unstructured":"D. Willard. A density control algorithm for doing insertions and deletions in a sequentially ordered file in good worst-case time. Information and Computation, 97(2):150\u2013204, 1992.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45749-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T03:06:07Z","timestamp":1556593567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45749-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441809","9783540457497"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45749-6_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}