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

MaRDI QIDQ6429812zbMATH OpenFDO

Authors L. Alonso

Publication date 16 March 2023

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

This page was built for publication: Uniform random generations and rejection method(I) with binomial majorant

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6429812)