{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:07:05Z","timestamp":1760044025493,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646822"},{"type":"electronic","value":"9783540691068"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":[[1998]]},"DOI":"10.1007\/bfb0054360","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T07:43:28Z","timestamp":1149666208000},"page":"119-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Simple confluently persistent catenable lists"],"prefix":"10.1007","author":[{"given":"Haim","family":"Kaplan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Okasaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert E.","family":"Tarjan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"issue":"6","key":"11_CR1","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.1137\/S0097539792242144","volume":"24","author":"A. L. Buchsbaum","year":"1995","unstructured":"A. L. Buchsbaum, R. Sundar, and R. E. Tarjan. Data structural bootstrapping, linear path compression, and catenable heap ordered double ended queues. SIAM J. Computing, 24(6):1190\u20131206, 1995.","journal-title":"SIAM J. Computing"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1006\/jagm.1995.1020","volume":"18","author":"A. L. Buchsbaum","year":"1995","unstructured":"A. L. Buchsbaum and R. E. Tarjan. Confluently persistant deques via data structural bootstrapping. J. of Algorithms, 18:513\u2013547, 1995.","journal-title":"J. of Algorithms"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"P. F. Dietz. Fully persistent arrays. In Proceedings of the 1989 Workshop on Algorithms and Data Structures (WADS'89), pages 67\u201374. Springer, 1995. LNCS 382.","DOI":"10.1007\/3-540-51542-9_8"},{"issue":"5","key":"11_CR4","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1145\/185675.185791","volume":"41","author":"J. Driscoll","year":"1994","unstructured":"J. Driscoll, D. Sleator, and R. Tarjan. Fully persistent lists with catenation. Journal of the ACM, 41(5):943\u2013959, 1994.","journal-title":"Journal of the ACM"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"J. R. Driscoll","year":"1989","unstructured":"J. R. Driscoll, N. Sarnak, D. Sleator, and R. Tarjan. Making data structures persistent. J. of Computer and System Science, 38:86\u2013124, 1989.","journal-title":"J. of Computer and System Science"},{"issue":"4","key":"11_CR6","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0020-0190(86)90028-1","volume":"12","author":"H. Gajewska","year":"1986","unstructured":"Hania Gajewska and Robert E. Tarjan. Deques with heap order. Information Processing Letters, 12(4):197\u2013200, 1986.","journal-title":"Information Processing Letters"},{"key":"11_CR7","volume-title":"PhD thesis","author":"H. Kaplan","year":"1997","unstructured":"H. Kaplan. Purely functional lists. PhD thesis, Department of Computer Science, Princeton University, Princeton, NJ 08544, 1997."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"H. Kaplan and R. E. Tarjan. Persistent lists with catenation via recursive slow-down. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing (Preliminary Version), pages 93\u2013102. ACM Press, 1995. Complete version submitted to Journal of the ACM.","DOI":"10.1145\/225058.225090"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"H. Kaplan and R. E. Tarjan. Purely functional representations of catenable sorted lists. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pages 202\u2013211. ACM Press, 1996.","DOI":"10.1145\/237814.237865"},{"key":"11_CR10","unstructured":"S. R. Kosaraju. An optimal RAM implementation of catenable min double-ended queues. In Proc. 5th ACM-SIAM Symposium on Discrete Algorithms, pages 195\u2013203, 1994."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"C. Okasaki. Amortization, lazy evaluation, and persistence: Lists with catenation via lazy linking. In Proc. 36th Symposium on Foundations of Computer Science, pages 646\u2013654. IEEE, 1995.","DOI":"10.1109\/SFCS.1995.492666"},{"issue":"4","key":"11_CR12","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1017\/S0956796800001489","volume":"5","author":"C. Okasaki","year":"1995","unstructured":"C. Okasaki. Simple and efficient purely functional queues and deques. J. Functional Progamming, 5(4):583\u2013592, 1995.","journal-title":"J. Functional Progamming"},{"key":"11_CR13","volume-title":"PhD thesis","author":"C. Okasaki","year":"1996","unstructured":"C. Okasaki. Purely functional data structures. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, 1996."},{"issue":"2","key":"11_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. Algebraic Discrete Methods, 6(2):306\u2013318, 1985.","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'98"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054360","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T07:20:04Z","timestamp":1736407204000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0054360"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646822","9783540691068"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0054360","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"26 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}