Uniform generation of forests of restricted height
- 27 June 1994
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 50 (6) , 323-327
- https://doi.org/10.1016/0020-0190(94)00054-9
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Counting and randomly generating binary treesInformation Processing Letters, 1993
- A calculus of random generationPublished by Springer Nature ,1993
- The generation of binary trees as a numerical problemJournal of the ACM, 1992
- Generating binary trees at randomInformation Processing Letters, 1992
- Generating binary trees of bounded heightActa Informatica, 1986
- On Random Binary TreesMathematics of Operations Research, 1984
- Uniform Random Generation of Strings in a Context-Free LanguageSIAM Journal on Computing, 1983
- The average height of binary trees and other simple treesJournal of Computer and System Sciences, 1982
- Uniform Random Generation of Balanced Parenthesis StringsACM Transactions on Programming Languages and Systems, 1980