{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T14:55:56Z","timestamp":1672239356750},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1979,9,1]],"date-time":"1979-09-01T00:00:00Z","timestamp":304992000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1979,9]]},"DOI":"10.1007\/bf02253053","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T16:21:59Z","timestamp":1132071719000},"page":"195-211","source":"Crossref","is-referenced-by-count":4,"title":["Height balanced 2\u20133 trees"],"prefix":"10.1007","volume":"21","author":[{"given":"V. K.","family":"Vaishnavi","sequence":"first","affiliation":[]},{"given":"H. P.","family":"Kriegel","sequence":"additional","affiliation":[]},{"given":"D.","family":"Wood","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02253053_CR1","first-page":"263","volume":"146","author":"G. M. Adelson-Velskij","year":"1962","unstructured":"Adelson-Velskij, G. M., Landis, E. M.: An algorithm for the organization of information. (Russian.) Doklady Akad. Nauk, SSSR146, 263\u2013266 (1962).","journal-title":"Doklady Akad. Nauk, SSSR"},{"key":"BF02253053_CR2","volume-title":"The design and analysis of computer algorithms","author":"A. V. Aho","year":"1974","unstructured":"Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The design and analysis of computer algorithms. Reading: Addison-Wesley 1974."},{"key":"BF02253053_CR3","doi-asserted-by":"crossref","unstructured":"Bayer, R.: BinaryB-trees for virtual memory, Proceedings of 1971 ACM SIGFIDET Workshop on Data Description, Access and Control (Codd, E. F., Dean, A. L., eds.), p. 219\u2013235. San Diego: 1971.","DOI":"10.1145\/1734714.1734731"},{"key":"BF02253053_CR4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R., McCreight, E. M.: Organization and maintenance of large ordered indexes. Acta Informatica1, 173\u2013189 (1972).","journal-title":"Acta Informatica"},{"key":"BF02253053_CR5","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/BF00289509","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R.: Symmetric binaryB-trees; Data structures and maintenance algorithms. Acta Informatica1, 290\u2013306 (1972).","journal-title":"Acta Informatica"},{"key":"BF02253053_CR6","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1145\/355609.362340","volume":"16","author":"C. C. Foster","year":"1973","unstructured":"Foster, C. C.: A generalization of AVL trees. Comm. ACM16, 513\u2013517 (1973).","journal-title":"Comm. ACM"},{"key":"BF02253053_CR7","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1145\/360303.360334","volume":"19","author":"D. S. Hirschberg","year":"1976","unstructured":"Hirschberg, D. S.: An insertion technique for one-sided height-balanced trees. Comm. ACM19, 471\u2013473 (1976).","journal-title":"Comm. ACM"},{"key":"BF02253053_CR8","volume-title":"The art of computer programming, Vol. III: Sorting and searching","author":"D. E. Knuth","year":"1973","unstructured":"Knuth, D. E.: The art of computer programming, Vol. III: Sorting and searching. Reading: Addison-Wesley 1973."},{"key":"BF02253053_CR9","first-page":"143","volume":"4","author":"H. A. Mauer","year":"1976","unstructured":"Mauer, H. A., Wood, D.: Zur Manipulation von Zahlenmengen. Angewandte Informatik4, 143\u2013149 (1976).","journal-title":"Angewandte Informatik"},{"key":"BF02253053_CR10","doi-asserted-by":"crossref","unstructured":"Miller, R. E., Pippenger, N., Rosenberg, A. L., Snyder, L.: Optimal 2\u20133 trees, in: Proceedings of a conference on Theoretical Computer Science, August 15\u201317, 1977, University of Waterloo, Waterloo, Ontario, Canada, p. 30\u201335.","DOI":"10.1137\/0208004"},{"key":"BF02253053_CR11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0202005","volume":"2","author":"J. Nievergelt","year":"1973","unstructured":"Nievergelt, J., Reingold, E. M.: Binary trees of bounded balance. SIAM Journal of Computing2, 33\u201343 (1973).","journal-title":"SIAM Journal of Computing"},{"key":"BF02253053_CR12","first-page":"395","volume":"9","author":"Th. Ottmann","year":"1976","unstructured":"Ottmann, Th., Six, H. W.: Eine neue Klasse von ausgeglichenen Bin\u00e4rb\u00e4umen, Angewandte Informatik9, 395\u2013400 (1976).","journal-title":"Angewandte Informatik"},{"key":"BF02253053_CR13","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1080\/00207167808803145","volume":"6","author":"Th. Ottmann","year":"1978","unstructured":"Ottmann, Th., Wood, D.: Deletion in one-sided height-balanced search trees. Int. J. of Computer Mathematics6, 265\u2013271 (1978).","journal-title":"Int. J. of Computer Mathematics"},{"key":"BF02253053_CR14","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1145\/359588.359607","volume":"21","author":"Th. Ottmann","year":"1978","unstructured":"Ottmann, Th., Six, H. W., Wood, D.: Right brother trees. Comm. ACM21, 769\u2013776 (1978).","journal-title":"Comm. ACM"},{"key":"BF02253053_CR15","series-title":"Computer Science Technical Report 77-CS-12","volume-title":"On the correspondence between AVL trees and brother trees","author":"Th. Ottmann","year":"1977","unstructured":"Ottmann, Th., Six, H. W., Wood, D.: On the correspondence between AVL trees and brother trees. Computer Science Technical Report 77-CS-12, Department of Applied Mathematics, McMaster University, Hamilton (1977)."},{"key":"BF02253053_CR16","unstructured":"Ottmann, Th., Wood, D.: 1\u20132 Brother Trees. Computer Journal (1978, to appear)."},{"key":"BF02253053_CR17","unstructured":"R\u00e4ih\u00f6, K. J.: An 0 (logn) insertion algorithm for one-sided height-balanced binary search trees, Department of Computer Science, University of Helsinki, Finland, Report A-1977-9."},{"key":"BF02253053_CR18","doi-asserted-by":"crossref","unstructured":"Rosenberg, A. L., Snyder, L.: Minimal comparison 2,3-trees. SIAM J. of Computing (1978, to appear).","DOI":"10.1137\/0207037"},{"key":"BF02253053_CR19","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1145\/359511.359514","volume":"21","author":"S. H. Zweben","year":"1978","unstructured":"Zweben, S. H., McDonald, M. A.: An optimal method for deletion in one-sided height-balanced trees. Comm. ACM21, 441\u2013445 (1978).","journal-title":"Comm. ACM"},{"key":"BF02253053_CR20","series-title":"Technical Report","volume-title":"An optimal insertion method for one-sided height-balanced trees","author":"S. H. Zweben","year":"1977","unstructured":"Zweben, S. H.: An optimal insertion method for one-sided height-balanced trees, Technical Report, Department of Computer and Information Science, Ohio State University, Columbus, Ohio (1977)."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02253053.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02253053\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02253053","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T23:37:16Z","timestamp":1586561836000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02253053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,9]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,9]]}},"alternative-id":["BF02253053"],"URL":"https:\/\/doi.org\/10.1007\/bf02253053","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,9]]}}}