{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T03:59:50Z","timestamp":1754193590669},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0196-6774(03)00044-0","type":"journal-article","created":{"date-parts":[[2003,7,16]],"date-time":"2003-07-16T11:02:03Z","timestamp":1058353323000},"page":"16-58","source":"Crossref","is-referenced-by-count":12,"title":["Making data structures confluently persistent"],"prefix":"10.1016","volume":"48","author":[{"given":"Amos","family":"Fiat","sequence":"first","affiliation":[]},{"given":"Haim","family":"Kaplan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0196-6774(03)00044-0_BIB001","series-title":"Proc. 10th European Symposium on Algorithms (ESA)","article-title":"Two simplified algorithms for maintaining order in a list","author":"Bender","year":"2002"},{"issue":"3","key":"10.1016\/S0196-6774(03)00044-0_BIB002","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1137\/0214041","article-title":"Biased search trees","volume":"14","author":"Bent","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0196-6774(03)00044-0_BIB003","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1006\/jagm.1995.1020","article-title":"Confluently persistant deques via data structural bootstrapping","volume":"18","author":"Buchsbaum","year":"1995","journal-title":"J. Algorithms"},{"key":"10.1016\/S0196-6774(03)00044-0_BIB004","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0019-9958(85)80045-0","article-title":"How to search in history","volume":"64","author":"Chazelle","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/S0196-6774(03)00044-0_BIB005","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0196-6774(86)90004-0","article-title":"Searching and storing similar lists","volume":"7","author":"Cole","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/S0196-6774(03)00044-0_BIB006","series-title":"Proc. 1989 Workshop on Algorithms and Data Structures (WADS'89)","first-page":"67","article-title":"Fully persistent arrays","volume":"382","author":"Dietz","year":"1995"},{"key":"10.1016\/S0196-6774(03)00044-0_BIB007","series-title":"Proc. 19th Annual ACM Symposium on Theory of Computing","first-page":"365","article-title":"Two algorithms for maintaining order in a list","author":"Dietz","year":"1987"},{"key":"10.1016\/S0196-6774(03)00044-0_BIB008","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1137\/S0097539791194094","article-title":"Dynamic perfect hashing: upper and lower bounds","volume":"23","author":"Dietzfelbinger","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0196-6774(03)00044-0_BIB009","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/0196-6774(85)90027-6","article-title":"Efficient uses of the past","volume":"6","author":"Dobkin","year":"1985","journal-title":"J. Algorithms"},{"issue":"5","key":"10.1016\/S0196-6774(03)00044-0_BIB010","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1145\/185675.185791","article-title":"Fully persistent lists with catenation","volume":"41","author":"Driscoll","year":"1994","journal-title":"J. ACM"},{"key":"10.1016\/S0196-6774(03)00044-0_BIB011","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","article-title":"Making data structures persistent","volume":"38","author":"Driscoll","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0196-6774(03)00044-0_BIB012","series-title":"Proc. 19th Annual Symposium on Foundations of Computer Science","article-title":"A diochromatic framework for balanced trees","author":"Guibas","year":"1978"},{"issue":"3","key":"10.1016\/S0196-6774(03)00044-0_BIB013","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1137\/S0097539798339430","article-title":"Simple confluently persistent catenable lists (extended abstract)","volume":"30","author":"Kaplan","year":"2000","journal-title":"SIAM J. Comput."},{"issue":"5","key":"10.1016\/S0196-6774(03)00044-0_BIB014","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1145\/324133.324139","article-title":"Purely functional, real-time deques with catenation","volume":"46","author":"Kaplan","year":"1999","journal-title":"JACM"},{"key":"10.1016\/S0196-6774(03)00044-0_BIB015","series-title":"Proc. 36th Symposium on Foundations of Computer Science","first-page":"646","article-title":"Amortization, lazy evaluation, and persistence: Lists with catenation via lazy linking","author":"Okasaki","year":"1995"},{"key":"10.1016\/S0196-6774(03)00044-0_BIB016","unstructured":"C. Okasaki, Purely functional data structures, PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, 1996"},{"key":"10.1016\/S0196-6774(03)00044-0_BIB017","series-title":"Proc. of the International Conference on Functional Programming","first-page":"62","article-title":"The role of lazy evaluation in amortized data structures","author":"Okasaki","year":"1996"},{"key":"10.1016\/S0196-6774(03)00044-0_BIB018","unstructured":"M.H. Overmars, Searching in the past, Parts I and II. Technical Reports RUU-CS-81-7 and RUU-CS-81-9, Department of Computer Science, University of Utrecht, Utrecht, The Netherlands, 1981"},{"key":"10.1016\/S0196-6774(03)00044-0_BIB019","unstructured":"N. Sarnak, Persistent data structures, PhD thesis, Department of Computer Science, New York University, 1986"},{"issue":"7","key":"10.1016\/S0196-6774(03)00044-0_BIB020","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1145\/6138.6151","article-title":"Planar point location using persistent search trees","volume":"29","author":"Sarnak","year":"1986","journal-title":"Comm. ACM"},{"key":"10.1016\/S0196-6774(03)00044-0_BIB021","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1145\/3828.3835","article-title":"Self-adjusting binary search trees","volume":"32","author":"Sleator","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0196-6774(03)00044-0_BIB022","article-title":"Data Structures and Network Algorithms","volume":"44","author":"Tarjan","year":"1983"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677403000440?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677403000440?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T09:26:04Z","timestamp":1552814764000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196677403000440"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0196677403000440"],"URL":"https:\/\/doi.org\/10.1016\/s0196-6774(03)00044-0","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}