 |
 |
 |
|
|
||
|---|---|---|
| inria-00628312v1
Preprints, Working Papers, ...
Fast Generation and Mixing of Random Graphs in Peer-to-Peer Networks 2011 |
||
| hal-02101877v1
Reports
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
Half-turn symmetric FPLs with rare couplings and tilings of hexagons Theoretical Computer Science, Elsevier, 2013, 502, pp.143-152 |
||
| hal-00943409v1
Reports
A generator of random convex polygons in a disc [Research Report] RR-8467, INRIA. 2014, pp.9 |
||
| hal-01015603v1
Poster communications
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 |
||
| |
||
| inria-00369417v1
Reports
A Distributed Algorithm for Resource Clustering in Large Scale Platforms [Research Report] RR-6883, INRIA. 2008 |
||
| hal-03643569v2
Software
Experimental code and results for the paper "Symmetric Block-Cyclic Distribution: Fewer Communications leads to Faster Dense Cholesky Factorization 2022, ⟨swh:1:dir:ec92870dfc2a7e7c8a6e87914823e25bc651a5b7;origin=https://hal.archives-ouvertes.fr/hal-03643569;visit=swh:1:snp:6b8402b24d2133d01fc48d0f01d83f605cc77898;anchor=swh:1:rel:3068c5a3c30d3a673a553d033029929a03ddb4cf;path=/⟩ |
||
| hal-00788964v3
Conference papers
Approximation Algorithms for Energy Minimization in Cloud Service Allocation under Reliability Constraints HIgh Performance Computing, Dec 2013, Bengalore, India. pp.20 |
||
| hal-00307148v1
Conference papers
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
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
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
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-00396449v1
Conference papers
Distributed Approximation Algorithm for Resource Clustering Opodis 2008, 2008, Luxor, Egypt. pp.564--567, ⟨10.1007/978-3-540-92221-6_41⟩  |
||
| hal-00832016v1
Journal articles
Asymptotic Analysis and Random Sampling of Digitally Convex Polyominoes Discrete Applied Mathematics, Elsevier, 2013, pp.1-23 |
||
| hal-00341490v1
Conference papers
Non-searchability of random scale-free graphs PODC'2007, 2007, France. pp.380-381, ⟨10.1145/1281100.1281183⟩ |
||
| hal-00654267v1
Conference papers
Random generation of combinatorial structures: Boltzmann samplers and beyond Winter Simulation Conference, Dec 2011, Phoenix, United States |
||
| inria-00585254v1
Conference papers
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
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-00323068v1
Conference papers
Distributed Approximation Algorithm for Resource Clustering SIROCCO 2008, 2008, Switzerland. pp.61--73 |
||
| hal-00307150v1
Journal articles
Could any graph be turned into a small-world? Theoretical Computer Science, Elsevier, 2006, 355, pp.96--103 |
||
| hal-00307532v1
Conference papers
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
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
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⟩ |
||
|
|
||
