Information-theoretic limits of selecting binary graphical models in high dimensions NP Santhanam, MJ Wainwright IEEE Transactions on Information Theory 58 (7), 4117-4134, 2012 | 227 | 2012 |

Always good turing: Asymptotically optimal probability estimation A Orlitsky, NP Santhanam, J Zhang Science 302 (5644), 427-431, 2003 | 194 | 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 | 180 | 2004 |

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

Speaking of infinity [iid strings] A Orlitsky, NP Santhanam IEEE Transactions on Information Theory 50 (10), 2215-2230, 2004 | 76 | 2004 |

Probability estimation and compression involving large alphabets N Santhanam University of California, San Diego, 2006 | 71* | 2006 |

Limit results on pattern entropy A Orlitsky, NP Santhanam, K Viswanathan, J Zhang IEEE Transactions on Information Theory 52 (7), 2954-2964, 2006 | 45* | 2006 |

Optimal detector for multilevel NAND flash memory channels with intercell interference M Asadi, X Huang, A Kavcic, NP Santhanam IEEE Journal on Selected Areas in Communications 32 (5), 825-835, 2014 | 36 | 2014 |

Universal compression of unknown alphabets N Jevtic, A Orlitsky, N Santhanam Proceedings IEEE International Symposium on Information Theory,, 320, 2002 | 36 | 2002 |

On estimating the probability multiset A Orlitsky, NP Santhanam, K Viswanathan, J Zhang draft manuscript, June, 2011 | 31* | 2011 |

Agnostic insurability of model classes N Santhanam, V Anantharam The Journal of Machine Learning Research 16 (1), 2329-2355, 2015 | 21* | 2015 |

New tricks for old dogs: Large alphabet probability estimation NP Santhanam, A Orlitsky, K Viswanathan 2007 IEEE Information Theory Workshop, 638-643, 2007 | 21* | 2007 |

Stationary and transition probabilities in slow mixing, long memory markov processes M Asadi, RP Torghabeh, NP Santhanam IEEE Transactions on Information Theory 60 (9), 5682-5701, 2014 | 20* | 2014 |

A lower bound on compression of unknown alphabets N Jevtić, A Orlitsky, NP Santhanam Theoretical computer science 332 (1-3), 293-311, 2005 | 19 | 2005 |

Thermodynamic computing T Conte, E DeBenedictis, N Ganesh, T Hylton, JP Strachan, RS Williams, ... arXiv preprint arXiv:1911.01968, 2019 | 14 | 2019 |

Spatial correlations for solar pv generation and its tree approximation analysis NT Khajavi, A Kuh, NP Santhanam Signal and Information Processing Association Annual Summit and Conference …, 2014 | 13 | 2014 |

Bounds of compression of unknown alphabets A Orlitsky, NP Santhanam, J Zhang IEEE International Symposium on Information Theory, 2003. Proceedings., 111, 2003 | 12 | 2003 |

Data-driven weak universal redundancy N Santhanam, V Anantharam, A Kavcic, W Szpankowski 2014 IEEE International Symposium on Information Theory, 1877-1881, 2014 | 10 | 2014 |

Population estimation with performance guarantees A Orlitsky, NP Santhanam, K Viswanathan 2007 IEEE International Symposium on Information Theory, 2026-2030, 2007 | 10 | 2007 |

On redundancy of memoryless sources over countable alphabets M Hosseini, N Santhanam 2014 International Symposium on Information Theory and its Applications, 299-303, 2014 | 8* | 2014 |