Distributed and randomized enumeration
Piotr Dembiński · 2002
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 correctness and efficiency are considered. The expected execution time is of the order of the time needed for a broadcast.