89 search results - page 7 / 18 » Fast Byzantine Consensus |
121
click to vote
NCA
2007
IEEE
15 years 6 months ago
2007
IEEE
Open distributed systems are typically composed by an unknown number of processes running in heterogeneous hosts. Their communication often requires tolerance to temporary disconn...
78
Voted
ICDCS
2006
IEEE
15 years 6 months ago
2006
IEEE
Despite the large amount of Byzantine fault-tolerant algorithms for message-passing systems designed through the years, only recently algorithms for the coordination of processes ...
BMCBI
2010
15 years 15 days ago
2010
Background: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites...
104
Voted
PODC
2009
ACM
15 years 7 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
119
Voted
DC
2006
15 years 12 days ago
2006
Abstract. Paxos and Fast Paxos are optimal consensus algorithms that are simple and elegant, while suitable for efficient implementation. In this paper, we compare the performance ...