{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:08Z","timestamp":1725663308686},"publisher-location":"Berlin, Heidelberg","reference-count":3,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515425"},{"type":"electronic","value":"9783540482376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51542-9_37","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:07:26Z","timestamp":1330204046000},"page":"450-459","source":"Crossref","is-referenced-by-count":0,"title":["A fast algorithm for melding splay trees"],"prefix":"10.1007","author":[{"given":"Graeme","family":"Port","sequence":"first","affiliation":[]},{"given":"Alistair","family":"Moffat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D. D. Sleator","year":"1985","unstructured":"Sleator D.D. & R.E. Tarjan, Self-adjusting binary search trees, J. ACM, 32 (1985), 652\u2013686.","journal-title":"J. ACM"},{"key":"37_CR2","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R. E. Tarjan","year":"1985","unstructured":"Tarjan R.E., Amortised computational complexity, SIAM J. Alg. Disc. Meth., 6 (1985), 306\u2013318.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"37_CR3","series-title":"Technical Report","volume-title":"Efficient algorithms for implementing set operations using splay trees","author":"G. Port","year":"1989","unstructured":"Port G. & A. Moffat, Efficient algorithms for implementing set operations using splay trees, Technical Report 89\/8, Department of Computer Science, University of Melbourne, Australia, February 1989."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51542-9_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:04:38Z","timestamp":1619571878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51542-9_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515425","9783540482376"],"references-count":3,"URL":"https:\/\/doi.org\/10.1007\/3-540-51542-9_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}