E-LIB Suche - Ergebnisse für: Huc, Florian

1

Highly dynamic distributed computing with byzantine failure:

, In: Proceedings of the 2013 ACM symposium on Principles of distributed computing,

Guerraoui, Rachid ; Huc, Florian ; Kermarrec, Anne-Marie - p. 176-183 , 2013

Link: https://dl.acm.org/doi/1..

2

Fast byzantine agreement:

, In: Proceedings of the 2013 ACM symposium on Principles of distributed computing,

Braud-Santoni, Nicolas ; Guerraoui, Rachid ; Huc, Florian - p. 57-64 , 2013

Link: https://dl.acm.org/doi/1..

3

Virtual raw anchor coordinates: A new localization paradigm:

Huc, Florian ; Jarry, Aubin ; Leone, Pierre.
Theoretical Computer Science. 453 (2012) - p. 44-53 , 2012

Link: https://doi.org/10.1016/..

4

On the efficiency of routing in sensor networks:

Huc, Florian ; Jarry, Aubin ; Leone, Pierre.
Journal of Parallel and Distributed Computing. 72 (2012) 7 - p. 889-901 , 2012

Link: https://doi.org/10.1016/..

5

Subgraphs of Weakly Quasi-Random Oriented Graphs:

Amini, Omid ; Griffiths, Simon ; Huc, Florian
SIAM Journal on Discrete Mathematics. 25 (2011) 1 - p. 234-259 , 2011

Link: https://doi.org/10.1137/..

6

A Distributed Algorithm for Computing the Node Search Numbe..:

Coudert, David ; Huc, Florian ; Mazauric, Dorian
Algorithmica. 63 (2011) 1-2 - p. 158-190 , 2011

Link: https://doi.org/10.1007/..

7

Brief announcement : routing with obstacle avoidance mec..:

, In: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing,

Huc, Florian ; Jarry, Aubin ; Leone, Pierre. - p. 116-117 , 2010

Link: https://dl.acm.org/doi/1..

8

WDM and Directed Star Arboricity:

AMINI, OMID ; HAVET, FRÉDÉRIC ; HUC, FLORIAN.
Combinatorics, Probability and Computing. 19 (2010) 2 - p. 161-182 , 2010

Link: https://doi.org/10.1017/..

9

Minimal selectors and fault tolerant networks:

Amini, Omid ; Giroire, Frédéric ; Pérennes, Stéphane.
Networks. 55 (2009) 4 - p. 326-340 , 2009

Link: https://doi.org/10.1002/..

10

On the Path-Width of Planar Graphs:

Amini, Omid ; Huc, Florian ; Pérennes, Stéphane
SIAM Journal on Discrete Mathematics. 23 (2009) 3 - p. 1311-1316 , 2009

Link: https://doi.org/10.1137/..

11

The Proportional Colouring Problem: Optimizing Buffers in W..:

Huc, Florian ; Linhares-Sales, Cláudia ; Rivano, Hervé
Electronic Notes in Discrete Mathematics. 30 (2008) - p. 141-146 , 2008

Link: https://doi.org/10.1016/..

12

4-cycles in mixing digraphs:

Amini, Omid ; Griffiths, Simon ; Huc, Florian
Electronic Notes in Discrete Mathematics. 30 (2008) - p. 63-68 , 2008

Link: https://doi.org/10.1016/..

13

Pathwidth of outerplanar graphs:

Coudert, David ; Huc, Florian ; Sereni, Jean‐Sébastien
Journal of Graph Theory. 55 (2006) 1 - p. 27-41 , 2006

Link: https://doi.org/10.1002/..

14

Efficient Graph Planarization in Sensor Networks and Local ..:

Huc, Florian ; Jarry, Aubin ; Leone, Pierre.
info:eu-repo/semantics/altIdentifier/doi/10.1109/DCOSS.2012.64. , 2012

Link: https://archive-ouverte...

15

A Distributed Algorithm for Computing the Node Search Numbe..:

Coudert, David ; Huc, Florian ; Mazauric, Dorian
info:eu-repo/semantics/altIdentifier/doi/10.1007/s00453-011-9524-3. , 2012

Link: https://inria.hal.scienc..