This paper considers the problem of electing a leader in a dynamic ring in which processors are permitted to fail and recover during election. Θ(nlogn+kr) messages, when counting only messages sent by functional processors, are shown to be necessary and sufficient for dynamic ring election, where kr is the number of processor recoveries experienced.link_to_subscribed_fulltex