{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:41:43Z","timestamp":1702028503330},"reference-count":15,"publisher":"Elsevier BV","issue":"4-6","license":[{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"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":[[2000,12]]},"DOI":"10.1016\/s0020-0190(00)00139-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:59:57Z","timestamp":1027630797000},"page":"169-174","source":"Crossref","is-referenced-by-count":20,"title":["Efficient loopless generation of Gray codes for -ary trees"],"prefix":"10.1016","volume":"76","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)00139-3_ID005","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)00139-3_ID006","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)00139-3_ID007","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)00139-3_ID008","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)00139-3_ID009","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)00139-3_ID010","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)00139-3_ID011","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":"Roelants van Baronaigien","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00139-3_ID012","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":"Roelants van Baronaigien","year":"2000","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(00)00139-3_ID013","first-page":"313","article-title":"A Hamiltonian path in the rotation lattice of binary trees","volume":"Vol. 59","author":"Roelants van Baronaigien","year":"1987","journal-title":"Congr. Numer."},{"key":"10.1016\/S0020-0190(00)00139-3_ID014","series-title":"Combinatorics for Computer Science","author":"Williamson","year":"1985"},{"key":"10.1016\/S0020-0190(00)00139-3_ID015","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)00139-3_ID016","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. Inform. & Syst."},{"key":"10.1016\/S0020-0190(00)00139-3_ID017","article-title":"On generating k-ary trees in computer representation","volume":"Vol. 78","author":"Xiang","year":"2001","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00139-3_ID018","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)00139-3_ID019","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:S0020019000001393?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000001393?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:58:17Z","timestamp":1555793897000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000001393"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":15,"journal-issue":{"issue":"4-6","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["S0020019000001393"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00139-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}