Smoothed Analysis of Leader Election in Distributed Networks

DOI10.1007/978-3-030-64348-5_14MaRDI QIDQ6487906zbMATH OpenFDO

Authors Anisur Rahaman Molla

Publication date 21 March 2023

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(1)

• Models of smoothing in dynamic networks

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)