{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:07Z","timestamp":1725558967309},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141645"},{"type":"electronic","value":"9783642141652"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14165-2_15","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T13:26:02Z","timestamp":1278336362000},"page":"164-175","source":"Crossref","is-referenced-by-count":5,"title":["Mergeable Dictionaries"],"prefix":"10.1007","author":[{"given":"John","family":"Iacono","sequence":"first","affiliation":[]},{"given":"\u00d6zg\u00fcr","family":"\u00d6zkan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s00453-004-1138-6","volume":"42","author":"A. Bagchi","year":"2005","unstructured":"Bagchi, A., Buchsbaum, A.L., Goodrich, M.T.: Biased skip lists. Algorithmica\u00a042(1), 31\u201348 (2005)","journal-title":"Algorithmica"},{"issue":"2","key":"15_CR2","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1145\/322123.322127","volume":"26","author":"M.R. Brown","year":"1979","unstructured":"Brown, M.R., Tarjan, R.E.: A fast merging algorithm. J. ACM\u00a026(2), 211\u2013226 (1979)","journal-title":"J. ACM"},{"key":"15_CR3","unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A., Munro, J.I.: Adaptive set intersections, unions, and differences. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 743\u2013752 (2000)"},{"issue":"4","key":"15_CR4","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/PL00009202","volume":"20","author":"M. Farach","year":"1998","unstructured":"Farach, M., Thorup, M.: String matching in lempel-ziv compressed strings. Algorithmica\u00a020(4), 388\u2013404 (1998)","journal-title":"Algorithmica"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Georgiadis, L., Kaplan, H., Shafrir, N., Tarjan, R.E., Werneck, R.F.F.: Data structures for mergeable trees. In: CoRR, abs\/0711.1682 (2007)","DOI":"10.1145\/1109557.1109602"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/1109557.1109602","volume-title":"Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"L. Georgiadis","year":"2006","unstructured":"Georgiadis, L., Tarjan, R.E., Werneck, R.F.F.: Design of data structures for mergeable trees. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 394\u2013403. ACM Press, New York (2006)"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Iacono, J., \u00d6zkan, \u00d6.: Mergeable Dictionaries. In: CoRR, abs\/1002.4248 (2010)","DOI":"10.1007\/978-3-642-14165-2_15"},{"key":"15_CR8","unstructured":"Lai, K.J.: Complexity of union-split-find problems. Master\u2019s thesis, Massachusetts Institute of Technology, Erik Demaine, Adviser (2008)"},{"issue":"6","key":"15_CR9","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W. Pugh","year":"1990","unstructured":"Pugh, W.: Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM\u00a033(6), 668\u2013676 (1990)","journal-title":"Communications of the ACM"},{"issue":"2","key":"15_CR10","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R.E. Tarjan","year":"1985","unstructured":"Tarjan, R.E.: Amortized computational complexity. SIAM Journal on Algebraic Discrete Methods\u00a06(2), 306\u2013318 (1985)","journal-title":"SIAM Journal on Algebraic Discrete Methods"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14165-2_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:48:14Z","timestamp":1606186094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}