Smoothed Analysis of Leader Election in Distributed Networks

DOI10.1007/978-3-030-64348-5_14zbMATH Open1517.68052MaRDI QIDQ6487906FDOQ6487906

Authors: Anisur Rahaman Molla 

Publication date: 21 March 2023

Recommendations

• Sublinear bounds for randomized leader election
• Sublinear bounds for randomized leader election
• Leader election in well-connected graphs
• On the Complexity of Universal Leader Election
• On the complexity of universal leader election

Mathematics Subject Classification ID

Randomized algorithms (68W20) Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Distributed systems (68M14)

This page was built for publication: Smoothed Analysis of Leader Election in Distributed Networks

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