2 papers
cs.DM2026
Entropic Generation of Binary Words
Olivier Bodini, Francis Durand
The uniform generation of k Hamming weight binary words, equivalent to sampling k-subsets from n elements, relies on random bits, which can be expensive. We introduce a novel parad…
cs.DS2024
Optimal Generation of Strictly Increasing Binary Trees and Beyond
Olivier Bodini, Francis Durand, Philippe Marchal
This article presents two novel algorithms for generating random increasing trees. The first algorithm efficiently generates strictly increasing binary trees using an ad hoc method…