{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T08:22:33Z","timestamp":1768292553902,"version":"3.49.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1007\/bf02522824","type":"journal-article","created":{"date-parts":[[2006,11,7]],"date-time":"2006-11-07T23:40:51Z","timestamp":1162942851000},"page":"162-182","source":"Crossref","is-referenced-by-count":18,"title":["A linear-time algorithm for the generation of trees"],"prefix":"10.1007","volume":"17","author":[{"given":"L.","family":"Alonso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. L.","family":"R\u00e9my","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Schott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"BF02522824_CR1","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1016\/0304-3975(94)00086-7","volume":"134","author":"L. Alonso","year":"1994","unstructured":"[A] L. Alonso, Uniform generation of a Motzkin word,Theoret. Comput. Sci., 134(2):529\u2013536, 1994.","journal-title":"Theoret. Comput. Sci."},{"key":"BF02522824_CR2","doi-asserted-by":"crossref","unstructured":"[AS] L. Alonso, R. Schott, A parallel algorithm for the generation of permutations, to appear inTheoret. Comput. Sci., 1996.","DOI":"10.1007\/978-1-4757-6353-9_10"},{"key":"BF02522824_CR3","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0166-218X(89)90003-6","volume":"25","author":"N. Dershowitz","year":"1989","unstructured":"[DZ1] N. Dershowitz, S. Zaks, Patterns in trees,Discrete Appl. Math., 25:241\u2013255, 1989.","journal-title":"Discrete Appl. Math."},{"key":"BF02522824_CR4","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0195-6698(13)80053-4","volume":"11","author":"N. Dershowitz","year":"1990","unstructured":"[DZ2] N. Dershowitz, S. Zaks, The Cycle Lemma and some applications,European J. Combin., 11:35\u201340, 1990.","journal-title":"European J. Combin."},{"key":"BF02522824_CR5","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1215\/S0012-7094-47-01423-3","volume":"24","author":"A. Dvoretzky","year":"1947","unstructured":"[DM] A. Dvoretzky, Th. Motzkin, A problem of arrangements,Duke Math. J., 24:305\u2013313, 1947.","journal-title":"Duke Math. J."},{"key":"BF02522824_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(94)90226-7","volume":"132","author":"P. Flajolet","year":"1994","unstructured":"[FZC] P. Flajolet, P. Zimmermann, B. V. Cutsem, A calculus for the generation of combinatorial structures,Theoret. Comput. Sci., 132:1\u201335, 1994.","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"BF02522824_CR7","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1051\/ita\/1985190201791","volume":"19","author":"J. L. R\u00e9my","year":"1985","unstructured":"[R] J. L. R\u00e9my, Un proc\u00e9d\u00e9 it\u00e9ratif de d\u00e9nombrement d'arbres binaires et son application \u00e0 leur g\u00e9n\u00e9ration al\u00e9atoire,RAIRO Inform. Th\u00e9or., 19(2):179\u2013195, 1985.","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"BF02522824_CR8","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/S0019-9958(63)90306-1","volume":"6","author":"M. P. Sch\u00fctzenberger","year":"1963","unstructured":"[SC] M. P. Sch\u00fctzenberger, Context-free languages and pushdown automata,Inform. Control, 6:246\u2013261, 1963.","journal-title":"Inform. Control"},{"issue":"13","key":"BF02522824_CR9","first-page":"91","volume":"I","author":"D. M. Silberger","year":"1969","unstructured":"[SI] D. M. Silberger, Occurrences of the integer (2n\u22122)!\/n!(n\u22121)!,Roczniki Polskiego Towarzystwa Math. I, (13):91\u201396, 1969.","journal-title":"Roczniki Polskiego Towarzystwa Math."},{"key":"BF02522824_CR10","first-page":"65","volume":"83","author":"J. S. Vitter","year":"1983","unstructured":"[VIT] J. S. Vitter, Optimum algorithms for two random sampling problems,Proc. FOCS 83, pp. 65\u201375, 1983.","journal-title":"Proc. FOCS"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02522824.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02522824\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02522824","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:39:38Z","timestamp":1558283978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02522824"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["BF02522824"],"URL":"https:\/\/doi.org\/10.1007\/bf02522824","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}