{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:29:59Z","timestamp":1725564599494},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157653"},{"type":"electronic","value":"9783642157660"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15766-0_49","type":"book-chapter","created":{"date-parts":[[2010,9,2]],"date-time":"2010-09-02T20:41:05Z","timestamp":1283460065000},"page":"330-335","source":"Crossref","is-referenced-by-count":0,"title":["Generation of k-ary and (k,m)-ary Trees in A-order Using z-Sequences"],"prefix":"10.1007","author":[{"given":"N. A. Ashrafi","family":"Payaman","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1016\/j.parco.2005.06.002","volume":"31","author":"H. Ahrabian","year":"2005","unstructured":"Ahrabian, H., Nowzari-Dalini, A.: Parallel generation of trees in A-order. Parallel Computing\u00a031, 955\u2013984 (2005)","journal-title":"Parallel Computing"},{"key":"49_CR2","first-page":"243","volume":"13","author":"H. Ahrabian","year":"2004","unstructured":"Ahrabian, H., Nowzari-Dalini, A.: Gray code algorithm for listing k-ary trees. Studies in Informatics and Control\u00a013, 243\u2013251 (2004)","journal-title":"Studies in Informatics and Control"},{"key":"49_CR3","doi-asserted-by":"publisher","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 tree. Theor. Comput. Sci.\u00a010, 63\u201382 (1980)","journal-title":"Theor. Comput. Sci."},{"key":"49_CR4","unstructured":"Rosena, R., Du, x., Liu, F. (k,m)-Catalan numbers and hook length polynomials for plane trees, January 24, pp. 1312\u20131321 (2007)"},{"key":"49_CR5","first-page":"27","volume":"5","author":"H. Ahrabian","year":"2003","unstructured":"Ahrabian, H., Nowzari-Dalini, A.: On the generation of the P-sequences. Adv. Modeling Optim.\u00a05, 27\u201338 (2003)","journal-title":"Adv. Modeling Optim."},{"key":"49_CR6","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1093\/comjnl\/35.3.306","volume":"35","author":"M.C. Er","year":"1992","unstructured":"Er, M.C.: Efficient generation of k-ary trees in natural order. Comput. J.\u00a035, 306\u2013308 (1992)","journal-title":"Comput. J."},{"key":"49_CR7","first-page":"557","volume":"16","author":"J.F. Korsh","year":"1995","unstructured":"Korsh, J.F.: A-order generation of k-ary trees with 4k-4 letter alphabet. J. Inform Optim. Sci.\u00a016, 557\u2013567 (1995)","journal-title":"J. Inform Optim. Sci."},{"key":"49_CR8","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1080\/00207168708803562","volume":"21","author":"J. Pallo","year":"1987","unstructured":"Pallo, J.: Generating trees with n nodes and m leaves. Intern J. Comput. Math.\u00a021, 133\u2013144 (1987)","journal-title":"Intern J. Comput. Math."},{"key":"49_CR9","first-page":"201","volume-title":"Proc. 12th International conference on computer and applications","author":"V. Vajnovszki","year":"1997","unstructured":"Vajnovszki, V., Philips, C.: Optimal algorithm for generating k-ary trees. In: Woodfill, M.C. (ed.) Proc. 12th International conference on computer and applications, pp. 201\u2013204. ISCA, Raleight (1997)"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"Ahrabian, H., Nowzari-Dalini, A.: Parallel generation of trees in A-order. The Computer Journal (2007)","DOI":"10.1093\/comjnl\/bxm027"},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"Aigner, M.: Enumeration via ballot numbers. Discrete Mathematics (2008)","DOI":"10.1016\/j.disc.2007.06.012"},{"key":"49_CR12","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.aam.2009.03.002","volume":"44","author":"N. Bergeron","year":"2010","unstructured":"Bergeron, N., Descounens, F., Zabrockia, M.: A filtration of (q,t)-catalan numbers. Advances in Applied Mathematics\u00a044, 16\u201336 (2010)","journal-title":"Advances in Applied Mathematics"},{"key":"49_CR13","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/S0001-8708(02)00061-0","volume":"175","author":"J. Huglund","year":"2003","unstructured":"Huglund, J.: Conjectured statistics for the q; t-Catalan numbers. Advances in Mathematics\u00a0175, 319\u2013334 (2003)","journal-title":"Advances in Mathematics"},{"key":"49_CR14","doi-asserted-by":"publisher","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 tree. Theor. Comput. Sci.\u00a010, 63\u201382 (1980)","journal-title":"Theor. Comput. Sci."}],"container-title":["Communications in Computer and Information Science","Information and Communication Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15766-0_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T13:05:30Z","timestamp":1619787930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15766-0_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157653","9783642157660"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15766-0_49","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2010]]}}}