Right-cancellability of a family of operations on binary trees. - Philippe Duchon (Discret. Math. Theor. Comput. Sci., 1998)

On the enumeration and generation of generalized Dyck words. - Philippe Duchon (Discret. Math., 2000)

Random Sampling from Boltzmann Principles. - Philippe Duchon; Philippe Flajolet; Guy Louchard; Gilles Schaeffer (ICALP, 2002)

Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings. - Philippe Duchon; Nicolas Hanusse; Sébastien Tixeuil (DISC, 2004)

Boltzmann Samplers for the Random Generation of Combinatorial Structures. - Philippe Duchon; Philippe Flajolet; Guy Louchard; Gilles Schaeffer (Comb. Probab. Comput., 2004)

Towards small world emergence. - Philippe Duchon; Nicolas Hanusse; Emmanuelle Lebhar; Nicolas Schabanel (SPAA, 2006)

Broadcast in the rendezvous model. - Philippe Duchon; Nicolas Hanusse; Nasser Saheb; Akka Zemmari (Inf. Comput., 2006)

Could any graph be turned into a small-world? - Philippe Duchon; Nicolas Hanusse; Emmanuelle Lebhar; Nicolas Schabanel (Theor. Comput. Sci., 2006)

Non-Searchability of Random Power-Law Graphs. - Philippe Duchon; Nicole Eggemann; Nicolas Hanusse (OPODIS, 2007)

Non-searchability of random scale-free graphs. - Philippe Duchon; Nicole Eggemann; Nicolas Hanusse (PODC, 2007)

Combinatoire des configurations de boucles compactes. (Combinatorics of fully-packed loop configurations). - Philippe Duchon (2008)

Heterogenous dating service with application to rumor spreading. - Olivier Beaumont; Philippe Duchon; Miroslaw Korzeniowski (IPDPS, 2008)

A Distributed Algorithm for Resource Clustering in Large Scale Platforms. - Olivier Beaumont; Nicolas Bonichon; Philippe Duchon; Lionel Eyraud-Dubois; Hubert Larchevêque (OPODIS, 2008)

Distributed Approximation Algorithm for Resource Clustering. - Olivier Beaumont; Nicolas Bonichon; Philippe Duchon; Hubert Larchevêque (SIROCCO, 2008)

On the Search Path Length of Random Binary Skip Graphs. - Philippe Duchon; Hubert Larchevêque (ANALCO, 2010)

Enumeration of Alternating Sign Matrices of Even Size (Quasi-)Invariant under a Quarter-Turn Rotation. - Jean-Christophe Aval; Philippe Duchon (Electron. J. Comb., 2010)

Use of Internet Embedding Tools for Heterogeneous Resources Aggregation. - Olivier Beaumont; Nicolas Bonichon; Philippe Duchon; Hubert Larchevêque (IPDPS Workshops, 2011)

Random generation of combinatorial structures: Boltzmann samplers and beyond. - Philippe Duchon (WSC, 2011)

Asymptotic Analysis and Random Sampling of Digitally Convex Polyominoes. - Olivier Bodini; Philippe Duchon; Alice Jacquot; Ljuben R. Mutafchiev (DGCI, 2013)

Approximation algorithms for energy minimization in Cloud service allocation under reliability constraints. - Olivier Beaumont; Philippe Duchon; Paul Renaud-Goud (HiPC, 2013)

Half-turn symmetric FPLs with rare couplings and tilings of hexagons. - Jean-Christophe Aval; Philippe Duchon (Theor. Comput. Sci., 2013)

Local Update Algorithms for Random Graphs. - Philippe Duchon; Romaric Duvignau (LATIN, 2014)

Preserving the Number of Cycles of Length k in a Growing Uniform Permutation. - Philippe Duchon; Romaric Duvignau (Electron. J. Comb., 2016)

Gapped Pattern Statistics. - Philippe Duchon; Cyril Nicaud; Carine Pivoteau (CPM, 2017)

On the Expected Number of Distinct Gapped Palindromic Factors. - Philippe Duchon; Cyril Nicaud (IWOCA, 2018)

On the Biased Partial Word Collector Problem. - Philippe Duchon; Cyril Nicaud (LATIN, 2018)

On Order Types of Random Point Sets. - Olivier Devillers; Philippe Duchon; Marc Glisse; Xavier Goaoc (CoRR, 2018)

Symmetric Block-Cyclic Distribution: Fewer Communications Leads to Faster Dense Cholesky Factorization. - Olivier Beaumont; Philippe Duchon; Lionel Eyraud-Dubois; Julien Langou; Mathieu Vérité (SC, 2022)

One Drop of Non-Determinism in a Random Deterministic Automaton. - Arnaud Carayol; Philippe Duchon; Florent Koechlin; Cyril Nicaud (STACS, 2023)

Random DFA With One Added Transition. - Arnaud Carayol; Philippe Duchon; Florent Koechlin; Cyril Nicaud (CoRR, 2024)

Random Deterministic Automata With One Added Transition. - Arnaud Carayol; Philippe Duchon; Florent Koechlin; Cyril Nicaud (Log. Methods Comput. Sci., 2025)