2 code implementations • 3 Aug 2017 • Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
Boltzmann samplers and the recursive method are prominent algorithmic frameworks for the approximate-size and exact-size random generation of large combinatorial structures, such as maps, tilings, RNA sequences or various tree-like structures.
Combinatorics Computational Complexity Data Structures and Algorithms Optimization and Control Probability
2 code implementations • 13 Aug 2015 • Axel Bacher, Olivier Bodini, Alexandros Hollender, Jérémie Lumbroso
We also show how it is possible to further reduce the number of random bits consumed, by introducing a second algorithm BalancedShuffle, a variant of the Rao-Sandelius algorithm which is more conservative in the way it recursively partitions arrays to be shuffled.
Data Structures and Algorithms Discrete Mathematics
