Optimal algorithms for Byzantine agreement
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A robust noncrytographic protocol for collective coin flipping
SIAM Journal on Discrete Mathematics
Fault-tolerant computation in the full information model (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Simple and efficient leader election in the full information model
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Randomness-optimal sampling, extractors, and constructive leader election
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Lower bounds for distributed coin-flipping and randomized consensus
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Lower bounds for distributed coin-flipping and randomized consensus
Journal of the ACM (JACM)
Fast leader-election protocols with bounded cheaters' edge
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
An autonomic election algorithm based on emergence in natural systems
Integrated Computer-Aided Engineering - Autonomous Computing
Stochastic coalescence in logarithmic time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.00 |