 |
 |
 |
 |
|
|
||
|---|---|---|
|
hal-00307397v1
Communication dans un congrès
Pierre Fraigniaud, Cyril Gavoille. Lower Bounds for Oblivious Single-Packet End-to-End Communication $17^$ International Symposium on Distributed Computing (DISC), 2003, Italy. 2848 Lecture Notes i, pp.211-223, 2003 |
||
|
hal-00307394v1
Communication dans un congrès
Pierre Fraigniaud, Cyril Gavoille, Christophe Paul. Eclecticism Shrinks Even Small Worlds $23^$ Annual ACM Symposium on Principles of Distributed Computing (PODC), 2004, Canada. pp.169-178, 2004 |
||
|
hal-00307396v1
Communication dans un congrès
Pierre Fraigniaud, Cyril Gavoille, Christophe Paul. Eclectisme dans les petits mondes $6^}$ Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), 2004, France. pp.270-284, 2004 |
||
|
hal-00307398v1
Communication dans un congrès
Pierre Fraigniaud, Cyril Gavoille. A Space Lower Bound for Routing in Trees $19^$ Annual Symposium on Theoretical Aspects of Computer Science (STACS), 2002, France. 2285 of Lecture Note, pp.65-75, 2002 |
||
|
inria-00100505v1
Article dans une revue
Thierry Chich, Johanne Cohen, Pierre Fraigniaud. Unslotted deflection routing: a practical and efficient protocol for multihop optical networks IEEE/ACM Transaction on Networking, 2001, 9 (1), pp.47-59 |
||
|
inria-00098892v1
Communication dans un congrès
Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille. Recognizing Bipartite Incident-Graphs of Circulant Digraphs P. Widmayer, G. Neyer, S. Eidenbenz. International Workshop on Graph Theoretic Concepts in Computer Science - WG'99, 1999, Ascona, Switzerland, Springer, 1665, pp.215-227, 1999, Lecture Notes in Computer Science |
||
|
inria-00100969v1
Article dans une revue
Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille. Recognizing Knödel graphs Discrete Mathematics, Elsevier, 2002, pp.41-62 |
||
|
hal-00307575v1
Article dans une revue
Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille. Recognizing {K}nödel Graphs Discrete Mathematics, Elsevier, 2002, 250, pp.41-62 |
||
|
inria-00098494v1
Article dans une revue
Eric Fleury, Pierre Fraigniaud. A General Theory for Deadlock Avoidance in Wormhole-Routed Networks IEEE Transactions on Parallel and Distributed Systems, Institute of Electrical and Electronics Engineers, 1998, 9 (7), pp.626--638 |
||
|
hal-00307395v1
Article dans une revue
Pierre Fraigniaud, Cyril Gavoille. Header-Size Lower Bounds for End-to-End Communication in Memoryless Networks Computer Networks, Elsevier, 2006, 50 (10), pp.1630-1638. <10.1016/j.comnet.2005.09.025> |
||
|
inria-00098497v1
Article dans une revue
Eric Fleury, Pierre Fraigniaud. Strategies for Path-Based Multicasting in Wormhole-Routed Meshes Journal of Parallel and Distributed Computing, Elsevier, 1998, 53 (1), pp.26--62 |
||
|
|
||