Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Philippe Duchon
2010 – today
- 2013
[c14]Olivier Bodini, Philippe Duchon, Alice Jacquot, Ljuben R. Mutafchiev: Asymptotic Analysis and Random Sampling of Digitally Convex Polyominoes. DGCI 2013: 95-106- [i2]Olivier Beaumont, Philippe Duchon, Paul Renaud-Goud: Approximation Algorithms for Energy Minimization in Cloud Service Allocation under Reliability Constraints. CoRR abs/1302.4414 (2013)
- 2011
- [c13]Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Hubert Larchevêque: Use of Internet Embedding Tools for Heterogeneous Resources Aggregation. IPDPS Workshops 2011: 114-124
- [c12]Philippe Duchon: Random generation of combinatorial structures: Boltzmann samplers and beyond. Winter Simulation Conference 2011: 120-132
- [i1]Philippe Duchon: Random generation of combinatorial structures: Boltzmann samplers and beyond. CoRR abs/1112.5071 (2011)
- 2010
- [j6]Jean-Christophe Aval, Philippe Duchon: Enumeration of Alternating Sign Matrices of Even Size (Quasi-)Invariant under a Quarter-Turn Rotation. Electr. J. Comb. 17(1) (2010)
- [c11]Philippe Duchon, Hubert Larchevêque: On the Search Path Length of Random Binary Skip Graphs. ANALCO 2010: 1-8
2000 – 2009
- 2008
- [c10]Olivier Beaumont, Philippe Duchon, Miroslaw Korzeniowski: Heterogenous dating service with application to rumor spreading. IPDPS 2008: 1-10
- [c9]Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Lionel Eyraud-Dubois, Hubert Larchevêque: A Distributed Algorithm for Resource Clustering in Large Scale Platforms. OPODIS 2008: 564-567
- [c8]Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Hubert Larchevêque: Distributed Approximation Algorithm for Resource Clustering. SIROCCO 2008: 61-73
- 2007
- [c7]Philippe Duchon, Nicole Eggemann, Nicolas Hanusse: Non-Searchability of Random Power-Law Graphs. OPODIS 2007: 274-285
- [c6]Philippe Duchon, Nicole Eggemann, Nicolas Hanusse: Non-searchability of random scale-free graphs. PODC 2007: 380-381
- 2006
- [j5]Philippe Duchon, Nicolas Hanusse, Nasser Saheb, Akka Zemmari: Broadcast in the rendezvous model. Inf. Comput. 204(5): 697-712 (2006)
- [j4]Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel: Could any graph be turned into a small-world? Theor. Comput. Sci. 355(1): 96-103 (2006)
- [c5]Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel: Towards small world emergence. SPAA 2006: 225-232
- 2005
- [c4]Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel: Could any Graph be Turned into a Small-World?. DISC 2005: 511-513
- 2004
- [j3]Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer: Boltzmann Samplers for the Random Generation of Combinatorial Structures. Combinatorics, Probability & Computing 13(4-5): 577-625 (2004)
- [c3]Philippe Duchon, Nicolas Hanusse, Nasser Saheb, Akka Zemmari: Broadcast in the Rendezvous Model. STACS 2004: 559-570
- [c2]Philippe Duchon, Nicolas Hanusse, Sébastien Tixeuil: Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings. DISC 2004: 216-229
- 2002
- [c1]Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer: Random Sampling from Boltzmann Principles. ICALP 2002: 501-513
- 2000
- [j2]Philippe Duchon: On the enumeration and generation of generalized Dyck words. Discrete Mathematics 225(1-3): 121-135 (2000)
1990 – 1999
- 1998
- [j1]Philippe Duchon: Right-cancellability of a family of operations on binary trees. Discrete Mathematics & Theoretical Computer Science 2(1): 27-33 (1998)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-16 02:32 CEST by the dblp team