{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T10:36:59Z","timestamp":1673347019271},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1986,9,1]],"date-time":"1986-09-01T00:00:00Z","timestamp":525916800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1986,9]]},"DOI":"10.1007\/bf00288468","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T12:43:28Z","timestamp":1096893808000},"page":"529-544","source":"Crossref","is-referenced-by-count":16,"title":["Generating binary trees of bounded height"],"prefix":"10.1007","volume":"23","author":[{"given":"C. C.","family":"Lee","sequence":"first","affiliation":[]},{"given":"D. T.","family":"Lee","sequence":"additional","affiliation":[]},{"given":"C. K.","family":"Wong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1137\/0209055","volume":"9","author":"T. Beyer","year":"1980","unstructured":"Beyer, T., Hedetniemi, S.M.: Constant time generation of rooted trees. SIAM J. Comput. 9, 706?712 (1980)","journal-title":"SIAM J. Comput."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1137\/0211049","volume":"11","author":"U.I. Gupta","year":"1982","unstructured":"Gupta, U.I., Lee, D.T., Wong, C.K.: Ranking and unranking of 2?3 trees. SIAM J. Comput. 11, 582?590 (1982)","journal-title":"SIAM J. Comput."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0196-6774(83)90034-2","volume":"4","author":"U.I. Gupta","year":"1983","unstructured":"Gupta, U.I., Lee, D.T., Wong, C.K.: Ranking and unranking of B-trees, J. Algorithms 4, 11?60 (1983)","journal-title":"J. Algorithms"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Odlyzko, A.: Limit distributions for coefficients of iterates of polynomials with applications to combinatorial enumerations. (AT & T Bell Laboratories (1983) unpublished)","DOI":"10.1017\/S0305004100062149"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/359423.359434","volume":"20","author":"G.D. Knott","year":"1977","unstructured":"Knott, G.D.: A numbering system for binary trees. Commun. ACM 20, 113?115 (1977)","journal-title":"Commun. ACM"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322169.322170","volume":"27","author":"A. Proskurowski","year":"1980","unstructured":"Proskurowski, A.: On the generation of binary trees, J. ACM 27, 1?2 (1980)","journal-title":"J. ACM"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1145\/322077.322082","volume":"25","author":"D. Rotem","year":"1978","unstructured":"Rotem, D., Varol, Y.L.: Generation of binary trees from ballot sequences, J. ACM 25, 396?404 (1978)","journal-title":"J. ACM"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1137\/0207034","volume":"7","author":"F. Ruskey","year":"1978","unstructured":"Ruskey, F.: Generating t-ary trees lexicographically, SIAM J. Comput. 7, 424?439 (1978)","journal-title":"SIAM J. Comput."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1137\/0206055","volume":"6","author":"F. Ruskey","year":"1977","unstructured":"Ruskey, F., Hu, T.C.: Generating binary trees lexicographically. SIAM J. Comput. 6, 745?758 (1977)","journal-title":"SIAM J. Comput."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/322169.322171","volume":"27","author":"M. Solomon","year":"1980","unstructured":"Solomon, M., Finkel, R.A.: A note on enumerating binary trees. J. ACM 27, 3?5 (1980)","journal-title":"J. ACM"},{"key":"CR11","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-ary trees. SIAM J. Comput. 7, 492?509 (1978)","journal-title":"SIAM J. Comput."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0001-8708(77)80046-7","volume":"24","author":"H.S. Wilf","year":"1977","unstructured":"Wilf, H.S.: A unified setting for sequencing, ranking and selection algorithms for combinatorial objects. Adv. Math. 24, 281?291 (1977)","journal-title":"Adv. Math."},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"Williamson, S.G.: On the ordering, ranking and random generation of basic combinatorial sets, in Combinatoire et representation du groupe symetrique. Strasbourg: 1976","DOI":"10.1007\/BFb0090026"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(80)90073-0","volume":"10","author":"S. Zaks","year":"1980","unstructured":"Zaks, S.: Lexicographic generation of ordered trees. Theor. Comput. Sci. 10, 63?82 (1980)","journal-title":"Theor. Comput. Sci."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1137\/0208006","volume":"8","author":"S. Zaks","year":"1979","unstructured":"Zaks, S., Richards, D.: Generating trees and other combinatorial objects lexicographically. SIAM J. Comput. 8, 73?81 (1979)","journal-title":"SIAM J. Comput."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/0020-0190(82)90140-5","volume":"14","author":"S. Zaks","year":"1982","unstructured":"Zaks, S.: Generation and ranking of k-ary trees, Inf. Process. Lett. 14, 44?48 (1982)","journal-title":"Inf. Process. Lett."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288468.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00288468\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288468","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T07:56:21Z","timestamp":1585900581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00288468"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,9]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1986,9]]}},"alternative-id":["BF00288468"],"URL":"https:\/\/doi.org\/10.1007\/bf00288468","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,9]]}}}