Rounds vs queries trade-off in noisy computation
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Lower Bounds for the Noisy Broadcast Problem
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A tight lower bound for parity in noisy communication networks
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Towards efficient designs for in-network computing with noisy wireless channels
INFOCOM'10 Proceedings of the 29th conference on Information communications
Making polynomials robust to noise
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.89 |