The effect of range and bandwidth on the round complexity in the congested clique model

Becker Florent (), Antonio Fernández Anta, Ivan Rapaport () and Eric Rémila
Additional contact information
Becker Florent: MC2 - Modèles de calcul, Complexité, Combinatoire - LIP - Laboratoire de l'Informatique du Parallélisme - ENS de Lyon - École normale supérieure de Lyon - Université de Lyon - UCBL - Université Claude Bernard Lyon 1 - Université de Lyon - Inria - Institut National de Recherche en Informatique et en Automatique - Université de Lyon - CNRS - Centre National de la Recherche Scientifique
Antonio Fernández Anta: Institute IMDEA Software [Madrid]
Ivan Rapaport: DIM - Departamento de Ingeniería Matemática [Santiago] - UCHILE - Universidad de Chile = University of Chile [Santiago] - CNRS - Centre National de la Recherche Scientifique, CMM - Centre de modélisation mathématique / Centro de Modelamiento Matemático [Santiago] - UCHILE - Universidad de Chile = University of Chile [Santiago] - CNRS - Centre National de la Recherche Scientifique

Post-Print from HAL

Keywords: distributed; computing (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

Published in Lecture Notes in Computer Science, 2016, 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings, 9797, pp 182-193

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:halshs-01417273

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().