| Lexicographic unranking of combinations revisited A Genitrini, M Pépin Algorithms 14 (3), 97, 2021 | 17 | 2021 |
| Unlabelled ordered DAGs and labelled DAGs: constructive enumeration and uniform random sampling A Genitrini, M Pépin, A Viola Procedia Computer Science 195, 468-477, 2021 | 3 | 2021 |
| Quantitative and algorithmic analysis of concurrent programs M Pépin Sorbonne Université, 2021 | 1 | 2021 |
| Statistical analysis of non-deterministic fork-join processes A Genitrini, M Pépin, F Peschanski International Colloquium on Theoretical Aspects of Computing, 83-102, 2020 | 1 | 2020 |
| Random Generation of Git Graphs J Courtiel, M Pépin arXiv preprint arXiv:2403.01902, 2024 | | 2024 |
| Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs M Pépin, A Viola arXiv preprint arXiv:2303.14710, 2023 | | 2023 |
| Automatic Synthesis of Random Generators for Numerically Constrained Algebraic Recursive Types V Botbol, G Ziat, M Dien, A Gotlieb, M Pépin, C Dubois 32nd International Symposium on Logic-Based Program Synthesis and …, 2022 | | 2022 |
| Automatic Synthesis of Random Generators for Numerically Constrained Algebraic Recursive Types G Ziat, V Botbol, M Dien, A Gotlieb, M Pépin, C Dubois arXiv preprint arXiv:2208.12747, 2022 | | 2022 |
| A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space A Genitrini, M Pépin, F Peschanski Theoretical Computer Science 912, 1-36, 2022 | | 2022 |
| Statistical Analysis of Non-Deterministic Fork-Join Processes M Pépin, A Genitrini, F Peschanski | | 2020 |
| Appendices to the Paper “Random Generation of Git Graphs” J Courtiel, M Pépin | | |
| Uniform SAmplINg with BOLTZmann M Dien, M Pépin | | |
