How to compress interactive communication B Barak, M Braverman, X Chen, A Rao SIAM Journal on Computing 42 (3), 1327-1363, 2013 | 231 | 2013 |

Information equals amortized communication M Braverman, A Rao IEEE Transactions on Information Theory 60 (10), 6058-6069, 2014 | 203 | 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 | 203 | 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 | 164* | 2006 |

Parallel repetition in projection games and a concentration bound A Rao SIAM Journal on Computing 40 (6), 1871-1891, 2011 | 141 | 2011 |

Toward coding for maximum errors in interactive communication M Braverman, A Rao IEEE Transactions on Information Theory 60 (11), 7248-7255, 2014 | 122 | 2014 |

Extractors for a constant number of polynomially small min-entropy independent sources A Rao SIAM Journal on Computing 39 (1), 168-194, 2009 | 111 | 2009 |

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

We need a research data census F Berman Communications of the ACM 53 (12), 39-41, 2010 | 79* | 2010 |

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 | 69 | 2013 |

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

Extractors for low-weight affine sources A Rao 2009 24th Annual IEEE Conference on Computational Complexity, 95-101, 2009 | 66 | 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 | 59 | 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 | 52 | 2006 |

Competitor analysis and its defenses in the e-marketplace YP Sheng, PP Mykytyn Jr, CR Litecky Communications of the ACM 48 (8), 107-112, 2005 | 50* | 2005 |

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 | 42 | 2009 |

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009 … I Dinur, K Jansen, S Naor, J Rolim Springer, 2009 | 37* | 2009 |

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 | 36 | 2011 |

Strong parallel repetition theorem for free projection games B Barak, A Rao, R Raz, R Rosen, R Shaltiel Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009 | 35 | 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 | 34 | 2008 |