{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:52:12Z","timestamp":1754484732256},"reference-count":14,"publisher":"Informa UK Limited","issue":"1-2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[1991,1]]},"DOI":"10.1080\/00207169108803956","type":"journal-article","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T20:17:10Z","timestamp":1182802630000},"page":"37-48","source":"Crossref","is-referenced-by-count":4,"title":["Maintaining \u03b1-balanced trees by partial rebuilding"],"prefix":"10.1080","volume":"38","author":[{"given":"Arne","family":"Andersson","sequence":"first","affiliation":[]}],"member":"301","reference":[{"key":"CIT0001","unstructured":"Andersson, A. 1989.Proc. Workshop on Algorithms and Data Structures, WADS '89. Improving partial rebuilding by using simple balance criteria. 1989, Ottawa. pp.393\u2013402."},{"key":"CIT0002","author":"Anderson A.","journal-title":"Act Informatica"},{"key":"CIT0003","volume":"1","author":"Bayer R.","year":"1972","journal-title":"Acta Informatica"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"CIT0005","volume":"27","author":"Change H.","year":"1984","journal-title":"ACM"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/19.3.268"},{"key":"CIT0007","volume":"15","author":"Martin W. A.","year":"1972","journal-title":"Communications of the ACM"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1137\/0202005"},{"key":"CIT0009","volume-title":"A Study of Balanced Binary Trees and Balanced One-Two-Trees","author":"Olivie H. J.","year":"1980"},{"key":"CIT0010","first-page":"51","volume":"16","author":"Olivie H. J.","year":"1982","journal-title":"R. A. I. R. O. Informatique Theoretique"},{"key":"CIT0011","unstructured":"Ottmann, Th. and Wood, D. 1990.Proc. Scandinavian Workshop on Algorithm Theory, SWAT '90. Updating binary trees with constant linkage cost. 1990, Bergen."},{"key":"CIT0012","volume-title":"Lecture Notes in Computer Science","volume":"156","author":"Overmars M. H.","year":"1983"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264354"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1145\/6592.6599"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207169108803956","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,12,14]],"date-time":"2016-12-14T05:53:18Z","timestamp":1481694798000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207169108803956"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["10.1080\/00207169108803956"],"URL":"https:\/\/doi.org\/10.1080\/00207169108803956","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}