{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T05:47:28Z","timestamp":1784180848993,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540388753","type":"print"},{"value":"9783540388760","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_18","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T13:20:54Z","timestamp":1157980854000},"page":"172-183","source":"Crossref","is-referenced-by-count":2,"title":["Purely Functional Worst Case Constant Time Catenable Sorted Lists"],"prefix":"10.1007","author":[{"given":"Gerth St\u00f8lting","family":"Brodal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christos","family":"Makris","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kostas","family":"Tsichlas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/0214041","volume":"14","author":"S. Bent","year":"1985","unstructured":"Bent, S., Sleator, D., Tarjan, R.: Biased Search Trees. SIAM Journal of Computing\u00a014, 545\u2013568 (1985)","journal-title":"SIAM Journal of Computing"},{"issue":"3","key":"18_CR2","first-page":"238","volume":"3","author":"G.S. Brodal","year":"1996","unstructured":"Brodal, G.S.: Partially Persistent Data Structures of Bounded Degree with Constant Update Time. Nordic Journal of Computing\u00a03(3), 238\u2013255 (1996)","journal-title":"Nordic Journal of Computing"},{"issue":"6","key":"18_CR3","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1017\/S095679680000201X","volume":"6","author":"G.S. Brodal","year":"1996","unstructured":"Brodal, G.S., Okasaki, C.: Optimal Purely Functional Priority Queues. Journal of Functional Programming\u00a06(6), 839\u2013857 (1996)","journal-title":"Journal of Functional Programming"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1006\/jagm.1995.1020","volume":"18","author":"A. Buchsbaum","year":"1995","unstructured":"Buchsbaum, A., Tarjan, R.E.: Confluently persistent deques via data structural bootstrapping. Journal of Algorithms\u00a018, 513\u2013547 (1995)","journal-title":"Journal of Algorithms"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/3-540-51542-9_8","volume-title":"Algorithms and Data Structures","author":"P.F. Dietz","year":"1989","unstructured":"Dietz, P.F.: Fully Persistent Arrays. In: Dehne, F., Santoro, N., Sack, J.-R. (eds.) WADS 1989. LNCS, vol.\u00a0382, pp. 67\u201374. Springer, Heidelberg (1989)"},{"key":"18_CR6","unstructured":"Dietz, P., Raman, R.: Persistence. Amortization and Randomization. In: Proc. of the 2nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 78\u201388 (1991)"},{"issue":"1","key":"18_CR7","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"J.R. Driscoll","year":"1989","unstructured":"Driscoll, J.R., Sarnak, N., Sleator, D., Tarjan, R.E.: Making Data Structures Persistent. Journal of Computer and System Sciences\u00a038(1), 86\u2013124 (1989)","journal-title":"Journal of Computer and System Sciences"},{"issue":"5","key":"18_CR8","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1145\/185675.185791","volume":"41","author":"J.R. Driscoll","year":"1994","unstructured":"Driscoll, J.R., Sleator, D., Tarjan, R.E.: Fully Persistent Lists with Catenation. Journal of the ACM\u00a041(5), 943\u2013959 (1994)","journal-title":"Journal of the ACM"},{"issue":"1","key":"18_CR9","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/S0196-6774(03)00044-0","volume":"48","author":"A. Fiat","year":"2003","unstructured":"Fiat, A., Kaplan, H.: Making Data Structures Confluently Persistent. Journal of Algorithms\u00a048(1), 16\u201358 (2003)","journal-title":"Journal of Algorithms"},{"key":"18_CR10","volume-title":"Handbook of Data Structures","author":"H. Kaplan","year":"2004","unstructured":"Kaplan, H.: Persistent Data Structures. In: Mehta, D., Sahni, S. (eds.) Handbook of Data Structures. CRC Press, Boca Raton (2004)"},{"issue":"3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1137\/S0097539798339430","volume":"30","author":"H. Kaplan","year":"2000","unstructured":"Kaplan, H., Okasaki, C., Tarjan, R.E.: Simple Confluently Persistent Catenable Lists. SIAM Journal of Computing\u00a030(3), 965\u2013977 (2000)","journal-title":"SIAM Journal of Computing"},{"issue":"5","key":"18_CR12","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1145\/324133.324139","volume":"46","author":"H. Kaplan","year":"1999","unstructured":"Kaplan, H., Tarjan, R.E.: Purely Functional, Real-Time Deques with Catenation. Journal of the ACM\u00a046(5), 577\u2013603 (1999)","journal-title":"Journal of the ACM"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Tarjan, R.E.: Purely Functional Representations of Catenable Sorted Lists. In: Proc. of the 28th Annual ACM Symposium on Theory of Computing (STOC), pp. 202\u2013211 (1996)","DOI":"10.1145\/237814.237865"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Tarjan, R.E.: Persistent Lists with Catenation via Recursive Slow-down. In: Proc. of the 27th Annual ACM Symposium on Theory of Computing, pp. 93\u2013102 (1995)","DOI":"10.1145\/225058.225090"},{"key":"18_CR15","volume-title":"EATCS Monographs on Theoretical Computer Science","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn, K.: Data Structures and Algorithms 1: Sorting and Searching. In: EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1984)"},{"key":"18_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511530104","volume-title":"Purely Functional Data Structures","author":"C. Okasaki","year":"1998","unstructured":"Okasaki, C.: Purely Functional Data Structures. Cambridge University Press, Cambridge (1998)"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Okasaki, C.: Purely Functional Random-Access Lists. In: Conf. on Functional Programming Languages and Computer Architecture (FPCA), pp. 86\u201395 (1995)","DOI":"10.1145\/224164.224187"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:16:49Z","timestamp":1619507809000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11841036_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}