{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T14:56:55Z","timestamp":1672239415867},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1981,12,1]],"date-time":"1981-12-01T00:00:00Z","timestamp":376012800000},"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":[[1981,12]]},"DOI":"10.1007\/bf02237956","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T20:06:56Z","timestamp":1131998816000},"page":"367-378","source":"Crossref","is-referenced-by-count":1,"title":["The implementation of insertion and deletion algorithms for 1\u20132 brother trees"],"prefix":"10.1007","volume":"26","author":[{"given":"Th.","family":"Ottmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. -W.","family":"Six","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Wood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02237956_CR1","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, Mass.: Addison-Wesley 1974."},{"key":"BF02237956_CR2","first-page":"105","volume":"4","author":"C. A. R. Hoare","year":"1975","unstructured":"Hoare, C. A. R.: Recursive data structures. Int. Journal of Comp. and Inform. Sciences4, 105\u2013132 (1975).","journal-title":"Sciences"},{"key":"BF02237956_CR3","volume-title":"PASCAL \u2014 user manual and report","author":"K. Jensen","year":"1975","unstructured":"Jensen, K., Wirth, N.: PASCAL \u2014 user manual and report, 2nd ed. Berlin-Heidelberg-New York: Springer 1975.","edition":"2nd ed."},{"issue":"3","key":"BF02237956_CR4","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1093\/comjnl\/23.3.248","volume":"23","author":"Th. Ottmann","year":"1980","unstructured":"Ottmann, Th., Wood, D.: 1\u20132 brother trees or AVL trees revisited. The Computer Journal23 (3), 248\u2013255 (1980).","journal-title":"The Computer Journal"},{"key":"BF02237956_CR5","volume-title":"Algorithms+data structures=programs","author":"N. Wirth","year":"1976","unstructured":"Wirth, N.: Algorithms+data structures=programs. Englewood Cliffs, N. J.: Prentice-Hall 1976."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02237956.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02237956\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02237956","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T13:02:22Z","timestamp":1557925342000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02237956"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,12]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1981,12]]}},"alternative-id":["BF02237956"],"URL":"https:\/\/doi.org\/10.1007\/bf02237956","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,12]]}}}