Fast Byzantine leader election in dynamic networks
From MaRDI portal
Publication:1664142
DOI10.1007/978-3-662-48653-5_19zbMath1394.68029OpenAlexW2250039092MaRDI QIDQ1664142
Peter Robinson, Gopal Pandurangan, John E. Augustine
Publication date: 24 August 2018
Full work available at URL: https://pureadmin.qub.ac.uk/ws/files/16747696/disc.pdf
Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)
Related Items (5)
Some lower bounds in dynamic networks with oblivious adversaries ⋮ Resource Burning for Permissionless Systems (Invited Paper) ⋮ Distributed computation of exact average degree and network size in finite time under quantized communication ⋮ Leader election in well-connected graphs ⋮ Bankrupting Sybil despite churn
This page was built for publication: Fast Byzantine leader election in dynamic networks
