Pierre Fraigniaud

	2012
161		Pierre Fraigniaud, Andrzej Pelc: Decidability Classes for Mobile Agents Computing. LATIN 2012: 362-374
160		Hervé Baumann, Pierre Fraigniaud, Hovhannes A. Harutyunyan, R. de Verclos: The Worst Case Behavior of Randomized Gossip. TAMC 2012: 330-345
	2011
159		Cyril Gavoille, Pierre Fraigniaud: Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, PODC 2011, San Jose, CA, USA, June 6-8, 2011 ACM 2011
158		Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers: Locality and Checkability in Wait-Free Computing. DISC 2011: 333-347
157		Pierre Fraigniaud, Amos Korman, David Peleg: Local Distributed Decision. FOCS 2011: 708-717
156		Pierre Fraigniaud, Andrzej Pelc: Delays Induce an Exponential Memory Gap for Rendezvous in Trees CoRR abs/1102.0467: (2011)
155		Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos: Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071). Dagstuhl Reports 1(2): 30-46 (2011)
154		Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud: Parsimonious flooding in dynamic graphs. Distributed Computing 24(1): 31-44 (2011)
153		Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén: Online computation with advice. Theor. Comput. Sci. 412(24): 2642-2656 (2011)
152		Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos: Special Issue on "Theory and Applications of Graph Searching Problems". Theor. Comput. Sci. 412(24): 2699 (2011)
	2010
151		Pierre Fraigniaud: Informative Labeling Schemes. ICALP (2) 2010: 1
150		Pierre Fraigniaud, Hoang-Anh Phan: "Tree-Farms" for Tree-Based Multicast Schemes in Peer-to-Peer Overlay Networks. ICC 2010: 1-5
149		Pierre Fraigniaud: Provenance for database transformations. ICDT 2010: 3
148		Pierre Fraigniaud, Hoang-Anh Phan: Degree hunter: on the impact of balancing node degrees in de Bruijn-based overlay networks. IPDPS Workshops 2010: 1-8
147		Pierre Fraigniaud: Distributed computational complexities: are you volvo-addicted or nascar-obsessed? PODC 2010: 171-172
146		Pierre Fraigniaud, Amos Korman: Compact Ancestry Labeling Schemes for XML Trees. SODA 2010: 458-466
145		Pierre Fraigniaud, George Giakkoupis: On the bit communication complexity of randomized rumor spreading. SPAA 2010: 134-143
144		Pierre Fraigniaud, Andrzej Pelc: Delays induce an exponential memory gap for rendezvous in trees. SPAA 2010: 224-232
143		Pierre Fraigniaud, George Giakkoupis: On the searchability of small-world networks with arbitrary underlying structure. STOC 2010: 389-398
142		Pierre Fraigniaud, Amos Korman: An optimal ancestry scheme and small universal posets. STOC 2010: 611-620
141		Pierre Fraigniaud, Amos Korman, David Peleg: Local Distributed Decision CoRR abs/1011.2152: (2010)
140		Pierre Fraigniaud, Andrzej Pelc: Decidability Classes for Mobile Agents Computing CoRR abs/1011.2719: (2010)
139		Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén: On the additive constant of the k-server Work Function Algorithm. Inf. Process. Lett. 110(24): 1120-1123 (2010)
138		Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc: Communication algorithms with advice. J. Comput. Syst. Sci. 76(3-4): 222-232 (2010)
137		Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker: A Lower Bound for Network Navigability. SIAM J. Discrete Math. 24(1): 72-81 (2010)
136		Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker: Recovering the long-range links in augmented graphs. Theor. Comput. Sci. 411(14-15): 1613-1625 (2010)
135		Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar: Local MST Computation with Short Advice. Theory Comput. Syst. 47(4): 920-933 (2010)
	2009
134		Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén: Online Computation with Advice. ICALP (1) 2009: 427-438
133		Pierre Fraigniaud, George Giakkoupis: The effect of power-law degrees on the navigability of small worlds: [extended abstract]. PODC 2009: 240-249
132		Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud: Parsimonious flooding in dynamic graphs. PODC 2009: 260-269
131		Hervé Baumann, Pierre Fraigniaud: Sub-linear Universal Spatial Gossip Protocols. SIROCCO 2009: 44-56
130		Pierre Fraigniaud, Amos Korman: On randomized representations of graphs using short labels. SPAA 2009: 131-137
129		Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén: On the Additive Constant of the k-Server Work Function Algorithm. WAOA 2009: 128-134
128		Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg: Labeling Schemes for Tree Representation. Algorithmica 53(1): 1-15 (2009)
127		Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse: Nondeterministic Graph Searching: From Pathwidth to Treewidth. Algorithmica 53(3): 358-373 (2009)
126		Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén: On the Additive Constant of the k-server Work Function Algorithm CoRR abs/0902.1378: (2009)
125		Pierre Fraigniaud, Amos Korman: Compact Ancestry Labeling Schemes for Trees of Small Depth CoRR abs/0902.3081: (2009)
124		Pierre Fraigniaud, Amos Korman: An Optimal Labeling Scheme for Ancestry Queries CoRR abs/0909.2733: (2009)
123		Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc: Distributed computing with advice: information sensitivity of graph coloring. Distributed Computing 21(6): 395-403 (2009)
122		Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker: Universal augmentation schemes for network navigability. Theor. Comput. Sci. 410(21-23): 1970-1981 (2009)
	2008
121		Pierre Fraigniaud, Andrzej Pelc: Deterministic Rendezvous in Trees with Little Memory. DISC 2008: 242-256
120		Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar: Networks Become Navigable as Nodes Move and Forget. ICALP (1) 2008: 133-144
119		Pierre Fraigniaud, Emmanuelle Lebhar, Laurent Viennot: The Inframetric Model for the Internet. INFOCOM 2008: 1085-1093
118		Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar: Forget him and keep on moving. PODC 2008: 415
117		Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker: Recovering the Long-Range Links in Augmented Graphs. SIROCCO 2008: 104-118
116		Pierre Fraigniaud, Cyril Gavoille: Polylogarithmic network navigability using compact metrics with small stretch. SPAA 2008: 62-69
115		Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg: Label-guided graph exploration by a finite automaton. ACM Transactions on Algorithms 4(4): (2008)
114		Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar: Networks become navigable as nodes move and forget CoRR abs/0803.0248: (2008)
113		Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc: Impact of memory size on graph exploration capability. Discrete Applied Mathematics 156(12): 2310-2319 (2008)
112		Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc: Tree exploration with advice. Inf. Comput. 206(11): 1276-1287 (2008)
111		Pierre Fraigniaud, Nicolas Nisse: Monotony properties of connected visible graph searching. Inf. Comput. 206(12): 1383-1393 (2008)
110		Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial: Distributed chasing of network intruders. Theor. Comput. Sci. 399(1-2): 12-37 (2008)
109		Fedor V. Fomin, Pierre Fraigniaud, Dimitrios M. Thilikos: Forewords: Special issue on graph searching. Theor. Comput. Sci. 399(3): 157 (2008)
	2007
108		Pierre Fraigniaud: Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation. ESA 2007: 2-11
107		Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc: Distributed Computing with Advice: Information Sensitivity of Graph Coloring. ICALP 2007: 231-242
106		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
105		Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar: Local MST computation with short advice. SPAA 2007: 154-160
104		Pierre Fraigniaud: Special Issue DISC 2005. Distributed Computing 20(3): 163 (2007)
103		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
102		Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker: Brief Announcement: On Augmented Graph Navigability. DISC 2006: 551-553
101		Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker: A Doubling Dimension Threshold Theta(loglogn) for Augmented Graph Navigability. ESA 2006: 376-386
100		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
99		Danny Krizanc, Michael Kaufmann, Pierre Fraigniaud, Christos D. Zaroliagis: Topic 12: Theory and Algorithms for Parallel Computation. Euro-Par 2006: 799
98		Pierre Fraigniaud: Navigability of Small World Networks. HiPC 2006: 1
97		Pierre Fraigniaud, Nicolas Nisse: Connected Treewidth and Connected Graph Searching. LATIN 2006: 479-490
96		Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc: Tree Exploration with an Oracle. MFCS 2006: 24-37
95		Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc: Oracle size: a new measure of difficulty for communication tasks. PODC 2006: 179-187
94		Lélia Blin, Pierre Fraigniaud, Nicolas Nisse, Sandrine Vial: Distributed Chasing of Network Intruders. SIROCCO 2006: 70-84
93		Pierre Fraigniaud, Nicolas Nisse: Monotony Properties of Connected Visible Graph Searching. WG 2006: 229-240
92		Anders Dessmark, Pierre Fraigniaud, Dariusz R. Kowalski, Andrzej Pelc: Deterministic Rendezvous in Graphs. Algorithmica 46(1): 69-96 (2006)
91		Pierre Fraigniaud, Cyril Gavoille: Header-size lower bounds for end-to-end communication in memoryless networks. Computer Networks 50(10): 1630-1638 (2006)
90		Pierre Fraigniaud, Cyril Gavoille, Christophe Paul: Eclecticism shrinks even small worlds. Distributed Computing 18(4): 279-291 (2006)
89		Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc: Collective tree exploration. Networks 48(3): 166-177 (2006)
88		Pierre Fraigniaud, Philippe Gauron: D2B: A de Bruijn based content-addressable network. Theor. Comput. Sci. 355(1): 65-79 (2006)
	2005
87		Pierre Fraigniaud: Distributed Computing, 19th International Conference, DISC 2005, Cracow, Poland, September 26-29, 2005, Proceedings Springer 2005
86		Pierre Fraigniaud: Greedy Routing in Tree-Decomposed Graphs. ESA 2005: 791-802
85		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
84		Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg: Label-Guided Graph Exploration by a Finite Automaton. ICALP 2005: 335-346
83		Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg: Labeling Schemes for Tree Representation. IWDC 2005: 13-24
82		Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse: Nondeterministic Graph Searching: From Pathwidth to Treewidth. MFCS 2005: 364-375
81		Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil: Space Lower Bounds for Graph Exploration via Reduced Automata. SIROCCO 2005: 140-154
80		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)
79		Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg: Efficient trigger-broadcasting in heterogeneous clusters. J. Parallel Distrib. Comput. 65(5): 628-642 (2005)
78		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
77		Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc: Collective Tree Exploration. LATIN 2004: 141-151
76		Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg: Graph Exploration by a Finite Automaton. MFCS 2004: 451-462
75		J. Ignacio Alvarez-Hamelin, Pierre Fraigniaud: Reducing Packet-Loss by Taking Long-Range Dependences into Account. NETWORKING 2004: 1096-1107
74		Pierre Fraigniaud, Cyril Gavoille, Christophe Paul: Eclecticism shrinks even small worlds. PODC 2004: 169-178
73		Pierre Fraigniaud, David Ilcinkas: Digraphs Exploration with Little Memory. STACS 2004: 246-257
72		Pierre Fraigniaud: A note on line broadcast in digraphs under the edge-disjoint paths mode. Discrete Applied Mathematics 144(3): 320-323 (2004)
71		Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc: Tree exploration with little memory. J. Algorithms 51(1): 38-63 (2004)
	2003
70		Pierre Fraigniaud, Cyril Gavoille: Lower Bounds for Oblivious Single-Packet End-to-End Communication. DISC 2003: 211-223
69		Anders Dessmark, Pierre Fraigniaud, Andrzej Pelc: Deterministic Rendezvous in Graphs. ESA 2003: 184-195
68		Christos Kaklamanis, Danny Krizanc, Pierre Fraigniaud, Michael Kaufmann: Topic Introduction. Euro-Par 2003: 884
67		Pierre Fraigniaud, Philippe Gauron: Brief announcement: an overview of the content-addressable network D2B. PODC 2003: 151
66		Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro: Election and Rendezvous in Fully Anonymous Systems with Sense of Direction. SIROCCO 2003: 17-32
65		Lali Barrière, Pierre Fraigniaud, Lata Narayanan, Jaroslav Opatrny: Dynamic construction of Bluetooth scatternets of fixed degree and low diameter. SODA 2003: 781-790
64		Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro: Can we elect if we cannot compare? SPAA 2003: 324-332
63		Lali Barrière, Pierre Fraigniaud, Nicola Santoro, Dimitrios M. Thilikos: Searching Is Not Jumping. WG 2003: 34-45
62		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
61		Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc: Tree exploration with little memory. SODA 2002: 588-597
60		Lali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro: Capture of an intruder by mobile agents. SPAA 2002: 200-209
59		Pierre Fraigniaud, Cyril Gavoille: A Space Lower Bound for Routing in Trees. STACS 2002: 65-75
58		Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille: Recognizing Knödel graphs. Discrete Mathematics 250(1-3): 41-62 (2002)
57		Pierre Fraigniaud, Jean-Claude König, Emmanuel Lazard: Oriented hypercubes. Networks 39(2): 98-106 (2002)
56		Johanne Cohen, Pierre Fraigniaud, Margarida Mitjana: Polynomial-Time Algorithms for Minimum-Time Broadcast in Trees. Theory Comput. Syst. 35(6): 641-665 (2002)
	2001
55		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
54		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
53		Lali Barrière, Pierre Fraigniaud, Evangelos Kranakis, Danny Krizanc: Efficient Routing in Networks with Long Range Contacts. DISC 2001: 270-284
52		Pierre Fraigniaud: Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode. ESA 2001: 440-451
51		Pierre Fraigniaud, Cyril Gavoille: Routing in Trees. ICALP 2001: 757-772
50		Franck Cappello, Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg: HiHCoHP: Toward a Realistic Communication Model for Hierarchical HyperClusters of Heterogeneous Processors. IPDPS 2001: 42
49		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)
48		Pierre Fraigniaud, Cyril Gavoille, Bernard Mans: Interval routing schemes allow broadcasting with linear message-complexity. Distributed Computing 14(4): 217-229 (2001)
47		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)
46		Pierre Fraigniaud, Joseph G. Peters: Minimum linear gossip graphs and maximal linear (Delta, k)-gossip graphs. Networks 38(3): 150-162 (2001)
	2000
45		Lali Barrière, Pierre Fraigniaud, Cyril Gavoille, Bernard Mans, John Michael Robson: On Recognizing Cayley Graphs. ESA 2000: 76-87
44		Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stephane Perennes: Assigning labels in unknown anonymous networks (extended abstract). PODC 2000: 101-111
43		Pierre Fraigniaud, Cyril Gavoille, Bernard Mans: Interval routing schemes allow broadcasting with linear message-complexity (extended abstract). PODC 2000: 11-20
42		Thomas H. Cormen, Frank K. H. A. Dehne, Pierre Fraigniaud, Yossi Matias: Guest Editors' Foreword. Theory Comput. Syst. 33(5/6): 335 (2000)
	1999
41		Johanne Cohen, Pierre Fraigniaud, Margarida Mitjana: Scheduling Calls for Multicasting in Tree-Networks. SODA 1999: 881-882
40		Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille: Recognizing Bipartite Incident-Graphs of Circulant Digraphs. WG 1999: 215-227
39		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
38		Pierre Fraigniaud, Cyril Gavoille: A Theoretical Model for Routing Complexity. SIROCCO 1998: 98-113
37		Pierre Fraigniaud, Cyril Gavoille: Interval Routing Schemes. Algorithmica 21(2): 155-182 (1998)
36		Eric Fleury, Pierre Fraigniaud: A General Theory for Deadlock Avoidance in Wormhole-Routed Networks. IEEE Trans. Parallel Distrib. Syst. 9(7): 626-638 (1998)
35		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)
34		Pierre Fraigniaud: Hierarchical Broadcast Networks. Inf. Process. Lett. 68(6): 303-305 (1998)
33		Eric Fleury, Pierre Fraigniaud: Strategies for Path-Based Multicasting in Wormhole-Routed Meshes. J. Parallel Distrib. Comput. 53(1): 26-62 (1998)
32		Pierre Fraigniaud: On XRAM and PRAM Models, and on Data-Movement-Intensive Problems. Theor. Comput. Sci. 194(1-2): 225-237 (1998)
	1997
31		Thierry Chich, Pierre Fraigniaud: An extended comparison of slotted and unslotted deflection routing. ICCCN 1997: 92-97
30		Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud: Broadcasting and Multicasting in Cut-through Routed Networks. IPPS 1997: 734-738
29		Pierre Fraigniaud, Sandrine Vial: Heuristics Algorithms for Personalized Communication Problems in Point-to-Point Networks. SIROCCO 1997: 240-252
28		Dominique Barth, Pierre Fraigniaud: Approximation Algorithms for Structured Communication Problems. SPAA 1997: 180-188
27		Pierre Fraigniaud, Cyril Gavoille: Universal Routing Schemes. Distributed Computing 10(2): 65-78 (1997)
26		Pierre Fraigniaud, Sandrine Vial: Approximation Algorithms for Broadcasting and Gossiping. J. Parallel Distrib. Comput. 43(1): 47-55 (1997)
	1996
25		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
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 II Springer 1996
23		Pierre Fraigniaud, Cyril Gavoille: Local Memory Requirement of Universal Routing Schemes. SPAA 1996: 183-188
22		Pierre Fraigniaud, Christian Laforest: Minimum gossip bus networks. Networks 27(4): 239-251 (1996)
	1995
21		Pierre Fraigniaud, Joseph G. Peters: Structured communication in torus networks. HICSS (2) 1995: 584-593
20		Pierre Fraigniaud, Cyril Gavoille: Memory Requirement for Universal Routing Schemes. PODC 1995: 223-230
	1994
19		Pierre Fraigniaud, Cyril Gavoille: Optimal Interval Routing. CONPAR 1994: 785-796
18		Eric Fleury, Pierre Fraigniaud: Multicasting in Meshes. ICPP (3) 1994: 151-158
17		Pierre Fraigniaud, Cyril Gavoille: A Characterization of Networks Supporting Linear Interval Routing. PODC 1994: 216-224
16		Pierre Fraigniaud, Emmanuel Lazard: Methods and problems of communication in usual networks. Discrete Applied Mathematics 53(1-3): 79-133 (1994)
15		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)
14		Jean-Claude Bermond, Pierre Fraigniaud: Broadcasting and Gossiping in de Bruijn Networks. SIAM J. Comput. 23(1): 212-225 (1994)
	1993
13		Pierre Fraigniaud, Christian Laforest: Disjoint Spanning Trees of Small Depth. PARCO 1993: 105-112
12		Pierre Fraigniaud, Claire Kenyon, Andrzej Pelc: Finding a Target Subnetwork in Sparse Networks with Random Faults. Inf. Process. Lett. 48(6): 297-303 (1993)
11		Henri-Pierre Charles, Pierre Fraigniaud: Scheduling a Scattering-Gathering Sequence on Hypercubes. Parallel Processing Letters 3: 29-42 (1993)
10		Pierre Fraigniaud, Arthur L. Liestman, Dominique Sotteau: Open Problems. Parallel Processing Letters 3: 507-524 (1993)
	1992
9		Pierre Fraigniaud: Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers. IEEE Trans. Computers 41(11): 1410-1419 (1992)
8		Pierre Fraigniaud: Complexity Analysis of Broadcasting in Hypercubes with Restricted Communication Capabilities. J. Parallel Distrib. Comput. 16(1): 15-26 (1992)
	1991
7		Pierre Fraigniaud: Fault-Tolerant Gossiping on Hypercube Multicomputers. EDMCC 1991: 463-472
6		Pierre Fraigniaud, Ching-Tien Ho: Arc-Disjoint Spanning Trees on Cube-Connected Cycles Networks. ICPP (1) 1991: 225-229
5		Pierre Fraigniaud, Claudine Peyrat: Broadcasting in a Hypercube when Some Calls Fail. Inf. Process. Lett. 39(3): 115-119 (1991)
	1990
4		Michel Cosnard, Pierre Fraigniaud: A Performance Analysis of Network Topologies in Finding the Roots of a Polynomial. CONPAR 1990: 875-886
3		Pierre Fraigniaud, Serge Miguet, Yves Robert: Scattering on a ring of processors. Parallel Computing 13(3): 377-383 (1990)
2		Michel Cosnard, Pierre Fraigniaud: Finding the roots of a polynomial on an MIMD multicomputer. Parallel Computing 15(1-3): 75-85 (1990)
1		Pierre Fraigniaud: Communications intensives dans les architectures a memoire distribuee et algorithmes paralleles pour la recherche de racines de polynomes. Ecole Normale Superieure de Lyon 1990: I-VIII

Coauthor Index

1	José Ignacio Alvarez-Hamelin (J. Ignacio Alvarez-Hamelin)	[75]
2	Lali Barrière	[45] [53] [54] [60] [62] [63] [64] [65] [66] [103]
3	Dominique Barth	[28]
4	Hervé Baumann	[131] [132] [154] [160]
5	Jean-Claude Bermond	[14]
6	Lélia Blin	[94] [110]
7	Luc Bougé	[24] [25]
8	Franck Cappello	[50] [80]
9	Augustin Chaintreau	[114] [118] [120]
10	Henri-Pierre Charles	[11]
11	Thierry Chich	[31] [47]
12	Johanne Cohen	[30] [35] [40] [41] [47] [56] [58]
13	Reuven Cohen	[83] [84] [115] [128]
14	Francesc Comellas	[55]
15	Thomas H. Cormen	[42]
16	Michel Cosnard	[2] [4] [15]
17	Pierluigi Crescenzi (Pilu Crescenzi)	[132] [154]
18	Frank K. H. A. Dehne (Frank Dehne)	[42]
19	Anders Dessmark	[69] [92]
20	Krzysztof Diks	[61] [71]
21	Yuval Emek	[126] [129] [134] [139] [153]
22	Josep Fàbrega	[55]
23	Eric Fleury	[18] [33] [36]
24	Paola Flocchini	[60] [64] [66] [103]
25	Fedor V. Fomin	[82] [109] [127] [152] [155]
26	Leszek Gasieniec	[77] [89]
27	Philippe Gauron	[67] [85] [88]
28	Cyril Gavoille	[17] [19] [20] [23] [27] [37] [38] [40] [43] [45] [48] [51] [58] [59] [70] [74] [90] [91] [106] [107] [116] [122] [123] [159]
29	George Giakkoupis	[133] [143] [145]
30	Hovhannes A. Harutyunyan	[160]
31	C. T. Howard Ho (Howard Ho, Ching-Tien Ho)	[6]
32	David Ilcinkas	[73] [76] [78] [81] [83] [84] [95] [96] [100] [107] [112] [113] [115] [123] [128] [138]
33	Christos Kaklamanis	[68]
34	Michael Kaufmann	[68] [99]
35	Jean-Claude König	[30] [35] [57]
36	Amos Korman	[83] [84] [105] [115] [124] [125] [126] [128] [129] [130] [134] [135] [139] [141] [142] [146] [153] [157]
37	Adrian Kosowski	[106] [122]
38	Dariusz R. Kowalski	[77] [89] [92]
39	Evangelos Kranakis	[53] [61] [71]
40	Stephan Kreutzer	[152] [155]
41	Danny Krizanc	[53] [68] [99]
42	Christian Laforest	[13] [22]
43	Matthieu Latapy	[85]
44	Emmanuel Lazard	[16] [57]
45	Emmanuelle Lebhar	[101] [102] [105] [106] [114] [117] [118] [119] [120] [122] [135] [136] [137]
46	Arthur L. Liestman	[10]
47	Zvi Lotker	[101] [102] [106] [117] [122] [136] [137]
48	Bernard Mans	[43] [45] [48] [50] [79] [80]
49	Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu)	[12]
50	Yossi Matias	[42]
51	Anne Mignotte	[24] [25]
52	Serge Miguet	[3]
53	Margarida Mitjana	[41] [56]
54	Lata Narayanan	[54] [62] [65]
55	Nicolas Nisse	[82] [93] [94] [97] [110] [111] [127]
56	Jaroslav Opatrny	[62] [65]
57	Christophe Paul	[74] [90]
58	Guy Peer	[76] [78]
59	Andrzej Pelc	[12] [44] [49] [61] [69] [71] [76] [77] [78] [89] [92] [95] [96] [107] [112] [113] [121] [123] [138] [140] [144] [156] [161]
60	David Peleg	[44] [49] [76] [78] [83] [84] [115] [128] [141] [157]
61	Stéphane Pérennes (Stephane Perennes)	[44] [49]
62	Joseph G. Peters	[21] [46]
63	Claudine Peyrat	[5]
64	Hoang-Anh Phan	[148] [150]
65	Sergio Rajsbaum	[81] [100] [158]
66	André Raspaud	[30] [35]
67	Yves Robert	[3] [24] [25]
68	John Michael Robson	[45]
69	Adi Rosén	[126] [129] [134] [139] [153]
70	Arnold L. Rosenberg	[50] [79] [80]
71	Nicola Santoro	[60] [63] [64] [66] [103]
72	Dominique Sotteau	[10]
73	Dimitrios M. Thilikos	[63] [109] [152] [155]
74	Sébastien Tixeuil	[81] [100]
75	Corentin Travers	[158]
76	R. de Verclos	[160]
77	Sandrine Vial	[26] [29] [39] [94] [110]
78	Laurent Viennot	[119]
79	Christos D. Zaroliagis	[99]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page