System level concurrency control for distributed database systems
ACM Transactions on Database Systems (TODS)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Polynomial algorithms for multiple processor agreement
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
NAMING AND SYNCHRONIZATION IN A DECENTRALIZED COMPUTER SYSTEM
NAMING AND SYNCHRONIZATION IN A DECENTRALIZED COMPUTER SYSTEM
An algorithm for concurrency control and recovery in replicated distributed databases
ACM Transactions on Database Systems (TODS)
The distributed firing squad problem
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A hundred impossibility proofs for distributed computing
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Perspectives on database theory
ACM SIGACT News
Symmetry and similarity in distributed systems
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Simple constant-time consensus protocols in realistic failure models (extended abstract)
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
A recovery algorithm for a distributed database system
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Fault-Tolerant Mobile Agent Execution
IEEE Transactions on Computers
FATOMAS-A Fault-Tolerant Mobile Agent System Based on the Agent-Dependent Approach
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
The inherent cost of nonblocking commitment
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Asynchronous Byzantine consensus
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Patterns of communication in consensus protocols
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
An asynchronous [(n - 1)/3]-resilient consensus protocol
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Randomized Byzantine Agreements
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Knowledge and common knowledge in a byzantine environment I: crash failures
TARK '86 Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge
On fairness in simulatability-based cryptographic systems
Proceedings of the 2005 ACM workshop on Formal methods in security engineering
Fast asynchronous byzantine agreement and leader election with full information
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Component Specification Using Event Classes
CBSE '09 Proceedings of the 12th International Symposium on Component-Based Software Engineering
Efficient algorithms for fault tolerant mobile agent execution
International Journal of High Performance Computing and Networking
Consensus in the presence of partial synchrony (Preliminary Version)
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Fast asynchronous Byzantine agreement and leader election with full information
ACM Transactions on Algorithms (TALG)
Mencius: building efficient replicated state machines for WANs
OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Database replication: a tale of research across communities
Proceedings of the VLDB Endowment
A new approach to fault-tolerant mobile agent execution in distributed systems
EC'05 Proceedings of the 6th WSEAS international conference on Evolutionary computing
Modeling fault-tolerant and reliable mobile agent execution in distributed systems
EC'05 Proceedings of the 6th WSEAS international conference on Evolutionary computing
A new approach for evaluation fault-tolerant mobile agent execution in distributed systems
EC'05 Proceedings of the 6th WSEAS international conference on Evolutionary computing
A new approach for evaluation fault-tolerant mobile agent execution in distributed systems
EC'05 Proceedings of the 6th WSEAS international conference on Evolutionary computing
The contest between simplicity and efficiency in asynchronous byzantine agreement
DISC'11 Proceedings of the 25th international conference on Distributed computing
Parallel algorithms for fault-tolerant mobile agent execution
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
Distributed computing with imperfect randomness
DISC'05 Proceedings of the 19th international conference on Distributed Computing
The Inherent Difficulty of Timely Primary-Backup Replication
Bell Labs Technical Journal
On the complexity of asynchronous agreement against powerful adversaries
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. We show that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the synchronous case, the "Byzantine Generals" problem.