{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T07:52:04Z","timestamp":1676793124809},"reference-count":4,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"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":[[1998,3]]},"DOI":"10.1016\/s0020-0190(97)00215-9","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"235-240","source":"Crossref","is-referenced-by-count":15,"title":["Shifts and loopless generation of k-ary trees"],"prefix":"10.1016","volume":"65","author":[{"given":"James F.","family":"Korsh","sequence":"first","affiliation":[]},{"given":"Seymour","family":"Lipschutz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00215-9_BIB1","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":"52","author":"Korsh","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(97)00215-9_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.1993.1045","article-title":"On rotations and the generation of binary trees","volume":"15","author":"Lucas","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(97)00215-9_BIB3","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":"39","author":"van Baronaigien","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(97)00215-9_BIB4","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0020-0190(88)90027-0","article-title":"Generating t-ary trees in A-order","volume":"27","author":"van Baronaigien","year":"1988","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002159?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002159?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:27:27Z","timestamp":1556058447000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097002159"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":4,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0020019097002159"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00215-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}