1. A. Aggarwal, Optimal bounds for finding maximum on array of processors with k global buses, IEEE Transactions on Computers 35 (1986) 62–64.
2. A. Bar-Noy and D. Peleg, Square meshes are not always optimal, ACM Symposium on Parallel Algorithms and Architectures, (ACM, 1989) 138–147.
3. C. Berge, Hypergraphs, (North Holland, 1989).
4. J-C. Bermond, Le problème des “ouvroirs” (Hypergraph gossip problem), in Colloques Internacionaux du Centre National de la Recherche Scientifique, No. 260, Orsay, 1976, 31–34.
5. J-C. Bermond and F.O. Ergincan, Bus interconnection networks, Technical Report No. 93-56, Université de Nice-Sophia Antipolis, September 1993.