Lower bound on the step complexity of anonymous binary consensus

DOI10.1007/978-3-662-53426-7_19zbMath1393.68026OpenAlexW2516209749MaRDI QIDQ1660942

Ohad Ben-Baruch, Danny Hendler, Hagit Attiya

Publication date: 16 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-662-53426-7_19

Mathematics Subject Classification ID

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

Related Items (1)

Agreeing within a few writes

This page was built for publication: Lower bound on the step complexity of anonymous binary consensus