Skip to Main content Skip to Navigation


...
hal-02101877v1  Reports
Philippe DuchonNicolas HanusseEmmanuelle LebharNicolas Schabanel. Could any graph be turned into a small-world?
[Research Report] LIP RR-2004-61, Laboratoire de l'informatique du parallélisme. 2004, 2+7p
...
hal-00618319v1  Journal articles
Jean-Christophe AvalPhilippe Duchon. Half-turn symmetric FPLs with rare couplings and tilings of hexagons
Theoretical Computer Science, Elsevier, 2013, 502, pp.143-152
...
hal-01015603v1  Poster communications
Olivier DevillersPhilippe DuchonRémy Thomasse. A generator of random convex polygons in a disc
AofA 2014- 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Jun 2014, Paris, France
hal-00307148v1  Conference papers
Philippe DuchonNicole EggemannNicolas Hanusse. Non-searchability of random power-law graphs
11th International Conference On Principles Of Distributed Systems (OPODIS 2007), 2007, France. pp.274--285
hal-00307149v1  Conference papers
Philippe DuchonNicolas HanusseEmmanuelle LebharNicolas Schabanel. Towards Small World Emergence
SPAA2006 - 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Jul 2006, United States. pp.225-232
inria-00100938v1  Conference papers
Philippe DuchonPhilippe FlajoletGuy LouchardGilles Schaeffer. Random Sampling from Boltzmann principles
29th International Colloquium on Automata, Languages and Programming - ICALP'2002, Nov 2002, Malaga, Spain, pp.501-513
...
hal-02102237v1  Reports
Philippe DuchonNicolas HanusseEmmanuelle LebharNicolas Schabanel. A fully distributed scheme to run a network into a small world
[Research Report] LIP RR-2006-03, Laboratoire de l'informatique du parallélisme. 2006, 2+13p
...
hal-00654267v1  Conference papers
Philippe Duchon. Random generation of combinatorial structures: Boltzmann samplers and beyond
Winter Simulation Conference, Dec 2011, Phoenix, United States
...
inria-00585254v1  Conference papers
Olivier BeaumontNicolas BonichonPhilippe DuchonHubert Larchevêque. Utilisation d'outils de plongement d'Internet pour l'agrégation de ressources hétérogènes
Conférence : 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France
...
inria-00588650v1  Conference papers
Olivier BeaumontNicolas BonichonPhilippe DuchonHubert Larchevêque. Use of Internet Embedding Tools for Heterogeneous Resources Aggregation
Heterogeneity in Computing Workshop (HCW) - in IPDPS 2011, May 2011, Anchorage, United States. pp.114-124
hal-00307150v1  Journal articles
Philippe DuchonNicolas HanusseEmmanuelle LebharNicolas Schabanel. Could any graph be turned into a small-world?
Theoretical Computer Science, Elsevier, 2006, 355, pp.96--103
hal-00307532v1  Conference papers
Philippe DuchonNicolas HanusseEmmanuelle LebharNicolas Schabanel. Could any graph be turned into a small-world ?
Actes d'AlgoTel'2005 (conférence francophone sur les algorithmes de communications), May 2005, France. pp.511-513
...
inria-00547935v1  Conference papers
Philippe DuchonLarchevêque Hubert. On the search path length of random binary skip graphs
ANALCO 2010, Golin, Mordecai and Sedgewick, Robert, Jan 2010, Austin, United States. pp.1-8
...
inria-00142778v2  Conference papers
Olivier BeaumontPhilippe DuchonMiroslaw Korzeniowski. Heterogenous dating service with application to rumor spreading
IEEE International Symposium on Parallel and Distributed Processing, 2008. IPDPS 2008., IEEE, Apr 2008, Miami, FL, United States. pp 1--10, ⟨10.1109/IPDPS.2008.4536294⟩