scientific article; zbMATH DE number 177572

MaRDI QIDQ4037443zbMATH OpenFDO

Authors

Publication date 18 May 1993

zbMATH Keywords

asynchronous processor ringsaverage case complexity of leader electionprobabilistic algorithm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The Bit Complexity of Randomized Leader Election on a Ring
• New lower bound techniques for distributed leader finding and other problems on rings of processors
• scientific article; zbMATH DE number 2113969
• Electing a leader in a synchronous ring
• Improved bounds for electing a leader in a synchronous ring

Cited in

(13)

• Electing a leader in a ring with link failures
• Average number of messages for distributed leader-fitting in rings of processors
• Sorting and election in anonymous asynchronous rings.
• Fast leader election in anonymous rings with bounded expected delay
• Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
• scientific article; zbMATH DE number 1696668 (Why is no real title available?)
• Simplifying Itai-Rodeh leader election for anonymous rings
• The Bit Complexity of Randomized Leader Election on a Ring
• Tight lower bounds for probabilistic solitude verification on anonymous rings
• scientific article; zbMATH DE number 617073 (Why is no real title available?)
• scientific article; zbMATH DE number 2113969 (Why is no real title available?)
• Asymptotically optimal election on weighted rings
• New lower bound techniques for distributed leader finding and other problems on rings of processors

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037443)