{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:21:57Z","timestamp":1725740517504},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401039"},{"type":"electronic","value":"9783642401046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40104-6_25","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T05:36:30Z","timestamp":1373520990000},"page":"280-290","source":"Crossref","is-referenced-by-count":0,"title":["Blame Trees"],"prefix":"10.1007","author":[{"given":"Erik D.","family":"Demaine","sequence":"first","affiliation":[]},{"given":"Pavel","family":"Panchekha","sequence":"additional","affiliation":[]},{"given":"David A.","family":"Wilson","sequence":"additional","affiliation":[]},{"given":"Edward Z.","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/3-540-45749-6_17","volume-title":"Algorithms - ESA 2002","author":"M.A. Bender","year":"2002","unstructured":"Bender, M.A., Cole, R., Demaine, E.D., Farach-Colton, M., Zito, J.: Two simplified algorithms for maintaining order in a list. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 152\u2013164. Springer, Heidelberg (2002)"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/BF01190160","volume":"9","author":"S. Carlsson","year":"1993","unstructured":"Carlsson, S., Levcopoulos, C., Petersson, O.: Sublinear merging and natural mergesort. Algorithmica\u00a09, 629\u2013648 (1993)","journal-title":"Algorithmica"},{"unstructured":"Cohen, B.: Git can\u2019t be made consistent (April 2011), \n                  \n                    http:\/\/bramcohen.livejournal.com\/74462.html","key":"25_CR3"},{"issue":"3","key":"25_CR4","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/s00453-008-9274-z","volume":"57","author":"E.D. Demaine","year":"2010","unstructured":"Demaine, E.D., Langerman, S., Price, E.: Confluently persistent tries for efficient version control. Algorithmica\u00a057(3), 462\u2013483 (2010)","journal-title":"Algorithmica"},{"unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A., Munro, J.I.: Adaptive set intersections, unions, and differences. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, pp. 743\u2013752 (January 2000)","key":"25_CR5"},{"doi-asserted-by":"crossref","unstructured":"Dietz, P.F., Sleator, D.D.: Two algorithms for maintaining order in a list. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, New York City, pp. 365\u2013372 (May 1987)","key":"25_CR6","DOI":"10.1145\/28395.28434"},{"issue":"1","key":"25_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.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"},{"unstructured":"Fiat, A., Kaplan, H.: Making data structures confluently persistent. In: Proceedings of the 12th Annual Symposium on Discrete Algorithms, Washington, DC, pp. 537\u2013546 (January 2001)","key":"25_CR8"},{"unstructured":"Hudson, G.: Notes on keeping version histories of files (October 2002), \n                  \n                    http:\/\/web.mit.edu\/ghudson\/thoughts\/file-versioning","key":"25_CR9"},{"doi-asserted-by":"crossref","unstructured":"Mehlhorn, K.: Data Structures and Algorithms. Sorting and Searching, vol.\u00a01, pp. 240\u2013241. Springer (1984)","key":"25_CR10","DOI":"10.1007\/978-3-642-69672-5_2"},{"issue":"9","key":"25_CR11","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1007\/s002360050142","volume":"35","author":"A. Moffat","year":"1998","unstructured":"Moffat, A., Petersson, O., Wormald, N.C.: A tree-based Mergesort. Acta Informatica\u00a035(9), 775\u2013793 (1998)","journal-title":"Acta Informatica"},{"key":"25_CR12","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, New York (1998)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40104-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T18:44:50Z","timestamp":1557945890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40104-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401039","9783642401046"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40104-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}