scientific article; zbMATH DE number 1950667
From MaRDI portal
Publication:4413396
zbMATH Open1018.68728MaRDI QIDQ4413396FDOQ4413396
Authors: Leslie Lamport 
Publication date: 17 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2584/25840022.htm
Title of this publication is not available (Why is that?)
Recommendations
- Lower bounds for asynchronous consensus
- Tight bounds for asynchronous randomized consensus
- Tight bounds for asynchronous randomized consensus
- Two lower bounds in asynchronous distributed computation
- Lower bound for scalable Byzantine agreement
- Lower bound for scalable Byzantine agreement
- A simple proof of the uniform consensus synchronous lower bound.
- scientific article; zbMATH DE number 1559571
- Lower bounds for randomized consensus under a weak adversary
- Lower bounds for randomized consensus under a weak adversary
Cited In (10)
- Lower bounds for asynchronous consensus
- Refined quorum systems
- Theory of Cryptography
- Title not available (Why is that?)
- A bivalency proof of the lower bound for uniform consensus
- Lower bound on the step complexity of anonymous binary consensus
- Synchronous consensus under hybrid process and link failures
- Title not available (Why is that?)
- Bosco: One-Step Byzantine Asynchronous Consensus
- Cutoff bounds for consensus algorithms
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 Q4413396)
