[For the entire collection see Zbl 0563.00018.]
In the paper a synchronous broadcasting network, a distributed computation model which represents communication networks, is considered. The problem investigated is a basic problem of information sharing, the computation of the multiple identification function. That is, given a network of p processors, each of which contains an n-bit string of information, the question is how every processor can compute the subset of processors which have the same information as itself.
Immediate algorithms which solves this problem there are presented.
There are proved lower bounds for the problem and suggested open problems concerning new techniques for proving lower bounds in the presence of broadcasting, as well as other problems about efficient use of the model and comparison between different models of distributed computation.