{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T01:56:55Z","timestamp":1778723815406,"version":"3.51.4"},"reference-count":13,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1983,11,1]],"date-time":"1983-11-01T00:00:00Z","timestamp":436492800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1983,11]]},"DOI":"10.1016\/0020-0190(83)90046-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"225-229","source":"Crossref","is-referenced-by-count":15,"title":["Listing and counting subtrees of equal size of a binary tree"],"prefix":"10.1016","volume":"17","author":[{"given":"Teruo","family":"Hikita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(83)90046-7_BIB1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/359423.359434","article-title":"A numbering system for binary trees","volume":"20","author":"Knott","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(83)90046-7_BIB2","article-title":"The Art of Computer Programming","volume":"Vol. 1","author":"Knuth","year":"1968"},{"key":"10.1016\/0020-0190(83)90046-7_BIB13","article-title":"The Art of Computer Programming","volume":"Vol. 1","author":"Knuth","year":"1973"},{"key":"10.1016\/0020-0190(83)90046-7_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322169.322170","article-title":"On the generation of binary trees","volume":"27","author":"Proskurowski","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(83)90046-7_BIB4","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1145\/322077.322082","article-title":"Generation of binary trees from ballot sequences","volume":"25","author":"Rotem","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(83)90046-7_BIB5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1137\/0210011","article-title":"Listing and counting subtrees of a tree","volume":"10","author":"Ruskey","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(83)90046-7_BIB6","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1137\/0206055","article-title":"Generating binary trees lexicographically","volume":"6","author":"Ruskey","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(83)90046-7_BIB7","first-page":"17","article-title":"Generation of stack sequences in lexicographical order","volume":"15","author":"Semba","year":"1982","journal-title":"J. Inform. Process."},{"key":"10.1016\/0020-0190(83)90046-7_BIB8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/322169.322171","article-title":"A note on enumerating binary trees","volume":"27","author":"Solomon","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(83)90046-7_BIB9","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1137\/0207039","article-title":"Ranking and listing algorithms for k-ary trees","volume":"7","author":"Trojanowski","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(83)90046-7_BIB10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(80)90073-0","article-title":"Lexicographic generation of ordered trees","volume":"10","author":"Zaks","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(83)90046-7_BIB11","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1137\/0208006","article-title":"Generating trees and other combinatorial objects lexicographically","volume":"8","author":"Zaks","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(83)90046-7_BIB12","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0022-0000(82)90004-6","article-title":"The average height of binary trees and other simple trees","volume":"25","author":"Flajolet","year":"1982","journal-title":"J. Comput. Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900467?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900467?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:56:52Z","timestamp":1555073812000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019083900467"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,11]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1983,11]]}},"alternative-id":["0020019083900467"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(83)90046-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1983,11]]}}}