Olivier Bodini

Asymptotics and random sampling for BCI and BCK lambda terms

This paper presents a bijection between combinatorial maps and a class of enriched trees, corresponding to a class of expression trees in some logical systems (constrained lambda terms). Starting from two alternative definitions of combinatorial maps: the classical definition by gluing half-edges, and a definition by non-ambiguous depth-first traversal, we derive non-trivial asymptotic expansions and efficient random generation of logic formulae (syntactic trees) in the BCI or BCK systems.

Efficient random sampling of binary and unary-binary trees via holonomic equations

We present a new uniform random sampler for binary trees with

A characterization of flip-accessibility for rhombus tilings of the whole plane

n

Boys-and-girls Birthdays and Hadamard Products

internal nodes consuming

On the Number of Unary-Binary Tree-Like Structures with Restrictions on the Unary Height

2n + \Theta(\log(n)^2)

Generating Random Permutations by Coin Tossing: Classical Algorithms, New Analysis, and Modern Implementation

random bits on average. This makes it quasi-optimal and out-performs the classical Remy algorithm. We also present a sampler for unary-binary trees with

Pointed versus Singular Boltzmann Samplers: a Comparative Analysis

n

Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets

nodes taking

Associativity for Binary Parallel Processes: a Quantitative Study

\Theta(n)

Asymptotic analysis and random sampling of digitally convex polyominoes

random bits on average. Both are the first linear-time algorithms to be optimal up to a constant.