| 2004 |
|---|
| 9 | EE | Philippe Chassaing,
Regine Marchand:
Merging costs for the additive Marcus-Lushnikov process, and Union-Find algorithms
CoRR math.PR/0406094: (2004) |
| 8 | EE | Laurent Alonso,
Philippe Chassaing,
Florent Gillet,
Svante Janson,
Edward M. Reingold,
René Schott:
Quicksort with Unreliable Comparisons: A Probabilistic Analysis.
Combinatorics, Probability & Computing 13(4-5): 419-449 (2004) |
| 7 | EE | Laurent Alonso,
Philippe Chassaing,
Edward M. Reingold,
René Schott:
The worst-case chip problem.
Inf. Process. Lett. 89(6): 303-308 (2004) |
| 2003 |
|---|
| 6 | | Shlomo Zilberstein,
François Charpillet,
Philippe Chassaing:
Optimal Sequencing of Contract Algorithms.
Ann. Math. Artif. Intell. 39(1-2): 1-18 (2003) |
| 2002 |
|---|
| 5 | EE | Philippe Chassaing,
Guy Louchard:
Reflected Brownian Bridge area conditioned on its local time at the origin.
J. Algorithms 44(1): 29-51 (2002) |
| 4 | EE | Philippe Chassaing,
Guy Louchard:
Phase transition for Parking blocks, Brownian excursion and coalescence.
Random Struct. Algorithms 21(1): 76-119 (2002) |
| 2001 |
|---|
| 3 | EE | Philippe Chassaing,
Jean-François Marckert:
Parking Functions, Empirical Processes, and the Width of Rooted Labeled Trees.
Electr. J. Comb. 8(1): (2001) |
| 1999 |
|---|
| 2 | | Shlomo Zilberstein,
François Charpillet,
Philippe Chassaing:
Real-Time Problem-Solving with Contract Algorithms.
IJCAI 1999: 1008-1015 |
| 1996 |
|---|
| 1 | | Laurent Alonso,
Philippe Chassaing,
René Schott:
The average complexity of a coin-weighing problem.
Random Struct. Algorithms 9(1-2): 1-14 (1996) |
