The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Philippe Chassaing: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Shlomo Zilberstein, François Charpillet, Philippe Chassaing
    Real-Time Problem-Solving with Contract Algorithms. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1999, pp:1008-1015 [Conf]
  2. 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:1-2, pp:1-18 [Journal]
  3. Philippe Chassaing, Jean-Franç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]
  4. Philippe Chassaing, Regine Marchand
    Merging costs for the additive Marcus-Lushnikov process, and Union-Find algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  5. 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:4-5, pp:419-449 [Journal]
  6. Laurent Alonso, Philippe Chassaing, Edward M. Reingold, René Schott
    The worst-case chip problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:6, pp:303-308 [Journal]
  7. 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:29-51 [Journal]
  8. Laurent Alonso, Philippe Chassaing, René Schott
    The average complexity of a coin-weighing problem. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:1-2, pp:1-14 [Journal]
  9. 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:76-119 [Journal]

  10. On the Convergence of Population Protocols When Population Goes to Infinity [Citation Graph (, )][DBLP]


Search in 0.042secs, Finished in 0.043secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002