An O(lg n) expected rounds randomized Byzantine generals protocol
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
On processor coordination using asynchronous hardware
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Optimal algorithms for Byzantine agreement
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the improbability of reaching Byzantine agreements
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Better computing on the anonymous ring
Journal of Algorithms
Proving probabilistic correctness statements: the case of Rabin's algorithm for mutual exclusion
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Randomized mutual exclusion algorithms revisited
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable
Journal of the ACM (JACM)
Solution of a problem in concurrent programming control
Communications of the ACM
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
On the space complexity of randomized synchronization
Journal of the ACM (JACM)
| Hi-index | 0.00 |