MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "Lower Bounds for Asynchronous Consensus." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 4 documents found, showing 1 through 4.
ATOM RSS
  • Refined Quorum Systems  
  • by Rachid Guerraoui, Marko Vukolić — 2007 — In Proceedings of the 26th annual ACM symposium on Principles of distributed computing
  • … if |S| > 2t + k. These inequalities correspond to Lamport’s lower bounds for “asynchronous” consensus…
  • Cited by 6 (2 self) – Add To MetaCart
  • Fast Byzantine Paxos  
  • by Jean-Philippe Martin Lorenzo
  • … steps 1 to reach consensus in non-Byzantine environments, matching the lower bound formalized by Keidar…
  • Add To MetaCart
  • Fast Byzantine consensus  
  • by Jean-Philippe Martin, Lorenzo Alvisi — 2005 — IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING
  • … of the initial configuration. In a paper on lower bounds for asynchronous consensus [13], Lamport conjectures…
  • Cited by 40 (6 self) – Add To MetaCart
Help! Showing 1 through 4.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB