Uniform random generations and rejection method(I) with binomial majorant

Laurent Alonso

Mar 2023

摘要

We present three simple algorithms to uniformly generate `Fibonacci words'(i.e., some words that are enumerated by Fibonacci numbers), Schr{\"o}der treesof size $n$ and Motzkin left factors of size $n$ and final height $h$. Thesealgorithms have an average complexity of $O(n)$ in the unit-cost RAM model.

展开全部

图表提取

论文十问

参考文献

被引用

提问与回答

暂无人提供速读十问回答

被引用

笔记

问答

领域