Statistical Analysis of Non-deterministic Fork-Join Processes. - Antoine Genitrini; Martin Pépin; Frédéric Peschanski (ICTAC, 2020)

Unlabelled ordered DAGs and labelled DAGs: constructive enumeration and uniform random sampling. - Antoine Genitrini; Martin Pépin; Alfredo Viola (LAGOS, 2021)

Lexicographic Unranking of Combinations Revisited. - Antoine Genitrini; Martin Pépin (Algorithms, 2021)

Quantitative and algorithmic analysis of concurrent programs. (Analyse quantitative et algorithmique des programmes concurrents). - Martin Pépin (2021)

Automatic Synthesis of Random Generators for Numerically Constrained Algebraic Recursive Types. - Ghiles Ziat; Vincent Botbol; Matthieu Dien; Arnaud Gotlieb; Martin Pépin; Catherine Dubois (CoRR, 2022)

A quantitative study of fork-join processes with non-deterministic choice: Application to the statistical exploration of the state-space. - Antoine Genitrini; Martin Pépin; Frédéric Peschanski (Theor. Comput. Sci., 2022)

Uniform SAmplINg with BOLTZmann. - Matthieu Dien; Martin Pépin (SYNASC, 2023)

Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs. - Martin Pépin; Alfredo Viola (CoRR, 2023)

Performance analysis of DPDK-based applications through tracing. - Adel Belkhiri; Martin Pépin; Mike Bly; Michel R. Dagenais (J. Parallel Distributed Comput., 2023)

Random Generation of Git Graphs. - Julien Courtiel; Martin Pépin (GASCom, 2024)

An Efficient and Uniform CSP Solution Generator Generator. - Ghiles Ziat; Martin Pépin (CP, 2025)