Lower bound on the step complexity of anonymous binary consensus

DOI10.1007/978-3-662-53426-7_19MaRDI QIDQ1660942zbMATH OpenOpenAlexFDO

Authors Hagit Attiya, Ohad Ben-Baruch, Danny Hendler

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

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

Recommendations

• On the uncontended complexity of anonymous consensus
• Lower bound for scalable Byzantine agreement
• Lower bound for scalable Byzantine agreement
• Lower bounds for weak Byzantine agreement
• On the uncontended complexity of anonymous agreement
• Efficient algorithms for anonymous Byzantine agreement
• Lower bounds for asynchronous consensus
• scientific article; zbMATH DE number 1950667

Cited in

(1)

• Agreeing within a few writes

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

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