activity
20072012
most citedA distributed algorithm for computing and updating the process number of a forest

3 citations · 10 across the 9 of their papers we have counts for

collaborators

9 papers

cs.DC2012★ 1 cited

On Dynamic Distributed Computing

Rachid Guerraoui, Florian Huc, Anne-Marie Kermarrec

This paper shows for the first time that distributed computing can be both reliable and efficient in an environment that is both highly dynamic and hostile. More specifically, we s…

cs.NI2011★ 2 cited

Distributed Planarization and Local Routing Strategies in Sensor Networks

Aubin Jarry, Florian Huc, Pierre Leone +1

We present an algorithm which computes a planar 2-spanner from an Unit Disk Graph when the node density is sufficient. The communication complexity in terms of number of node's ide…

cs.DC2011★ 3 cited

Scalable and Secure Aggregation in Distributed Networks

Sebastien Gambs, Rachid Guerraoui, Hamza Harkous +2

We consider the problem of computing an aggregation function in a \emph{secure} and \emph{scalable} way. Whereas previous distributed solutions with similar security guarantees hav…

math.CO2009

Subgraphs of weakly quasi-random oriented graphs

Omid Amini, Simon Griffiths, Florian Huc

It is an intriguing question to see what kind of information on the structure of an oriented graph one can obtain if does not contain a fixed oriented graph as a subgra…

cs.NI2009

VRAC: Simulation Results #1

Florian Huc, Aubin Jarry

In order to make full use of geographic routing techniques developed for large scale networks, nodes must be localized. However, localization and virtual localization techniques in…

cs.NI2009

VRAC: Virtual Raw Anchor Coordinates Routing in Sensor Networks -- Concepts and Experimental Protocol

Florian Huc, Aubin Jarry

In order to make full use of geographic routing techniques developed for large scale networks, nodes must be localized. However, localization and virtual localization techniques in…