1. The number of fixed points of the majority rule;Agur;Discrete Math.,1988
2. J.-C. Bermond, J. Bond, D. Peleg, S. Perennes, Tight bounds on the size of 2-monopolies, Proceedings of the Third Colloquium on Structural Information and Communication Complexity (SIROCCO 96), Siena, 1996, pp. 170–179.
3. Distributed loop computer networks;Bermond;J. Parallel Distrib. Comput.,1995
4. J.-C. Bermond, D. Peleg, The power of small coalitions in graphs, in: Proceedings of the Second Colloquium on Structural Information and Communication Complexity (SIROCCO 95), Olympia, 1995, pp. 173–184.
5. Efficient testing and reconfiguration of VLSI linear arrays;De Prisco;Theoret. Comput. Sci.,1998