8 résultats  enregistrer la recherche


...
inria-00587250v1  Communication dans un congrès
Becker FlorentMartin MatamalaNicolas NisseIvan RapaportKarol Suchan et al.  Reconstruire un graphe en une ronde
Ducourthial, Bertrand et Felber, Pascal. 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France. 2011
...
hal-00704200v1  Communication dans un congrès
Becker FlorentAdrian KosowskiNicolas NisseIvan RapaportKarol SuchanAllowing Each Node to Communicate Only Once in a Distributed System: Shared Whiteboard Models
SPAA - 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012, United States. pp.7, 2012
...
inria-00622976v1  Communication dans un congrès
Becker FlorentMartin MatamalaNicolas NisseIvan RapaportKarol Suchan et al.  Adding a referee to an interconnection network: What can(not) be computed in one round.
25th IEEE International Symposium on Parallel & Distributed Processing (IPDPS), 2011, Anchorage, United States. pp.508-514, 2011
inria-00423454v1  Communication dans un congrès
Nicolas NisseIvan RapaportKarol SuchanDistributed computing of efficient routing schemes in generalized chordal graphs
International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2009, Piran, Slovenia. 2009
...
hal-00741970v1  Article dans une revue
Nicolas NisseIvan RapaportKarol SuchanDistributed computing of efficient routing schemes in generalized chordal graphs
Theoretical Computer Science, Elsevier, 2012, 444 (27), pp.17-27