The paper describes a randomized, distributed enumeration algorithm which (in contrast to deterministic solutions) works for all network topologies and with fully asynchronous communication. The algorithm’s correctness and efficiency are argued. The expectation value of its execution time is of the order of the time needed for a broadcast.
Key words: distributed algorithms; analysis of algorithms; interconnection networks.