scientific article; zbMATH DE number 2006649

zbMATH Open1024.68528MaRDI QIDQ4436047FDOQ4436047

Authors: Sergio Rajsbaum, Mark Tuttle, Maurice Herlihy 

Publication date: 23 November 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2180/21800136.htm

Title of this publication is not available (Why is that?)

Recommendations

• Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound
• Tight bounds for connectivity and set agreement in Byzantine synchronous systems
• scientific article; zbMATH DE number 1950667
• Lower bounds for asynchronous consensus
• Tight bounds for \(k\)-set agreement
• A simple proof of the uniform consensus synchronous lower bound.
• Optimal algorithms for synchronous Byzantine \(k\)-set agreement
• Optimal algorithms for synchronous Byzantine \(k\)-set agreement
• From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cited In (4)

• Tight bounds for \(k\)-set agreement
• Tight bounds for connectivity and set agreement in Byzantine synchronous systems
• Tight bounds for \(k\)-set agreement with limited-scope failure detectors
• A simple proof of the uniform consensus synchronous lower bound.

This page was built for publication:

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