
Search the dblp DataBase
Philippe Chassaing:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Shlomo Zilberstein, François Charpillet, Philippe Chassaing
RealTime ProblemSolving with Contract Algorithms. [Citation Graph (0, 0)][DBLP] IJCAI, 1999, pp:10081015 [Conf]
 Shlomo Zilberstein, François Charpillet, Philippe Chassaing
Optimal Sequencing of Contract Algorithms. [Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 2003, v:39, n:12, pp:118 [Journal]
 Philippe Chassaing, JeanFrançois Marckert
Parking Functions, Empirical Processes, and the Width of Rooted Labeled Trees. [Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2001, v:8, n:1, pp: [Journal]
 Philippe Chassaing, Regine Marchand
Merging costs for the additive MarcusLushnikov process, and UnionFind algorithms [Citation Graph (0, 0)][DBLP] CoRR, 2004, v:0, n:, pp: [Journal]
 Laurent Alonso, Philippe Chassaing, Florent Gillet, Svante Janson, Edward M. Reingold, René Schott
Quicksort with Unreliable Comparisons: A Probabilistic Analysis. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2004, v:13, n:45, pp:419449 [Journal]
 Laurent Alonso, Philippe Chassaing, Edward M. Reingold, René Schott
The worstcase chip problem. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:89, n:6, pp:303308 [Journal]
 Philippe Chassaing, Guy Louchard
Reflected Brownian Bridge area conditioned on its local time at the origin. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2002, v:44, n:1, pp:2951 [Journal]
 Laurent Alonso, Philippe Chassaing, René Schott
The average complexity of a coinweighing problem. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1996, v:9, n:12, pp:114 [Journal]
 Philippe Chassaing, Guy Louchard
Phase transition for Parking blocks, Brownian excursion and coalescence. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2002, v:21, n:1, pp:76119 [Journal]
On the Convergence of Population Protocols When Population Goes to Infinity [Citation Graph (, )][DBLP]
Search in 0.042secs, Finished in 0.043secs
