![]() |
Discrete Mathematics & Theoretical Computer Science |
Generalizing an idea used by Alonso to generate uniformly at random Motzkin words, we outline an approach to build efficient random generators using binomial distributions and rejection algorithms. As an application of this method, we present random generators, both efficient and easy to implement, for partial injections and colored unary-binary trees.
Source : ScholeXplorer
IsRelatedTo ARXIV 1411.6698 Source : ScholeXplorer IsRelatedTo DOI 10.1016/j.aam.2017.06.005 Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.1411.6698
|