Florian Huc

According to our database1, Florian Huc authored at least 32 papers between 2007 and 2013.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
A Distributed Polling with Probabilistic Privacy.
Proceedings of the IEEE 32nd Symposium on Reliable Distributed Systems, 2013

Highly dynamic distributed computing with byzantine failures.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Fast byzantine agreement.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012
Virtual raw anchor coordinates: A new localization paradigm.
Theor. Comput. Sci., 2012

On the efficiency of routing in sensor networks.
J. Parallel Distributed Comput., 2012

The Proportional Coloring Problem: Optimizing Buffers in Radio Mesh Networks.
Discret. Math. Algorithms Appl., 2012

On Dynamic Distributed Computing
CoRR, 2012

A Distributed Algorithm for Computing the Node Search Number in Trees.
Algorithmica, 2012

Scalable and Secure Polling in Dynamic Distributed Networks.
Proceedings of the IEEE 31st Symposium on Reliable Distributed Systems, 2012

Efficient Graph Planarization in Sensor Networks and Local Routing Algorithm.
Proceedings of the IEEE 8th International Conference on Distributed Computing in Sensor Systems, 2012

2011
Subgraphs of Weakly Quasi-Random Oriented Graphs.
SIAM J. Discret. Math., 2011

Weighted-Edge-Coloring of k-degenerate Graphs and Bin-Packing.
J. Interconnect. Networks, 2011

Scalable and Secure Aggregation in Distributed Networks
CoRR, 2011

Distributed Planarization and Local Routing Strategies in Sensor Networks
CoRR, 2011

2010
Minimal selectors and fault tolerant networks.
Networks, 2010

Improper Coloring of Weighted Grid and Hexagonal Graphs.
Discret. Math. Algorithms Appl., 2010

WDM and Directed Star Arboricity.
Comb. Probab. Comput., 2010

Brief announcement: routing with obstacle avoidance mechanism with constant approximation ratio.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Stability of a localized and greedy routing algorithm.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

A new framework for efficient shared segment protection scheme for WDM networks.
Proceedings of the 11th IEEE International Conference on High Performance Switching and Routing, 2010

2009
On the Path-Width of Planar Graphs.
SIAM J. Discret. Math., 2009

(<i>l</i>, k)-ROUTING ON PLANE GRIDS.
J. Interconnect. Networks, 2009

VRAC: Simulation Results #1
CoRR, 2009

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

Early Obstacle Detection and Avoidance for All to All Traffic Pattern in Wireless Sensor Networks.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

2008
Conception de Réseaux Dynamiques Tolérants aux Pannes. (Conception of dynamic fault tolerant networks).
PhD thesis, 2008

The Proportional Colouring Problem: Optimizing Buffers in Wireless Mesh Networks.
Electron. Notes Discret. Math., 2008

4-cycles in mixing digraphs.
Electron. Notes Discret. Math., 2008

A Distributed Algorithm for Computing and Updating the Process Number of a Forest.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Computing and Updating the Process Number in Trees.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints.
Proceedings of IEEE International Conference on Communications, 2008

2007
Pathwidth of outerplanar graphs.
J. Graph Theory, 2007


  Loading...