, Graphes et Hypergraphes. Dunod, 1973.

Antepenultimate broadcasting, 1992. ,

Problem 3.5. Math. Spectrum, 3:68{69, p.71, 1970. ,

Finding the roots of a polynomial on an MIMD multicomputer, Parallel Computing, vol.15, pp.75-85, 1990. ,

Gossiping in minimum time, SIAM Journal on Computing, vol.21, issue.1, pp.111-139, 1992. ,

On the number of rounds necessary to disseminate information, ACM Symposium on Parallel Algorithms and Architectures, 1989. ,

, Minimum broadcast graphs. Discrete Mathematics, vol.25, pp.185-193, 1979.

Methods and Problems of Communication in Usual Networks, Discrete Applied Maths (special issue on broadcasting, 1994. ,

Open problems. Parallel Processing Letters (special issue on algorithmic and structural aspects of interconnection networks, vol.3, pp.507-524, 1993. ,

A survey of gossiping and broadcasting in communication networks, Networks, vol.18, pp.319-349, 1986. ,

Communication in bus networks, Parallel and Distributed Computing, v olume 805 of Lecture Notes in Computer Science, pp.197-206, 1994. ,

Optimum broadcasting and personalized communication in hypercubes, IEEE Transaction on Computers, vol.38, issue.9, pp.1249-1268, 1989. ,

, Information ows on hypergraphs. Discrete mathematics, vol.113, pp.71-97, 1993.

Some minimum gossip graphs, Networks, vol.23, pp.333-341, 1993. ,

Quick gossiping by telegraphs, Discrete Mathematics, vol.126, pp.421-424, 1994. ,

Broadcasting in DMA-bound bounded degree graphs, Discrete Applied Mathematics, vol.37, pp.387-400, 1992. ,

Data replication in dense matrix factorization. Parallel Processing Letters (special issue on algorithmic and structural aspects of interconnection networks, vol.3, pp.419-430, 1993. ,

Fast information sharing in a distributed system, pp.1-9 ,