The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

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

Publications of Author

  1. Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer
    Random Sampling from Boltzmann Principles. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:501-513 [Conf]
  2. Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel
    Towards small world emergence. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:225-232 [Conf]
  3. Philippe Duchon, Nicolas Hanusse, Nasser Saheb, Akka Zemmari
    Broadcast in the Rendezvous Model. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:559-570 [Conf]
  4. Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel
    Could any Graph be Turned into a Small-World?. [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:511-513 [Conf]
  5. Philippe Duchon, Nicolas Hanusse, Sébastien Tixeuil
    Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings. [Citation Graph (0, 0)][DBLP]
    DISC, 2004, pp:216-229 [Conf]
  6. Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer
    Boltzmann Samplers for the Random Generation of Combinatorial Structures. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:13, n:4-5, pp:577-625 [Journal]
  7. Philippe Duchon
    On the enumeration and generation of generalized Dyck words. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:225, n:1-3, pp:121-135 [Journal]
  8. Philippe Duchon
    Right-cancellability of a family of operations on binary trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 1998, v:2, n:1, pp:27-33 [Journal]
  9. Philippe Duchon, Nicolas Hanusse, Nasser Saheb, Akka Zemmari
    Broadcast in the rendezvous model. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:5, pp:697-712 [Journal]
  10. Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel
    Could any graph be turned into a small-world? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:355, n:1, pp:96-103 [Journal]
  11. Philippe Duchon, Nicole Eggemann, Nicolas Hanusse
    Non-searchability of random scale-free graphs. [Citation Graph (0, 0)][DBLP]
    PODC, 2007, pp:380-381 [Conf]

  12. Heterogenous dating service with application to rumor spreading. [Citation Graph (, )][DBLP]


  13. Non-Searchability of Random Power-Law Graphs. [Citation Graph (, )][DBLP]


  14. A Distributed Algorithm for Resource Clustering in Large Scale Platforms. [Citation Graph (, )][DBLP]


  15. Distributed Approximation Algorithm for Resource Clustering. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
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