Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
A communication-efficient canonical form for fault-tolerant distributed protocols
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Knowledge and common knowledge in a Byzantine environment I: crash failures
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
A communication-efficient canonical form for fault-tolerant distributed protocols
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Asynchronous approximate agreement
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A Compiler that Increases the Fault Tolerance of Asynchronous Protocols
IEEE Transactions on Computers
A hundred impossibility proofs for distributed computing
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Impossibility results for asynchronous PRAM (extended abstract)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
The asynchronous computability theorem for t-resilient tasks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A simple constructive computability theorem for wait-free computation
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Towards a topological characterization of asynchronous complexity
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
The topological structure of asynchronous computability
Journal of the ACM (JACM)
A classification of wait-free loop agreement tasks
Theoretical Computer Science - Special issue: Distributed computing
A self-adjusting algorithm for byzantine agreement
Distributed Computing
Brief anouncement: simple gradecast based algorithms
DISC'10 Proceedings of the 24th international conference on Distributed computing
Optimal resilience asynchronous approximate agreement
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Iterative approximate byzantine consensus in arbitrary directed graphs
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
All-to-All gradecast using coding with byzantine failures
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Byzantine vector consensus in complete graphs
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |