{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:00:01Z","timestamp":1740142801573,"version":"3.37.3"},"reference-count":18,"publisher":"Oxford University Press (OUP)","issue":"8","funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP130100237"],"award-info":[{"award-number":["DP130100237"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1093\/comjnl\/bxw018","type":"journal-article","created":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T14:23:14Z","timestamp":1467210194000},"page":"1252-1263","source":"Crossref","is-referenced-by-count":0,"title":["Complete Balancing via Rotation"],"prefix":"10.1093","volume":"59","author":[{"given":"Fabrizio","family":"Luccio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Mans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luke","family":"Mathieson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linda","family":"Pagli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2016,6,28]]},"reference":[{"key":"2016083005472005000_59.8.1252.1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90083-7"},{"key":"2016083005472005000_59.8.1252.2","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-1988-0928904-4"},{"key":"2016083005472005000_59.8.1252.3","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2014.02.035"},{"key":"2016083005472005000_59.8.1252.4","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90153-6"},{"key":"2016083005472005000_59.8.1252.5","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90069-0"},{"key":"2016083005472005000_59.8.1252.6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.07.001"},{"key":"2016083005472005000_59.8.1252.7","doi-asserted-by":"publisher","DOI":"10.1080\/00207160500069870"},{"key":"2016083005472005000_59.8.1252.8","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00212"},{"key":"2016083005472005000_59.8.1252.9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.04.022"},{"key":"2016083005472005000_59.8.1252.10","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00008-9"},{"key":"2016083005472005000_59.8.1252.11","first-page":"77","article-title":"On finding shortest paths in the rotation graph of binary trees","volume":"197","author":"Rogers","year":"1999","journal-title":"Congr. Numer."},{"key":"2016083005472005000_59.8.1252.12","doi-asserted-by":"crossref","unstructured":"Andersson, A. (1989) Improving partial rebuilding by using simple balance criteria. Workshop on Algorithms and Data Structures (WADS) \u201889, Ottawa, Canada, 17\u201319 August, pp. 393\u2013402. Springer, New York.","DOI":"10.1007\/3-540-51542-9_33"},{"key":"2016083005472005000_59.8.1252.13","unstructured":"Galperin, I. and Rivest, R.L. (1993) Scapegoat trees. Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, Texas, 25\u201327 January, pp. 165\u2013174. SIAM, Philadelphia, PA."},{"key":"2016083005472005000_59.8.1252.14","doi-asserted-by":"crossref","unstructured":"Andersson, A. (2004) Balanced binary search trees. In Mehta, D. P. and Sahni, S. (eds), Handbook of Data Structures and Applications, chapter 10. CRC Press, Cleveland, OH.","DOI":"10.1201\/9781420035179.ch10"},{"key":"2016083005472005000_59.8.1252.15","doi-asserted-by":"publisher","DOI":"10.1145\/6592.6599"},{"key":"2016083005472005000_59.8.1252.16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.07.025"},{"key":"2016083005472005000_59.8.1252.17","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2009.09.016"},{"key":"2016083005472005000_59.8.1252.18","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/47.2.259"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/59\/8\/1252\/8039732\/bxw018.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,24]],"date-time":"2017-08-24T21:10:28Z","timestamp":1503609028000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxw018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,28]]},"references-count":18,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2016,8,30]]},"published-print":{"date-parts":[[2016,8]]}},"alternative-id":["10.1093\/comjnl\/bxw018"],"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxw018","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published":{"date-parts":[[2016,6,28]]}}}