1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DM2023★ 1 cited
Uniform random generations and rejection method(I) with binomial majorant
Laurent Alonso
We present three simple algorithms to uniformly generate `Fibonacci words' (i.e., some words that are enumerated by Fibonacci numbers), Schr{ö}der trees of size and Motzkin lef…
math.PR2003
Quicksort with unreliable comparisons: a probabilistic analysis
L. Alonso, P. Chassaing, F. Gillet +3
We provide a probabilistic analysis of the output of Quicksort when comparisons can err.