Simplifying Itai-Rodeh leader election for anonymous rings

zbMATH Open1272.68041MaRDI QIDQ2848414FDOQ2848414

Authors: Jun Pang, Wan Fokkink 

Publication date: 26 September 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066105002367

Recommendations

• scientific article; zbMATH DE number 617073
• scientific article; zbMATH DE number 177572
• The space complexity of leader election in anonymous networks
• The Bit Complexity of Randomized Leader Election on a Ring
• Randomized leader election

Mathematics Subject Classification ID

Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (4)

• Confluence Reduction for Probabilistic Systems
• A linear process-algebraic format with data for probabilistic automata
• Variations of the Itai-Rodeh Algorithm for Computing Anonymous Ring Size
• Confluence reduction for Markov automata

Uses Software

• PRISM

This page was built for publication: Simplifying Itai-Rodeh leader election for anonymous rings

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