{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T21:51:46Z","timestamp":1672264306367},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1990,3]]},"DOI":"10.1007\/bf01932132","type":"journal-article","created":{"date-parts":[[2005,7,24]],"date-time":"2005-07-24T15:12:10Z","timestamp":1122217930000},"page":"62-69","source":"Crossref","is-referenced-by-count":1,"title":["Counting labels in binary trees"],"prefix":"10.1007","volume":"30","author":[{"given":"Renzo","family":"Sprugnoli","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"BF01932132_CR1","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1093\/comjnl\/28.4.426","volume":"28","author":"K. Brinck","year":"1985","unstructured":"Brinck K.:The expected performance of traversal algorithms in binary trees. The Computer J., 28, 4 (1985), p. 426\u2013432.","journal-title":"The Computer J."},{"key":"BF01932132_CR2","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/0196-6774(86)90030-1","volume":"7","author":"K. Brinck","year":"1986","unstructured":"Brinck K.:On deletions in threaded binary trees. Journal of Algorithms, 7 (1986), p. 395\u2013411.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"BF01932132_CR3","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/359423.359434","volume":"20","author":"D. G. Knott","year":"1977","unstructured":"Knott D. G.:A numbering system for binary trees. Comm. of the ACM, 20, 2 (1977), p. 113\u2013115.","journal-title":"Comm. of the ACM"},{"key":"BF01932132_CR4","volume-title":"The Art of Computer Programming. Vol. 1.Fundamental Algorithms","author":"D. E. Knuth","year":"1968","unstructured":"Knuth D. E.:The Art of Computer Programming. Vol. 1.Fundamental Algorithms. Addison Wesley, Reading, Ma. (1968)."},{"key":"BF01932132_CR5","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF01941465","volume":"21","author":"R. Sprugnoli","year":"1981","unstructured":"Sprugnoli R.:On the allocation of binary trees to secondary storage. BIT, 21 (1981) p. 305\u2013316.","journal-title":"BIT"},{"key":"BF01932132_CR6","unstructured":"Sprugnoli R.:The generation of binary trees as a numerical problem. (To appear.)"},{"key":"BF01932132_CR7","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1137\/0207039","volume":"7","author":"A. E. Trojanowski","year":"1978","unstructured":"Trojanowski A. E.:Ranking and listing algorithms for k-aray trees, SIAM J. of Comp. 7 (1978) pp. 492\u2013519.","journal-title":"SIAM J. of Comp."}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01932132.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01932132\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01932132","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T20:59:34Z","timestamp":1557435574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01932132"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["BF01932132"],"URL":"https:\/\/doi.org\/10.1007\/bf01932132","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}