{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T23:13:29Z","timestamp":1648854809181},"reference-count":27,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"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":[[2001,3]]},"DOI":"10.1016\/s0020-0190(00)00155-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:53:54Z","timestamp":1027616034000},"page":"231-238","source":"Crossref","is-referenced-by-count":12,"title":["On generating -ary trees in computer representation"],"prefix":"10.1016","volume":"77","author":[{"given":"Limin","family":"Xiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuo","family":"Ushijima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changjie","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00155-1_ID005","first-page":"63","article-title":"Generating t-ary trees in parallel","volume":"Vol. 3","author":"Akl","year":"1996","journal-title":"Nordic J. Comput."},{"key":"10.1016\/S0020-0190(00)00155-1_ID006","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(94)00083-2","article-title":"Enumeration of binary trees","volume":"Vol. 51","author":"Bapiraju","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00155-1_ID007","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0020-0190(91)90178-K","article-title":"A loopless algorithm for generating binary tree sequences","volume":"Vol. 39","author":"van Baronaigien","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00155-1_ID008","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1006\/jagm.1999.1073","article-title":"A loopless Gray-code algorithm for listing k-ary trees","volume":"Vol. 35","author":"van Baronaigien","year":"2000","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(00)00155-1_ID009","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1093\/comjnl\/28.5.538","article-title":"Enumerating ordered trees lexicographically","volume":"Vol. 28","author":"Er","year":"1985","journal-title":"Comput. J."},{"key":"10.1016\/S0020-0190(00)00155-1_ID010","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1093\/comjnl\/35.3.306","article-title":"Efficient generation of k-ary trees in natural order","volume":"Vol. 35","author":"Er","year":"1992","journal-title":"Comput. J."},{"key":"10.1016\/S0020-0190(00)00155-1_ID011","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/359423.359434","article-title":"A numbering system for binary trees","volume":"Vol. 20","author":"Knott","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/S0020-0190(00)00155-1_ID012","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0020-0190(94)00149-9","article-title":"Loopless generation of k-ary tree sequences","volume":"Vol. 52","author":"Korsh","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00155-1_ID013","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/S0020-0190(99)00035-6","article-title":"Loopless generation of Gray codes for k-ary trees","volume":"Vol. 70","author":"Korsh","year":"1999","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00155-1_ID014","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0020-0190(97)00215-9","article-title":"Shifts and loopless generation of k-ary trees","volume":"Vol. 65","author":"Korsh","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00155-1_ID015","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1006\/jagm.1993.1045","article-title":"On rotations and the generation of binary trees","volume":"Vol. 15","author":"Lucas","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(00)00155-1_ID016","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1093\/comjnl\/29.2.171","article-title":"Enumerating, ranking and unranking binary trees","volume":"Vol. 29","author":"Pallo","year":"1986","journal-title":"Comput. J."},{"key":"10.1016\/S0020-0190(00)00155-1_ID017","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/00207168508803477","article-title":"A note on generating binary trees in A-order and B-order","volume":"Vol. 18","author":"Pallo","year":"1985","journal-title":"Intern. J. Comput. Math."},{"key":"10.1016\/S0020-0190(00)00155-1_ID018","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322169.322170","article-title":"On the generation for binary trees","volume":"Vol. 27","author":"Proskurowski","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(00)00155-1_ID019","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1145\/322077.322082","article-title":"Generation of binary trees from Ballot sequences","volume":"Vol. 25","author":"Rotem","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(00)00155-1_ID020","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1137\/0207034","article-title":"Generating t-ary trees lexicographically","volume":"Vol. 7","author":"Ruskey","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(00)00155-1_ID021","first-page":"53","article-title":"Fast recursive algorithms for generating combinatorial objects","volume":"Vol. 41","author":"Ruskey","year":"1984","journal-title":"Congr. Numer."},{"key":"10.1016\/S0020-0190(00)00155-1_ID022","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/322169.322171","article-title":"A note on enumerating binary trees","volume":"Vol. 27","author":"Solomon","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(00)00155-1_ID023","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0020-0190(98)00155-0","article-title":"On the loopless generation of binary tree sequences","volume":"Vol. 68","author":"Vajnovszki","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00155-1_ID024","series-title":"Combinatorics for Computer Science","author":"Williamson","year":"1985"},{"key":"10.1016\/S0020-0190(00)00155-1_ID025","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1093\/comjnl\/40.5.278","article-title":"Grammar-oriented enumeration of binary trees","volume":"Vol. 40","author":"Xiang","year":"1997","journal-title":"Comput. J."},{"key":"10.1016\/S0020-0190(00)00155-1_ID026","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0020-0190(00)00139-3","article-title":"Efficient loopless generation of Gray codes for k-ary trees","volume":"Vol. 76","author":"Xiang","year":"2000","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00155-1_ID027","first-page":"179","article-title":"Iterative formulas for enumerating binary trees","volume":"Vol. 2","author":"Xiang","year":"1997","journal-title":"Research Report on Inform. Sci. and Elect. Engin. of Kyushu Univ."},{"key":"10.1016\/S0020-0190(00)00155-1_ID028","first-page":"1245","article-title":"Grammar-oriented enumeration of arbitrary trees and arbitrary k-ary trees","volume":"Vol. E82-D","author":"Xiang","year":"1999","journal-title":"IEICE Trans. Inf. Syst."},{"key":"10.1016\/S0020-0190(00)00155-1_ID029","doi-asserted-by":"crossref","DOI":"10.1093\/comjnl\/43.4.290","article-title":"Generating regular k-ary trees efficiently","author":"Xiang","year":"2000","journal-title":"Comput. J."},{"key":"10.1016\/S0020-0190(00)00155-1_ID030","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(80)90073-0","article-title":"Lexicographic generation of ordered trees","volume":"Vol. 10","author":"Zaks","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(00)00155-1_ID031","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1145\/3828.214141","article-title":"Generating binary trees using rotations","volume":"Vol. 32","author":"Zerling","year":"1985","journal-title":"J. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000001551?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000001551?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T20:00:51Z","timestamp":1555790451000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000001551"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":27,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0020019000001551"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00155-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}