How to compress interactive communication B Barak, M Braverman, X Chen, A Rao Proceedings of the forty-second ACM symposium on Theory of computing, 67-76, 2010 | 252 | 2010 |

Information equals amortized communication M Braverman, A Rao IEEE Transactions on Information Theory 60 (10), 6058-6069, 2014 | 223 | 2014 |

A technique for dynamic updating of Java software A Orso, A Rao, MJ Harrold International Conference on Software Maintenance, 2002. Proceedings., 649-658, 2002 | 218 | 2002 |

2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction B Barak, A Rao, R Shaltiel, A Wigderson Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 179* | 2006 |

Parallel repetition in projection games and a concentration bound A Rao Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, 1-10, 2008 | 159 | 2008 |

Towards coding for maximum errors in interactive communication M Braverman, A Rao Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 141 | 2011 |

Extractors for a constant number of polynomially small min-entropy independent sources A Rao Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 116 | 2006 |

Communication Complexity: and Applications A Rao, A Yehudayoff Cambridge University Press, 2020 | 114 | 2020 |

An exposition of Bourgain’s 2-source extractor A Rao Electronic Colloquium on Computational Complexity (ECCC) 14 (034), 2007 | 90 | 2007 |

Pseudorandom generators for regular branching programs M Braverman, A Rao, R Raz, A Yehudayoff SIAM Journal on Computing 43 (3), 973-986, 2014 | 89 | 2014 |

Direct products in communication complexity M Braverman, A Rao, O Weinstein, A Yehudayoff 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 746-755, 2013 | 81 | 2013 |

Extractors for low-weight affine sources A Rao 2009 24th Annual IEEE Conference on Computational Complexity, 95-101, 2009 | 74 | 2009 |

Rounding parallel repetitions of unique games B Barak, M Hardt, I Haviv, A Rao, O Regev, D Steurer 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 374-383, 2008 | 65 | 2008 |

Deterministic extractors for small-space sources J Kamp, A Rao, S Vadhan, D Zuckerman Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 55 | 2006 |

Deterministic extractors for small-space sources J Kamp, A Rao, S Vadhan, D Zuckerman Journal of Computer and System Sciences 77 (1), 191-220, 2011 | 47 | 2011 |

2-source extractors under computational assumptions and cryptography with defective randomness YT Kalai, X Li, A Rao 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 617-626, 2009 | 46 | 2009 |

Network extractor protocols YT Kalai, X Li, A Rao, D Zuckerman 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 654-663, 2008 | 40 | 2008 |

Strong parallel repetition theorem for free projection games B Barak, A Rao, R Raz, R Rosen, R Shaltiel International Workshop on Approximation Algorithms for Combinatorial …, 2009 | 39 | 2009 |

Direct product via round-preserving compression M Braverman, A Rao, O Weinstein, A Yehudayoff International Colloquium on Automata, Languages, and Programming, 232-243, 2013 | 37 | 2013 |

Coding for sunflowers A Rao arXiv preprint arXiv:1909.04774, 2019 | 35 | 2019 |