Sublinear bounds for randomized leader election

DOI10.1016/J.TCS.2014.02.009MaRDI QIDQ6826631zbMATH OpenFDO

Authors Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan

Publication date 2 December 2014

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

randomizationlower bounddistributed algorithmleader election

Mathematics Subject Classification ID

Randomized algorithms (68W20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15) Distributed systems (68M14)

This page was built for publication: Sublinear bounds for randomized leader election

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