{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,29]],"date-time":"2022-04-29T05:29:25Z","timestamp":1651210165932},"reference-count":11,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"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":[[1997,12]]},"DOI":"10.1016\/s0020-0190(97)00174-9","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:32:24Z","timestamp":1049722344000},"page":"305-308","source":"Crossref","is-referenced-by-count":6,"title":["Uniform generation of a Schr\u00f6der tree"],"prefix":"10.1016","volume":"64","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":"78","reference":[{"key":"10.1016\/S0020-0190(97)00174-9_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":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(97)00174-9_BIB2","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/BF02522824","article-title":"A linear time algorithm for the generation of trees","volume":"17","author":"Alonso","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(97)00174-9_BIB3","series-title":"Random Generation of Trees","author":"Alonso","year":"1995"},{"key":"10.1016\/S0020-0190(97)00174-9_BIB4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0166-218X(89)90003-6","article-title":"Patterns in trees","volume":"25","author":"Dershowitz","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(97)00174-9_BIB5","unstructured":"D. Foata and D. Zeilberger, A classical proof of a recurrence for a classical sequence, Preprint."},{"issue":"3","key":"10.1016\/S0020-0190(97)00174-9_BIB6","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":"RAIRO Inform. Th\u00e9or."},{"issue":"2","key":"10.1016\/S0020-0190(97)00174-9_BIB7","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1051\/ita\/1985190201791","article-title":"Un proc\u00e9d\u00e9 it\u00e9ratif de d\u00e9nombrement d'arbres binaires et son application \u00e0 leur g\u00e9n\u00e9ration al\u00e9atoire","volume":"19","author":"R\u00e9my","year":"1985","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/S0020-0190(97)00174-9_BIB8","first-page":"361","article-title":"Vier combinatorische Probleme","volume":"15","author":"Schr\u00f6der","year":"1870","journal-title":"Z. Math. Physik"},{"key":"10.1016\/S0020-0190(97)00174-9_BIB9","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1137\/0404025","article-title":"Bootstrap percolation, the Schr\u00f6der numbers and the n-kings problem","volume":"4","author":"Shapiro","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0020-0190(97)00174-9_BIB10","unstructured":"R.P. Stanley, Hipparchus, Plutarch, Schr\u00f6eder and Hough, Preprint."},{"key":"10.1016\/S0020-0190(97)00174-9_BIB11","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0012-365X(94)00067-1","article-title":"Generating trees and the Catalan and Schr\u00f6der numbers","volume":"146","author":"West","year":"1995","journal-title":"Discrete Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001749?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001749?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:26:59Z","timestamp":1556044019000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097001749"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["S0020019097001749"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00174-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}