{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T19:20:07Z","timestamp":1649013607244},"reference-count":13,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"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,6]]},"DOI":"10.1016\/0020-0190(94)00054-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"323-327","source":"Crossref","is-referenced-by-count":0,"title":["Uniform generation of forests of restricted height"],"prefix":"10.1016","volume":"50","author":[{"given":"M.D.","family":"Atkinson","sequence":"first","affiliation":[]},{"given":"J.-R.","family":"Sack","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00054-9_BIB1","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1145\/357084.357091","article-title":"Uniform random number generation of n balanced parenthesis strings","volume":"2","author":"Arnold","year":"1980","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/0020-0190(94)00054-9_BIB2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0020-0190(92)90075-7","article-title":"Generating binary trees at random","volume":"41","author":"Atkinson","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)00054-9_BIB3","article-title":"Uniform generation of combinatorial objects in parallel","author":"Atkinson","year":"1993","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/0020-0190(94)00054-9_BIB4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1287\/moor.9.1.43","article-title":"On random binary trees","volume":"9","author":"Brown","year":"1984","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0020-0190(94)00054-9_BIB5","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0022-0000(82)90004-6","article-title":"The average height of binary and other simple trees","volume":"25","author":"Flajolet","year":"1982","journal-title":"J. Comput. and System Sci."},{"key":"10.1016\/0020-0190(94)00054-9_BIB6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-57273-2_53","article-title":"A calculus of random generation","volume":"726","author":"Flajolet","year":"1993"},{"issue":"4","key":"10.1016\/0020-0190(94)00054-9_BIB7","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1137\/0212044","article-title":"Uniform random generation of strings in a context-free language","volume":"12","author":"Hickey","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)00054-9_BIB8","series-title":"Semi-numerical Algorithms, The Art of Computer Programming, Vol. 2","author":"Knuth","year":"1981"},{"issue":"6","key":"10.1016\/0020-0190(94)00054-9_BIB9","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0020-0190(93)90039-C","article-title":"Counting and randomly generating binary trees","volume":"45","author":"Korsh","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)00054-9_BIB10","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)00054-9_BIB11","series-title":"Computing Trends in the 1990's, ACM 17th Computer Science Conf.","first-page":"33","article-title":"A random binary tree generator","author":"Martin","year":"1989"},{"key":"10.1016\/0020-0190(94)00054-9_BIB12","series-title":"Combinatorial Algorithms","author":"Nijenhuis","year":"1978"},{"key":"10.1016\/0020-0190(94)00054-9_BIB13","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1145\/128749.128753","article-title":"The generation of binary trees as a numerical problem","volume":"39","author":"Sprugnoli","year":"1992","journal-title":"J. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000549?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000549?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:50:51Z","timestamp":1555145451000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094000549"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":13,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["0020019094000549"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00054-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}