| Coding for computing A Orlitsky, JR Roche Proceedings of IEEE 36th Annual Foundations of Computer Science, 502-511, 1995 | 424 | 1995 |
| Zero-error information theory J Korner, A Orlitsky IEEE Transactions on Information Theory 44 (6), 2207-2229, 1998 | 273 | 1998 |
| Stopping set distribution of LDPC code ensembles A Orlitsky, K Viswanathan, J Zhang IEEE Transactions on Information Theory 51 (3), 929-953, 2005 | 233 | 2005 |
| Always good turing: Asymptotically optimal probability estimation A Orlitsky, NP Santhanam, J Zhang Science 302 (5644), 427-431, 2003 | 214 | 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 | 184 | 2004 |
| Source coding and graph entropies N Alon, A Orlitsky IEEE Transactions on Information Theory 42 (5), 1329-1339, 1996 | 174 | 1996 |
| Worst-case interactive communication. I. Two messages are almost optimal A Orlitsky IEEE Transactions on Information Theory 36 (5), 1111-1126, 1990 | 142 | 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 | 136 | 2016 |
| On learning distributions from their samples S Kamath, A Orlitsky, D Pichapati, AT Suresh Conference on Learning Theory, 1066-1100, 2015 | 124 | 2015 |
| Monte Carlo generation of self-avoiding walks with fixed endpoints and fixed length N Madras, A Orlitsky, LA Shepp Journal of Statistical Physics 58, 159-183, 1990 | 119 | 1990 |
| 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 | 108 | 2002 |
| On modeling profiles instead of values A Orlitsky, N Santhanam, K Viswanathan, J Zhang arXiv preprint arXiv:1207.4175, 2012 | 97 | 2012 |
| Near-optimal-sample estimators for spherical gaussian mixtures AT Suresh, A Orlitsky, J Acharya, A Jafarpour Advances in Neural Information Processing Systems 27, 2014 | 93 | 2014 |
| Competitive distribution estimation: Why is good-turing good A Orlitsky, AT Suresh Advances in Neural Information Processing Systems 28, 2015 | 92 | 2015 |
| On codes that avoid specified differences BE Moision, A Orlitsky, PH Siegel IEEE Transactions on Information Theory 47 (1), 433-442, 2001 | 88 | 2001 |
| Interactive communication of balanced distributions and of correlated files A Orlitsky SIAM Journal on Discrete Mathematics 6 (4), 548-564, 1993 | 86 | 1993 |
| Speaking of infinity [iid strings] A Orlitsky, NP Santhanam IEEE Transactions on Information Theory 50 (10), 2215-2230, 2004 | 84 | 2004 |
| Repeated communication and Ramsey graphs N Alon, A Orlitsky IEEE Transactions on Information Theory 41 (5), 1276-1289, 1995 | 84 | 1995 |
| Worst-case interactive communication. ii. two messages are not optimal A Orlitsky IEEE Transactions on Information Theory 37 (4), 995-1005, 1991 | 84 | 1991 |
| 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 | 83 | 2014 |
