| 2008 |
|---|
| 108 | EE | Augustin Chaintreau,
Pierre Fraigniaud,
Emmanuelle Lebhar:
Networks become navigable as nodes move and forget
CoRR abs/0803.0248: (2008) |
| 2007 |
|---|
| 107 | EE | Pierre Fraigniaud:
Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation.
ESA 2007: 2-11 |
| 106 | EE | Pierre Fraigniaud,
Cyril Gavoille,
David Ilcinkas,
Andrzej Pelc:
Distributed Computing with Advice: Information Sensitivity of Graph Coloring.
ICALP 2007: 231-242 |
| 105 | EE | Pierre Fraigniaud,
Cyril Gavoille,
Adrian Kosowski,
Emmanuelle Lebhar,
Zvi Lotker:
Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier.
SPAA 2007: 1-7 |
| 104 | EE | Pierre Fraigniaud,
Amos Korman,
Emmanuelle Lebhar:
Local MST computation with short advice.
SPAA 2007: 154-160 |
| 103 | EE | Pierre Fraigniaud:
Special Issue DISC 2005.
Distributed Computing 20(3): 163 (2007) |
| 102 | EE | Lali Barrière,
Paola Flocchini,
Pierre Fraigniaud,
Nicola Santoro:
Rendezvous and Election of Mobile Agents: Impact of Sense of Direction.
Theory Comput. Syst. 40(2): 143-162 (2007) |
| 2006 |
|---|
| 101 | EE | Pierre Fraigniaud,
Emmanuelle Lebhar,
Zvi Lotker:
Brief Announcement: On Augmented Graph Navigability.
DISC 2006: 551-553 |
| 100 | EE | Pierre Fraigniaud,
Emmanuelle Lebhar,
Zvi Lotker:
A Doubling Dimension Threshold Theta(loglogn) for Augmented Graph Navigability.
ESA 2006: 376-386 |
| 99 | EE | Pierre Fraigniaud,
David Ilcinkas,
Sergio Rajsbaum,
Sébastien Tixeuil:
The Reduced Automata Technique for Graph Exploration Space Lower Bounds.
Essays in Memory of Shimon Even 2006: 1-26 |
| 98 | EE | Danny Krizanc,
Michael Kaufmann,
Pierre Fraigniaud,
Christos D. Zaroliagis:
Topic 12: Theory and Algorithms for Parallel Computation.
Euro-Par 2006: 799 |
| 97 | EE | Pierre Fraigniaud:
Navigability of Small World Networks.
HiPC 2006: 1 |
| 96 | EE | Pierre Fraigniaud,
Nicolas Nisse:
Connected Treewidth and Connected Graph Searching.
LATIN 2006: 479-490 |
| 95 | EE | Pierre Fraigniaud,
David Ilcinkas,
Andrzej Pelc:
Tree Exploration with an Oracle.
MFCS 2006: 24-37 |
| 94 | EE | Pierre Fraigniaud,
David Ilcinkas,
Andrzej Pelc:
Oracle size: a new measure of difficulty for communication tasks.
PODC 2006: 179-187 |
| 93 | EE | Lélia Blin,
Pierre Fraigniaud,
Nicolas Nisse,
Sandrine Vial:
Distributed Chasing of Network Intruders.
SIROCCO 2006: 70-84 |
| 92 | EE | Pierre Fraigniaud,
Nicolas Nisse:
Monotony Properties of Connected Visible Graph Searching.
WG 2006: 229-240 |
| 91 | EE | Anders Dessmark,
Pierre Fraigniaud,
Dariusz R. Kowalski,
Andrzej Pelc:
Deterministic Rendezvous in Graphs.
Algorithmica 46(1): 69-96 (2006) |
| 90 | EE | Pierre Fraigniaud,
Cyril Gavoille:
Header-size lower bounds for end-to-end communication in memoryless networks.
Computer Networks 50(10): 1630-1638 (2006) |
| 89 | EE | Pierre Fraigniaud,
Cyril Gavoille,
Christophe Paul:
Eclecticism shrinks even small worlds.
Distributed Computing 18(4): 279-291 (2006) |
| 88 | EE | Pierre Fraigniaud,
Leszek Gasieniec,
Dariusz R. Kowalski,
Andrzej Pelc:
Collective tree exploration.
Networks 48(3): 166-177 (2006) |
| 87 | EE | Pierre Fraigniaud,
Philippe Gauron:
D2B: A de Bruijn based content-addressable network.
Theor. Comput. Sci. 355(1): 65-79 (2006) |
| 2005 |
|---|
| 86 | | Pierre Fraigniaud:
Distributed Computing, 19th International Conference, DISC 2005, Cracow, Poland, September 26-29, 2005, Proceedings
Springer 2005 |
| 85 | EE | Pierre Fraigniaud:
Greedy Routing in Tree-Decomposed Graphs.
ESA 2005: 791-802 |
| 84 | EE | Pierre Fraigniaud,
Philippe Gauron,
Matthieu Latapy:
Combining the Use of Clustering and Scale-Free Nature of User Exchanges into a Simple and Efficient P2P System.
Euro-Par 2005: 1163-1172 |
| 83 | EE | Reuven Cohen,
Pierre Fraigniaud,
David Ilcinkas,
Amos Korman,
David Peleg:
Label-Guided Graph Exploration by a Finite Automaton.
ICALP 2005: 335-346 |
| 82 | EE | Reuven Cohen,
Pierre Fraigniaud,
David Ilcinkas,
Amos Korman,
David Peleg:
Labeling Schemes for Tree Representation.
IWDC 2005: 13-24 |
| 81 | EE | Fedor V. Fomin,
Pierre Fraigniaud,
Nicolas Nisse:
Nondeterministic Graph Searching: From Pathwidth to Treewidth.
MFCS 2005: 364-375 |
| 80 | EE | Pierre Fraigniaud,
David Ilcinkas,
Sergio Rajsbaum,
Sébastien Tixeuil:
Space Lower Bounds for Graph Exploration via Reduced Automata.
SIROCCO 2005: 140-154 |
| 79 | EE | Franck Cappello,
Pierre Fraigniaud,
Bernard Mans,
Arnold L. Rosenberg:
An algorithmic model for heterogeneous hyper-clusters: rationale and experience.
Int. J. Found. Comput. Sci. 16(2): 195-215 (2005) |
| 78 | EE | Pierre Fraigniaud,
Bernard Mans,
Arnold L. Rosenberg:
Efficient trigger-broadcasting in heterogeneous clusters.
J. Parallel Distrib. Comput. 65(5): 628-642 (2005) |
| 77 | EE | Pierre Fraigniaud,
David Ilcinkas,
Guy Peer,
Andrzej Pelc,
David Peleg:
Graph exploration by a finite automaton.
Theor. Comput. Sci. 345(2-3): 331-344 (2005) |
| 2004 |
|---|
| 76 | EE | Pierre Fraigniaud,
Leszek Gasieniec,
Dariusz R. Kowalski,
Andrzej Pelc:
Collective Tree Exploration.
LATIN 2004: 141-151 |
| 75 | EE | Pierre Fraigniaud,
David Ilcinkas,
Guy Peer,
Andrzej Pelc,
David Peleg:
Graph Exploration by a Finite Automaton.
MFCS 2004: 451-462 |
| 74 | EE | J. Ignacio Alvarez-Hamelin,
Pierre Fraigniaud:
Reducing Packet-Loss by Taking Long-Range Dependences into Account.
NETWORKING 2004: 1096-1107 |
| 73 | EE | Pierre Fraigniaud,
Cyril Gavoille,
Christophe Paul:
Eclecticism shrinks even small worlds.
PODC 2004: 169-178 |
| 72 | EE | Pierre Fraigniaud,
David Ilcinkas:
Digraphs Exploration with Little Memory.
STACS 2004: 246-257 |
| 71 | EE | Pierre Fraigniaud:
A note on line broadcast in digraphs under the edge-disjoint paths mode.
Discrete Applied Mathematics 144(3): 320-323 (2004) |
| 70 | EE | Krzysztof Diks,
Pierre Fraigniaud,
Evangelos Kranakis,
Andrzej Pelc:
Tree exploration with little memory.
J. Algorithms 51(1): 38-63 (2004) |
| 2003 |
|---|
| 69 | EE | Pierre Fraigniaud,
Cyril Gavoille:
Lower Bounds for Oblivious Single-Packet End-to-End Communication.
DISC 2003: 211-223 |
| 68 | EE | Anders Dessmark,
Pierre Fraigniaud,
Andrzej Pelc:
Deterministic Rendezvous in Graphs.
ESA 2003: 184-195 |
| 67 | EE | Christos Kaklamanis,
Danny Krizanc,
Pierre Fraigniaud,
Michael Kaufmann:
Topic Introduction.
Euro-Par 2003: 884 |
| 66 | EE | Pierre Fraigniaud,
Philippe Gauron:
Brief announcement: an overview of the content-addressable network D2B.
PODC 2003: 151 |
| 65 | | Lali Barrière,
Paola Flocchini,
Pierre Fraigniaud,
Nicola Santoro:
Election and Rendezvous in Fully Anonymous Systems with Sense of Direction.
SIROCCO 2003: 17-32 |
| 64 | EE | Lali Barrière,
Pierre Fraigniaud,
Lata Narayanan,
Jaroslav Opatrny:
Dynamic construction of Bluetooth scatternets of fixed degree and low diameter.
SODA 2003: 781-790 |
| 63 | EE | Lali Barrière,
Paola Flocchini,
Pierre Fraigniaud,
Nicola Santoro:
Can we elect if we cannot compare?
SPAA 2003: 324-332 |
| 62 | EE | Lali Barrière,
Pierre Fraigniaud,
Nicola Santoro,
Dimitrios M. Thilikos:
Searching Is Not Jumping.
WG 2003: 34-45 |
| 61 | EE | Lali Barrière,
Pierre Fraigniaud,
Lata Narayanan,
Jaroslav Opatrny:
Robust position-based routing in wireless ad hoc networks with irregular transmission ranges.
Wireless Communications and Mobile Computing 3(2): 141-153 (2003) |
| 2002 |
|---|
| 60 | EE | Krzysztof Diks,
Pierre Fraigniaud,
Evangelos Kranakis,
Andrzej Pelc:
Tree exploration with little memory.
SODA 2002: 588-597 |
| 59 | EE | Lali Barrière,
Paola Flocchini,
Pierre Fraigniaud,
Nicola Santoro:
Capture of an intruder by mobile agents.
SPAA 2002: 200-209 |
| 58 | EE | Pierre Fraigniaud,
Cyril Gavoille:
A Space Lower Bound for Routing in Trees.
STACS 2002: 65-75 |
| 57 | EE | Johanne Cohen,
Pierre Fraigniaud,
Cyril Gavoille:
Recognizing Knödel graphs.
Discrete Mathematics 250(1-3): 41-62 (2002) |
| 56 | EE | Pierre Fraigniaud,
Jean-Claude König,
Emmanuel Lazard:
Oriented hypercubes.
Networks 39(2): 98-106 (2002) |
| 55 | EE | Johanne Cohen,
Pierre Fraigniaud,
Margarida Mitjana:
Polynomial-Time Algorithms for Minimum-Time Broadcast in Trees.
Theory Comput. Syst. 35(6): 641-665 (2002) |
| 2001 |
|---|
| 54 | | Francesc Comellas,
Josep Fàbrega,
Pierre Fraigniaud:
SIROCCO 8, Proceedings of the 8th International Colloquium on Structural Information and Communication Complexity, Vall de Núria, Girona-Barcelona, Catalonia, Spain, 27-29 June, 2001
Carleton Scientific 2001 |
| 53 | EE | Lali Barrière,
Pierre Fraigniaud,
Lata Narayanan:
Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges.
DIAL-M 2001: 19-27 |
| 52 | EE | Lali Barrière,
Pierre Fraigniaud,
Evangelos Kranakis,
Danny Krizanc:
Efficient Routing in Networks with Long Range Contacts.
DISC 2001: 270-284 |
| 51 | EE | Pierre Fraigniaud:
Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode.
ESA 2001: 440-451 |
| 50 | EE | Pierre Fraigniaud,
Cyril Gavoille:
Routing in Trees.
ICALP 2001: 757-772 |
| 49 | | Franck Cappello,
Pierre Fraigniaud,
Bernard Mans,
Arnold L. Rosenberg:
HiHCoHP: Toward a Realistic Communication Model for Hierarchical HyperClusters of Heterogeneous Processors.
IPDPS 2001: 42 |
| 48 | EE | Pierre Fraigniaud,
Andrzej Pelc,
David Peleg,
Stephane Perennes:
Assigning labels in an unknown anonymous network with a leader.
Distributed Computing 14(3): 163-183 (2001) |
| 47 | EE | Pierre Fraigniaud,
Cyril Gavoille,
Bernard Mans:
Interval routing schemes allow broadcasting with linear message-complexity.
Distributed Computing 14(4): 217-229 (2001) |
| 46 | EE | Thierry Chich,
Pierre Fraigniaud,
Johanne Cohen:
Unslotted deflection routing: a practical and efficient protocol for multihop optical networks.
IEEE/ACM Trans. Netw. 9(1): 47-59 (2001) |
| 45 | EE | Pierre Fraigniaud,
Joseph G. Peters:
Minimum linear gossip graphs and maximal linear (Delta, k)-gossip graphs.
Networks 38(3): 150-162 (2001) |
| 2000 |
|---|
| 44 | | Lali Barrière,
Pierre Fraigniaud,
Cyril Gavoille,
Bernard Mans,
John Michael Robson:
On Recognizing Cayley Graphs.
ESA 2000: 76-87 |
| 43 | EE | Pierre Fraigniaud,
Andrzej Pelc,
David Peleg,
Stephane Perennes:
Assigning labels in unknown anonymous networks (extended abstract).
PODC 2000: 101-111 |
| 42 | EE | Pierre Fraigniaud,
Cyril Gavoille,
Bernard Mans:
Interval routing schemes allow broadcasting with linear message-complexity (extended abstract).
PODC 2000: 11-20 |
| 41 | EE | Thomas H. Cormen,
Frank K. H. A. Dehne,
Pierre Fraigniaud,
Yossi Matias:
Guest Editors' Foreword.
Theory Comput. Syst. 33(5/6): 335-335 (2000) |
| 1999 |
|---|
| 40 | EE | Johanne Cohen,
Pierre Fraigniaud,
Margarida Mitjana:
Scheduling Calls for Multicasting in Tree-Networks.
SODA 1999: 881-882 |
| 39 | EE | Johanne Cohen,
Pierre Fraigniaud,
Cyril Gavoille:
Recognizing Bipartite Incident-Graphs of Circulant Digraphs.
WG 1999: 215-227 |
| 38 | | Pierre Fraigniaud,
Sandrine Vial:
Comparison of Heuristics for One-to-All and All-to All Communications in Partial Meshes.
Parallel Processing Letters 9(1): 9-20 (1999) |
| 1998 |
|---|
| 37 | | Pierre Fraigniaud,
Cyril Gavoille:
A Theoretical Model for Routing Complexity.
SIROCCO 1998: 98-113 |
| 36 | | Pierre Fraigniaud,
Cyril Gavoille:
Interval Routing Schemes.
Algorithmica 21(2): 155-182 (1998) |
| 35 | EE | Eric Fleury,
Pierre Fraigniaud:
A General Theory for Deadlock Avoidance in Wormhole-Routed Networks.
IEEE Trans. Parallel Distrib. Syst. 9(7): 626-638 (1998) |
| 34 | EE | Johanne Cohen,
Pierre Fraigniaud,
Jean-Claude König,
André Raspaud:
Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks.
IEEE Trans. Parallel Distrib. Syst. 9(8): 788-802 (1998) |
| 33 | EE | Pierre Fraigniaud:
Hierarchical Broadcast Networks.
Inf. Process. Lett. 68(6): 303-305 (1998) |
| 32 | | Eric Fleury,
Pierre Fraigniaud:
Strategies for Path-Based Multicasting in Wormhole-Routed Meshes.
J. Parallel Distrib. Comput. 53(1): 26-62 (1998) |
| 31 | EE | Pierre Fraigniaud:
On XRAM and PRAM Models, and on Data-Movement-Intensive Problems.
Theor. Comput. Sci. 194(1-2): 225-237 (1998) |
| 1997 |
|---|
| 30 | EE | Thierry Chich,
Pierre Fraigniaud:
An extended comparison of slotted and unslotted deflection routing.
ICCCN 1997: 92-97 |
| 29 | EE | Johanne Cohen,
Pierre Fraigniaud,
Jean-Claude König,
André Raspaud:
Broadcasting and Multicasting in Cut-through Routed Networks.
IPPS 1997: 734-738 |
| 28 | | Pierre Fraigniaud,
Sandrine Vial:
Heuristics Algorithms for Personalized Communication Problems in Point-to-Point Networks.
SIROCCO 1997: 240-252 |
| 27 | EE | Dominique Barth,
Pierre Fraigniaud:
Approximation Algorithms for Structured Communication Problems.
SPAA 1997: 180-188 |
| 26 | | Pierre Fraigniaud,
Cyril Gavoille:
Universal Routing Schemes.
Distributed Computing 10(2): 65-78 (1997) |
| 25 | | Pierre Fraigniaud,
Sandrine Vial:
Approximation Algorithms for Broadcasting and Gossiping.
J. Parallel Distrib. Comput. 43(1): 47-55 (1997) |
| 1996 |
|---|
| 24 | | Luc Bougé,
Pierre Fraigniaud,
Anne Mignotte,
Yves Robert:
Euro-Par '96 Parallel Processing, Second International Euro-Par Conference, Lyon, France, August 26-29, 1996, Proceedings, Volume I
Springer 1996 |
| 23 | | Luc Bougé,
Pierre Fraigniaud,
Anne Mignotte,
Yves Robert:
Euro-Par '96 Parallel Processing, Second International Euro-Par Conference, Lyon, France, August 26-29, 1996, Proceedings, Volume II
Springer 1996 |
| 22 | | Pierre Fraigniaud,
Cyril Gavoille:
Local Memory Requirement of Universal Routing Schemes.
SPAA 1996: 183-188 |
| 21 | EE | Pierre Fraigniaud,
Christian Laforest:
Minimum gossip bus networks.
Networks 27(4): 239-251 (1996) |
| 1995 |
|---|
| 20 | EE | Pierre Fraigniaud,
Joseph G. Peters:
Structured communication in torus networks.
HICSS (2) 1995: 584-593 |
| 19 | | Pierre Fraigniaud,
Cyril Gavoille:
Memory Requirement for Universal Routing Schemes.
PODC 1995: 223-230 |
| 1994 |
|---|
| 18 | | Pierre Fraigniaud,
Cyril Gavoille:
Optimal Interval Routing.
CONPAR 1994: 785-796 |
| 17 | | Eric Fleury,
Pierre Fraigniaud:
Multicasting in Meshes.
ICPP (3) 1994: 151-158 |
| 16 | | Pierre Fraigniaud,
Cyril Gavoille:
A Characterization of Networks Supporting Linear Interval Routing.
PODC 1994: 216-224 |
| 15 | | Pierre Fraigniaud,
Emmanuel Lazard:
Methods and problems of communication in usual networks.
Discrete Applied Mathematics 53(1-3): 79-133 (1994) |
| 14 | EE | Michel Cosnard,
Pierre Fraigniaud:
Analysis of Asynchronous Polynomial Root Finding Methods on a Distributed Memory Multicomputer.
IEEE Trans. Parallel Distrib. Syst. 5(6): 639-648 (1994) |
| 13 | | Jean-Claude Bermond,
Pierre Fraigniaud:
Broadcasting and Gossiping in de Bruijn Networks.
SIAM J. Comput. 23(1): 212-225 (1994) |
| 1993 |
|---|
| 12 | | Pierre Fraigniaud,
Christian Laforest:
Disjoint Spanning Trees of Small Depth.
PARCO 1993: 105-112 |
| 11 | | Pierre Fraigniaud,
Claire Kenyon,
Andrzej Pelc:
Finding a Target Subnetwork in Sparse Networks with Random Faults.
Inf. Process. Lett. 48(6): 297-303 (1993) |
| 10 | | Henri-Pierre Charles,
Pierre Fraigniaud:
Scheduling a Scattering-Gathering Sequence on Hypercubes.
Parallel Processing Letters 3: 29-42 (1993) |
| 9 | | Pierre Fraigniaud,
Arthur L. Liestman,
Dominique Sotteau:
Open Problems.
Parallel Processing Letters 3: 507-524 (1993) |
| 1992 |
|---|
| 8 | | Pierre Fraigniaud:
Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers.
IEEE Trans. Computers 41(11): 1410-1419 (1992) |
| 7 | | Pierre Fraigniaud:
Complexity Analysis of Broadcasting in Hypercubes with Restricted Communication Capabilities.
J. Parallel Distrib. Comput. 16(1): 15-26 (1992) |
| 1991 |
|---|
| 6 | | Pierre Fraigniaud:
Fault-Tolerant Gossiping on Hypercube Multicomputers.
EDMCC 1991: 463-472 |
| 5 | | Pierre Fraigniaud,
Ching-Tien Ho:
Arc-Disjoint Spanning Trees on Cube-Connected Cycles Networks.
ICPP (1) 1991: 225-229 |
| 4 | | Pierre Fraigniaud,
Claudine Peyrat:
Broadcasting in a Hypercube when Some Calls Fail.
Inf. Process. Lett. 39(3): 115-119 (1991) |
| 1990 |
|---|
| 3 | | Michel Cosnard,
Pierre Fraigniaud:
A Performance Analysis of Network Topologies in Finding the Roots of a Polynomial.
CONPAR 1990: 875-886 |
| 2 | | Pierre Fraigniaud,
Serge Miguet,
Yves Robert:
Scattering on a ring of processors.
Parallel Computing 13(3): 377-383 (1990) |
| 1 | | Michel Cosnard,
Pierre Fraigniaud:
Finding the roots of a polynomial on an MIMD multicomputer.
Parallel Computing 15(1-3): 75-85 (1990) |
