Simple extractors for all min-entropies and a new pseudorandom generator
Journal of the ACM (JACM)
Byzantine agreement in the full-information model in O(log n) rounds
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Fast leader-election protocols with bounded cheaters' edge
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Extractors from Reed-Muller codes
Journal of Computer and System Sciences - Special issue on FOCS 2001
An autonomic election algorithm based on emergence in natural systems
Integrated Computer-Aided Engineering - Autonomous Computing
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
On obtaining pseudorandomness from error-correcting codes
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Stochastic coalescence in logarithmic time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Rationality in the full-information model
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Random selection with an adversarial majority
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
New independent source extractors with exponential improvement
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |