Coding for computing A Orlitsky, JR Roche Proceedings of IEEE 36th Annual Foundations of Computer Science, 502-511, 1995 | 380 | 1995 |

Zero-error information theory J Korner, A Orlitsky IEEE Transactions on Information Theory 44 (6), 2207-2229, 1998 | 254 | 1998 |

Stopping set distribution of LDPC code ensembles A Orlitsky, K Viswanathan, J Zhang IEEE Transactions on Information Theory 51 (3), 929-953, 2005 | 221 | 2005 |

Always good turing: Asymptotically optimal probability estimation A Orlitsky, NP Santhanam, J Zhang Science 302 (5644), 427-431, 2003 | 196 | 2003 |

Universal compression of memoryless sources over unknown alphabets A Orlitsky, NP Santhanam, J Zhang IEEE Transactions on Information Theory 50 (7), 1469-1481, 2004 | 167 | 2004 |

Source coding and graph entropies N Alon, A Orlitsky IEEE Transactions on Information Theory 42 (5), 1329-1339, 1996 | 153 | 1996 |

Worst-case interactive communication. I. Two messages are almost optimal A Orlitsky IEEE Transactions on Information Theory 36 (5), 1111-1126, 1990 | 134 | 1990 |

Monte Carlo generation of self-avoiding walks with fixed endpoints and fixed length N Madras, A Orlitsky, LA Shepp Journal of Statistical Physics 58 (1), 159-183, 1990 | 114 | 1990 |

Optimal prediction of the number of unseen species A Orlitsky, AT Suresh, Y Wu Proceedings of the National Academy of Sciences 113 (47), 13283-13288, 2016 | 110 | 2016 |

Stopping sets and the girth of Tanner graphs A Orlitsky, R Urbanke, K Viswanathan, J Zhang Proceedings IEEE International Symposium on Information Theory,, 2, 2002 | 102 | 2002 |

On modeling profiles instead of values A Orlitsky, N Santhanam, K Viswanathan, J Zhang arXiv preprint arXiv:1207.4175, 2012 | 93 | 2012 |

On learning distributions from their samples S Kamath, A Orlitsky, D Pichapati, AT Suresh Conference on Learning Theory, 1066-1100, 2015 | 90 | 2015 |

Interactive communication of balanced distributions and of correlated files A Orlitsky SIAM Journal on Discrete Mathematics 6 (4), 548-564, 1993 | 84 | 1993 |

On codes that avoid specified differences BE Moision, A Orlitsky, PH Siegel IEEE Transactions on Information Theory 47 (1), 433-442, 2001 | 83 | 2001 |

Worst-case interactive communication. ii. two messages are not optimal A Orlitsky IEEE Transactions on Information Theory 37 (4), 995-1005, 1991 | 82 | 1991 |

Repeated communication and Ramsey graphs N Alon, A Orlitsky IEEE Transactions on Information Theory 41 (5), 1276-1289, 1995 | 79 | 1995 |

Privacy, additional information and communication R Bar-Yehuda, B Chor, E Kushilevitz, A Orlitsky IEEE Transactions on Information Theory 39 (6), 1930-1943, 1993 | 76 | 1993 |

Near-optimal-sample estimators for spherical gaussian mixtures J Acharya, A Jafarpour, A Orlitsky, AT Suresh arXiv preprint arXiv:1402.4746, 2014 | 75 | 2014 |

Competitive Distribution Estimation: Why is Good-Turing Good. A Orlitsky, AT Suresh NIPS, 2143-2151, 2015 | 73 | 2015 |

The complexity of estimating Rényi entropy J Acharya, A Orlitsky, AT Suresh, H Tyagi Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 72 | 2014 |