{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T11:59:25Z","timestamp":1717761565259},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":[[1994,1]]},"DOI":"10.1016\/0020-0190(94)90050-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:40Z","timestamp":1027655140000},"page":"27-32","source":"Crossref","is-referenced-by-count":5,"title":["On generating B-trees with constant average delay and in lexicographic order"],"prefix":"10.1016","volume":"49","author":[{"given":"Mounir","family":"Belbaraka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Stojmenovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)90050-7_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1976"},{"key":"10.1016\/0020-0190(94)90050-7_BIB2","article-title":"Generating binary trees in parallel","author":"Akl","year":"1992","journal-title":"Proc. Allerton Conf. on Communications, Control and Computing"},{"key":"10.1016\/0020-0190(94)90050-7_BIB3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","article-title":"Organization and maintenance of large ordered indices","volume":"1","author":"Bayer","year":"1972","journal-title":"Acta Inform."},{"issue":"4","key":"10.1016\/0020-0190(94)90050-7_BIB4","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1137\/0209055","article-title":"Constant time generation of rooted trees","volume":"9","author":"Beyer","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)90050-7_BIB5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1093\/comjnl\/31.1.61","article-title":"A simple algorithm for generating non-regular trees in lexicographic order","volume":"31","author":"Er","year":"1988","journal-title":"Comput. J."},{"key":"10.1016\/0020-0190(94)90050-7_BIB6","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1137\/0211049","article-title":"Ranking and unranking of 2\u20133 trees","volume":"11","author":"Gupta","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)90050-7_BIB7","first-page":"51","article-title":"Ranking and unranking of B-trees","volume":"4","author":"Gupta","year":"1983","journal-title":"J. Algebra"},{"key":"10.1016\/0020-0190(94)90050-7_BIB8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0020-0190(83)90046-7","article-title":"Listing and counting subtrees of equal size of a binary tree","volume":"17","author":"Hikita","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)90050-7_BIB9","series-title":"Computer Science M.Sc. Thesis","article-title":"Ranking and unranking of trees using regular reductions","author":"Kelsen","year":"1989"},{"key":"10.1016\/0020-0190(94)90050-7_BIB10","series-title":"Vol. 3: Sorting and Searching","article-title":"The Art of Computer Programming","author":"Knuth","year":"1973"},{"key":"10.1016\/0020-0190(94)90050-7_BIB11","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/BF00288468","article-title":"Generating binary trees of bounded height","volume":"23","author":"Lee","year":"1986","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(94)90050-7_BIB12","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1137\/0215073","article-title":"Ranking and unranking of AVL trees","volume":"15","author":"Li","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)90050-7_BIB13","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1080\/00207168708803562","article-title":"Generating trees with n nodes and m leaves","volume":"21","author":"Pallo","year":"1987","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0020-0190(94)90050-7_BIB14","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0167-8655(89)90091-3","article-title":"Lexicographic generation of binary unordered trees","volume":"10","author":"Pallo","year":"1989","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/0020-0190(94)90050-7_BIB15","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1137\/0207034","article-title":"Generating t-ary trees lexicographically","volume":"7","author":"Ruskey","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)90050-7_BIB16","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(94)90050-7_BIB17","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0304-3975(88)90169-7","article-title":"Generating ordered trees","volume":"57","author":"Skarbek","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(94)90050-7_BIB18","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\/0020-0190(94)90050-7_BIB19","article-title":"On the Ordering, Ranking, and Random Generation of Basic Combinatorial Sets","volume":"579","author":"Williamson","year":"1976"},{"key":"10.1016\/0020-0190(94)90050-7_BIB20","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1137\/0215039","article-title":"Constant time generation of free trees","volume":"15","author":"Wright","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)90050-7_BIB21","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/0020-0190(82)90140-5","article-title":"Generation and ranking of k-ary trees","volume":"14","author":"Zaks","year":"1982","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900507?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900507?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:22:03Z","timestamp":1555132923000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094900507"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["0020019094900507"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)90050-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}