Martin Pépin

About me

me

Since the 1st September 2023, I am a French “maître de conférences” (≈ lecturer) at GREYC (Unicaen (Université Caen Normandie) in the Amacc team. Before that I did a post-doc with Olivier Bodini at LIPN in the CALIN team, a post-doc with Thomas Ehrhard at IRIF in the “Algèbre et Calcul” group, and I did my PhD at LIP6 (Sorbonne Université) in the APR team under the supervision of Antoine Genitrini and Frederic Peschanski. My research revolves around the study of programming concepts under the lens of combinatorics, providing theoretical and algorithmic tools to analyse them. In particular, I develop efficient (uniform) random generation algorithms to experiment with and test complex systems that would be hard to tackle exhaustively.

I also like to program a lot, for fun and also as a research activity. I consider it to be a real part of research to provide a clean and usable implementation of the algorithms and ideas we develop; and I dedicate a good part of my time to it.

PhD thesis

I defended my PhD thesis, entitled "Quantitative and algorithmic analysis of concurrent programs", on Wednesday, September 29th 2021 in Paris. The most up-to-date version of the manuscript is available here.

Contact:

Publications

Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs

Martin Pépin, Alfredo Viola

To appeard soon in the Electronic Journal of Combinatorics

[HAL] [arXiv] [PDF]

An Efficient and Uniform CSP Solution Generator Generator

Ghiles Ziat, Martin Pépin

Proceedings of the 31st International Conference on Principles and Practice of Constraint Programming (CP 2025)

[DOI] [PDF]

Random Generation of Git Graphs

Julien Courtiel, Martin Pépin

Proceedings of the GASCOM 2024 conference (Random Generation of Combinatorial Structures)

[HAL] [PDF] [DOI]

Uniform SAmplINg with BOLTZmann [tool paper]

Matthieu Dien, Martin Pépin

SYNASC 2023 - 25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

[HAL] [PDF] [DOI]

Automatic Synthesis of Random Generators for Numerically Constrained Algebraic Recursive Types

Ghiles Ziat, Vincent Botbol, Matthieu Dien, Arnaud Gotlieb, Martin Pépin, Catherine Dubois

Accepted for presentation at LOPSTR 2022

[HAL] [arXiv]

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

Theoretical Computer Science 2021, 912

[HAL] [PDF] [DOI]

Lexicographic unranking of combinations revisited

Antoine Genitrini, Martin Pépin

Algorithms 2021, 14(3), 97

[HAL] [PDF] [DOI]

Unlabelled ordered DAGs and labelled DAGs: constructive enumeration and uniform random sampling

Antoine Genitrini, Martin Pépin, Alfredo Viola

LAGOS 2021 - XI Latin and American Algorithms, Graphs and Optimization Symposium

[HAL] [PDF] [DOI]

Statistical Analysis of Non-Deterministic Fork-join Processes

Antoine Genitrini, Martin Pépin, Frédéric Peschanski

ICTAC 2020 - 17th International Colloquium on Theoretical Aspects of Computing

[HAL] [PDF] [DOI]

Talks

Directed Ordered Acyclic Graphs - Enumeration, uniform sampling and links with classical labelled DAGs

November 2022 Séminaire CALIN [slides]

Statistical Analysis of Non-Deterministic Fork-join Processes

December 2020 ICTAC'20 [slides]

Software

A short and non-exhaustive list of softwares I have developed or contributed to as part of my research: Other non research-related projects can be found on my GitHub, the GitHub of « Les Boloss⋅es », and on the ENS gitlab.