{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T15:14:32Z","timestamp":1648653272674},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4521,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1016\/s0304-3975(99)00293-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:51:54Z","timestamp":1027619514000},"page":"345-361","source":"Crossref","is-referenced-by-count":4,"title":["Chemins de Schr\u00f6der et hi\u00e9rarchies al\u00e9atoires"],"prefix":"10.1016","volume":"255","author":[{"given":"Jean-Guy","family":"Penaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elisa","family":"Pergola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renzo","family":"Pinzani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Roques","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0304-3975(99)00293-5_BIB1","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1016\/0304-3975(94)00086-7","article-title":"Uniform generation of a Motzkin word","volume":"134","author":"Alonso","year":"1964","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00293-5_BIB2","doi-asserted-by":"crossref","DOI":"10.1016\/S0020-0190(97)00174-9","article-title":"Uniform generation of a Schr\u00f6der tree","volume":"64","author":"Alonso","year":"1997","journal-title":"IPL: Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(99)00293-5_BIB3","doi-asserted-by":"crossref","unstructured":"L. Alonso, R. Schott, Random Generation of Trees, Kluwer Academic Publishers, Dordrecht, 1995, pp. 305\u2013308.","DOI":"10.1007\/978-1-4757-6353-9"},{"key":"10.1016\/S0304-3975(99)00293-5_BIB4","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(94)90046-9","article-title":"The random generation of directed animals","volume":"127","author":"Barcucci","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00293-5_BIB5","series-title":"Advanced Combinatorics","author":"Comtet","year":"1974"},{"key":"10.1016\/S0304-3975(99)00293-5_BIB6","unstructured":"R. Cori, G. Viennot, A synthesis of bijection related to Catalan numbers, 1983, unpublished."},{"key":"10.1016\/S0304-3975(99)00293-5_BIB7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0012-365X(95)00129-K","article-title":"G\u00e9n\u00e9ration al\u00e9atoire et uniforme de mots","volume":"153","author":"Denise","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(99)00293-5_BIB8","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1215\/S0012-7094-47-01423-3","article-title":"A problem of arrangements","volume":"14","author":"Dvoretzky","year":"1947","journal-title":"Duke Math. J."},{"key":"10.1016\/S0304-3975(99)00293-5_BIB9","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1017\/S0950184300002640","article-title":"Some problems of non-associative combinatorics (2)","volume":"32","author":"Erd\u00e9lyi","year":"1940","journal-title":"Edinburg Math. Notes"},{"key":"10.1016\/S0304-3975(99)00293-5_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0950184300002639","article-title":"Some problems of non-associative combinatorics (1)","volume":"32","author":"Etherington","year":"1940","journal-title":"Edinburg Math. Notes"},{"issue":"2","key":"10.1016\/S0304-3975(99)00293-5_BIB11","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1006\/jcta.1997.2814","article-title":"A classic proof of a reecurrence for a very classical sequence","volume":"80","author":"Foata","year":"1997","journal-title":"J. Combin. Theory. Ser. A"},{"key":"10.1016\/S0304-3975(99)00293-5_BIB12","doi-asserted-by":"crossref","unstructured":"Ph. Flajolet, P. Zimmerman, B. Van Custem, A calculus for the random generation of labelled combinatorial structures, Theoretical Computer Science, Vol. 132, Amsterdam, Elsevier, 1994, pp. 1\u201335.","DOI":"10.1016\/0304-3975(94)90226-7"},{"issue":"3","key":"10.1016\/S0304-3975(99)00293-5_BIB13","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1051\/ita\/1988220303611","article-title":"Deux propri\u00e9t\u00e9s combinatoires des nombres de Schr\u00f6der","volume":"22","author":"Gouyou-Beauchamps","year":"1988","journal-title":"Inform. Th\u00e9orique Appl."},{"key":"10.1016\/S0304-3975(99)00293-5_BIB14","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/0196-8858(88)90017-6","article-title":"Equivalence of the two-dimensional directed animal problem to a one-dimensional path problem","volume":"9","author":"Gouyou-Beauchamps","year":"1988","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/S0304-3975(99)00293-5_BIB15","doi-asserted-by":"crossref","unstructured":"D.G. Rogers, A Schr\u00f6der triangle: three combinatorial problems, Lecture Notes in Math., 1977, p. 622.","DOI":"10.1007\/BFb0069192"},{"key":"10.1016\/S0304-3975(99)00293-5_BIB16","first-page":"361","article-title":"Vier combinatorische probleme","volume":"15","author":"Schr\u00f6der","year":"1870","journal-title":"Z. Math. Phys."},{"issue":"4","key":"10.1016\/S0304-3975(99)00293-5_BIB17","doi-asserted-by":"crossref","first-page":"344","DOI":"10.2307\/2974582","article-title":"Hipparchus, Plutarch, Schr\u00f6der, and Hough","volume":"104","author":"Stanley","year":"1997","journal-title":"Am. Math. Monthly"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002935?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002935?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T13:14:19Z","timestamp":1580217259000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599002935"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0304397599002935"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00293-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}