Scalable leader election

DOI10.1145/1109557.1109667zbMath1192.91082OpenAlexW4248885329MaRDI QIDQ3581515

Vee Erik, Vishal Sanwalani, Jared Saia, Valerie King

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1109557.1109667

Mathematics Subject Classification ID

Voting theory (91B12) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (20)

Lower bound for scalable Byzantine agreement ⋮ The Cost of Fault Tolerance in Multi-Party Communication Complexity ⋮ Optimal extension protocols for Byzantine broadcast and agreement ⋮ Secure multi-party computation in large networks ⋮ Improved deterministic leader election in diameter-two networks ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Gossiping for communication-efficient broadcast ⋮ Efficient adaptively-secure Byzantine agreement for long messages ⋮ On the complexity of asynchronous agreement against powerful adversaries ⋮ Communication complexity of Byzantine agreement, revisited ⋮ Must the communication graph of MPC protocols be an expander? ⋮ From fairness to full security in multiparty computation ⋮ Robust random number generation for peer-to-peer systems ⋮ Sublinear-round Byzantine agreement under corrupt majority ⋮ Fault-Tolerant Consensus with an Abstract MAC Layer. ⋮ The Contest between Simplicity and Efficiency in Asynchronous Byzantine Agreement ⋮ Network-Hiding Communication and Applications to Multi-party Protocols ⋮ Unnamed Item ⋮ Distributed agreement in dynamic peer-to-peer networks ⋮ Efficient constructions for almost-everywhere secure computation

This page was built for publication: Scalable leader election