We address the problem of electing a leader in an anonymous, asynchron
ous network of arbitrary topology. Our algorithms are considerably sim
pler than known algorithms and have equal or improved communication co
mplexity. (C) 1994 Academic Press, Inc.