The average complexity of a coin-weighing problem. - Laurent Alonso; Philippe Chassaing; René Schott (Random Struct. Algorithms, 1996)

Real-Time Problem-Solving with Contract Algorithms. - Shlomo Zilberstein; François Charpillet; Philippe Chassaing (IJCAI, 1999)

Parking Functions, Empirical Processes, and the Width of Rooted Labeled Trees. - Philippe Chassaing; Jean-François Marckert (Electron. J. Comb., 2001)

Reflected Brownian Bridge area conditioned on its local time at the origin. - Philippe Chassaing; Guy Louchard (J. Algorithms, 2002)

Phase transition for Parking blocks, Brownian excursion and coalescence. - Philippe Chassaing; Guy Louchard (Random Struct. Algorithms, 2002)

Optimal Sequencing of Contract Algorithms. - Shlomo Zilberstein; François Charpillet; Philippe Chassaing (Ann. Math. Artif. Intell., 2003)

Merging costs for the additive Marcus-Lushnikov process, and Union-Find algorithms - Philippe Chassaing; Régine Marchand (CoRR, 2004)

Quicksort with Unreliable Comparisons: A Probabilistic Analysis. - Laurent Alonso; Philippe Chassaing; Florent Gillet; Svante Janson; Edward M. Reingold; René Schott (Comb. Probab. Comput., 2004)

The worst-case chip problem. - Laurent Alonso; Philippe Chassaing; Edward M. Reingold; René Schott (Inf. Process. Lett., 2004)

On the convergence of population protocols when population goes to infinity. - Olivier Bournez; Philippe Chassaing; Johanne Cohen; Lucas Gerin; Xavier Koegler (Appl. Math. Comput., 2009)

A non-ergodic PCA with a unique invariant measure - Philippe Chassaing; Jean Mairesse (CoRR, 2010)

The impatient collector. - Anis Amri; Philippe Chassaing (CoRR, 2019)

Asymptotic behavior of some factorizations of random words. - Elahe Zohoorian Azad; Philippe Chassaing (Random Struct. Algorithms, 2022)