In the framework of analytic combinatorics, Boltzmann models give rise to efficient
algorithms for the random generation of combinatorial objects. This paper proposes an …

Language models that use interleaving, or shuffle, operators have applications in various
areas of computer science, including system verification, plan recognition, and natural …

This paper is devoted to the construction of Boltzmann samplers according to various
distributions, and uses stochastic bias on the parameter of a Boltzmann sampler, to produce …

In this paper, we study the shuffle operator on concurrent processes (represented as trees)
using analytic combinatorics tools. As a first result, we show that the mean width of shuffle …

We study the combinatorial structure of concurrent programs with non-deterministic choice
and a fork-join style of coordination. As a first step we establish a link between these …

We study concurrent processes with non-deterministic choice, loops and a fork-join style of
coordination under the lens of combinatorics. As a starting point, we interpret these …

We study the combinatorial structure of concurrent programs with non-deterministic choice
and a fork-join style of coordination. As a first step we establish a link between these …

Statistical Analysis of Non-Deterministic Fork-Join Processes Page 1 Statistical Analysis of
Non-Deterministic Fork-Join Processes Martin Pépin Joint work with Antoine Genitrini & Frédéric …

Diese Arbeit behandelt das Problem der effizienten Erzeugung von Objekten
kombinatorischer Strukturen. Diese Generatoren, sogenannte Boltzmann-Sampler …

Résumé Une carte généralisée est un modèle topologique permettant de représenter
implicitement un ensemble de cellules (sommets, arêtes, faces, volumes,...) ainsi que …