Performance of universal codes over infinite alphabets. - Alon Orlitsky; Narayana P. Santhanam (DCC, 2003)

Always Good Turing: Asymptotically Optimal Probability Estimation. - Alon Orlitsky; Narayana P. Santhanam; Junan Zhang (FOCS, 2003)

Algorithms for modeling distributions over large alphabets. - Alon Orlitsky; Sajama; Narayana P. Santhanam; Krishnamurthy Viswanathan; Junan Zhang (ISIT, 2004)

Relative redundancy: a more stringent performance guarantee for universal compression. - Alon Orlitsky; Narayana P. Santhanam; Junan Zhang (ISIT, 2004)

On Modeling Profiles Instead of Values. - Alon Orlitsky; Narayana P. Santhanam; Krishnamurthy Viswanathan; Junan Zhang (UAI, 2004)

Speaking of infinity [i.i.d. strings]. - Alon Orlitsky; Narayana P. Santhanam (IEEE Trans. Inf. Theory, 2004)

Universal compression of memoryless sources over unknown alphabets. - Alon Orlitsky; Narayana P. Santhanam; Junan Zhang (IEEE Trans. Inf. Theory, 2004)

Convergence of profile based estimators. - Alon Orlitsky; Narayana P. Santhanam; K. Viswanathan; Junan Zhang (ISIT, 2005)

Innovation and pattern entropy of stationary processes. - Alon Orlitsky; Narayana P. Santhanam; K. Viswanathan; Narayana Zhang (ISIT, 2005)

A lower bound on compression of unknown alphabets. - Nikola Jevtic; Alon Orlitsky; Narayana P. Santhanam (Theor. Comput. Sci., 2005)

Making the Correct Mistakes. - Dharmendra S. Modha; Narayana P. Santhanam (DCC, 2006)

Relative redundancy for large alphabets. - Alon Orlitsky; Narayana Santhanam; Junan Zhang (ISIT, 2006)

Theoretical and Experimental Results on Modeling Low Probabilities. - Alon Orlitsky; Narayana P. Santhanam; Krishnamurthy Viswanathan; Junan Zhang (ITW, 2006)

Limit Results on Pattern Entropy. - Alon Orlitsky; Narayana P. Santhanam; Krishnamurthy Viswanathan; Junan Zhang (IEEE Trans. Inf. Theory, 2006)

Population estimation with performance guarantees. - Alon Orlitsky; Narayana P. Santhanam; K. Viswanathan (ISIT, 2007)

Sample complexity of determining structures of graphical models. - Narayana Santhanam; Martin J. Wainwright (Allerton, 2008)

Further results on relative redundancy. - Hirakendu Das; Alon Orlitsky; Narayana P. Santhanam; Junan Zhang (ISIT, 2008)

Information-theoretic limits of graphical model selection in high dimensions. - Narayana P. Santhanam; Martin J. Wainwright (ISIT, 2008)

Small-sample distribution estimation over sticky channels. - Farzad Farnoud; Olgica Milenkovic; Narayana P. Santhanam (ISIT, 2009)

On modeling gene regulatory networks using Markov random fields. - Narayana Santhanam; Janis Dingel; Olgica Milenkovic (ITW, 2009)

What risks lead to ruin. - Narayana Santhanam; Venkat Anantharam (Allerton, 2010)

Redundancy of exchangeable estimators. - Narayana P. Santhanam; Mokshay M. Madiman; Anand D. Sarwate (Allerton, 2010)

Classification using pattern probability estimators. - Jayadev Acharya; Hirakendu Das; Alon Orlitsky; Shengjun Pan; Narayana P. Santhanam (ISIT, 2010)

Patterns and exchangeability. - Narayana P. Santhanam; Mokshay M. Madiman (ISIT, 2010)

Lossy Lempel-Ziv like compression algorithms for memoryless sources. - Narayana Prasad Santhanam; Dharmendra S. Modha (Allerton, 2011)

Universal algorithms: Building a case for pointwise convergence. - Narayana P. Santhanam; Venkat Anantharam (Allerton Conference, 2012)

Prediction over countable alphabets. - Narayana P. Santhanam; Venkat Anantharam (CISS, 2012)

Alternating Markov chains for distribution estimation in the presence of errors. - Farzad Farnoud; Narayana P. Santhanam; Olgica Milenkovic (ISIT, 2012)

Optimal Lempel-Ziv based lossy compression for memoryless data: how to make the right mistakes - Narayana P. Santhanam; Dharmendra S. Modha (CoRR, 2012)

Information-Theoretic Limits of Selecting Binary Graphical Models in High Dimensions. - Narayana P. Santhanam; Martin J. Wainwright (IEEE Trans. Inf. Theory, 2012)

Markov processes: Estimation in the undersampled regime. - Meysam Asadi; Ramezan Paravi Torghabeh; Narayana P. Santhanam (Allerton, 2013)

Estimation in slow mixing, long memory channels. - Meysam Asadi; Ramezan Paravi Torghabeh; Narayana P. Santhanam (ISIT, 2013)

Spatial correlations for solar PV generation and its tree approximation analysis. - Navid Tafaghodi Khajavi; Anthony Kuh; Narayana P. Santhanam (APSIPA, 2014)

All-bit-line MLC flash memories: Optimal detection strategies. - Xiujie Huang; Meysam Asadi; Aleksandar Kavcic; Narayana Prasad Santhanam (ICC, 2014)

Data-driven weak universal redundancy. - Narayana Prasad Santhanam; Venkat Anantharam; Aleksandar Kavcic; Wojciech Szpankowski (ISIT, 2014)

On redundancy of memoryless sources over countable alphabets. - Maryam Hosseini; Narayana Santhanam (ISITA, 2014)

Universal compression of Gaussian sources with unknown parameters. - Alon Orlitsky; Narayana P. Santhanam (CoRR, 2014)

Data driven consistency (working title). - Narayana P. Santhanam; Venkat Anantharam; Aleksandar Kavcic; Wojciech Szpankowski (CoRR, 2014)

Characterizing the Asymptotic Per-Symbol Redundancy of Memoryless Sources over Countable Alphabets in Terms of Single-Letter Marginals. - Maryam Hosseini; Narayana Santhanam (Entropy, 2014)

Redundancy of Exchangeable Estimators. - Narayana P. Santhanam; Anand D. Sarwate; Jae Oh Woo (Entropy, 2014)

Optimal Detector for Multilevel NAND Flash Memory Channels with Intercell Interference. - Meysam Asadi; Xiujie Huang; Aleksandar Kavcic; Narayana Prasad Santhanam (IEEE J. Sel. Areas Commun., 2014)

Stationary and Transition Probabilities in Slow Mixing, Long Memory Markov Processes. - Meysam Asadi; Ramezan Paravi Torghabeh; Narayana P. Santhanam (IEEE Trans. Inf. Theory, 2014)

Single letter characterization of average-case strong redundancy of compressing memoryless sequences. - Maryam Hosseini; Narayana Santhanam (Allerton, 2015)

Modeling community detection using slow mixing random walks. - Ramezan Paravi Torghabeh; Narayana Prasad Santhanam (IEEE BigData, 2015)

Write process modeling in MLC flash memories using renewal theory. - Meysam Asadi; Erich F. Haratsch; Aleksandar Kavcic; Narayana P. Santhanam (ISIT, 2015)

Community Detection Using Slow Mixing Markov Models. - Ramezan Paravi Torghabeh; Narayana Prasad Santhanam (CoRR, 2015)

Agnostic insurability of model classes. - Narayana P. Santhanam; Venkat Anantharam (J. Mach. Learn. Res., 2015)

Flash Memories: ISPP Renewal Theory and Flash Design Tradeoffs. - Meysam Asadi; Erich F. Haratsch; Aleksandar Kavcic; Narayana Prasad Santhanam (IEEE J. Sel. Areas Commun., 2016)

Jackknife estimation for Markov processes with no mixing constraints. - Kevin Oshiro; Changlong Wu; Narayana P. Santhanam (ISIT, 2017)

Redundancy of Unbounded Memory Markov Classes with Continuity Conditions. - Changlong Wu; Maryam Hosseini; Narayana Santhanam (ISIT, 2018)

Tail redundancy and its characterizations of universal compression. - Maryam Hosseini; Narayana Santhanam (ISIT, 2019)

Being correct eventually almost surely. - Changlong Wu; Narayana Santhanam (ISIT, 2019)

Thermodynamic Computing. - Tom Conte 001; Erik DeBenedictis; Natesh Ganesh; Todd Hylton; John Paul Strachan; R. Stanley Williams; Alexander A. Alemi; Lee Altenberg; Gavin E. Crooks; James P. Crutchfield; Lídia del Rio; Josh Deutsch; et al. (CoRR, 2019)

Almost Uniform Sampling From Neural Networks. - Changlong Wu; Narayana Prasad Santhanam (CISS, 2020)

Entropy property testing with finitely many errors. - Changlong Wu; Narayana Santhanam (ISIT, 2020)

Prediction with Finitely many Errors Almost Surely. - Changlong Wu; Narayana Santhanam (AISTATS, 2021)

Non-uniform Consistency of Online Learning with Random Sampling. - Changlong Wu; Narayana Santhanam (ALT, 2021)

Estimating Properties of Dynamic Graphical Models. - Changlong Wu; Narayana Santhanam (ISIT, 2021)

Data-Derived Weak Universal Consistency. - Narayana Santhanam; Venkatachalam Anantharam; Wojciech Szpankowski (J. Mach. Learn. Res., 2022)

Tail Redundancy and its Characterization of Compression of Memoryless Sources. - Maryam Hosseini; Narayana Santhanam (IEEE J. Sel. Areas Inf. Theory, 2022)

Universal Compression of High Dimensional Gaussian Vectors with James-Stein shrinkage. - Narayana Prasad Santhanam; Mayank Bakshi (ISIT, 2023)

A Bound for Learning Lossless Source Coding with Online Learning. - Anders Høst-Madsen; Mohammad Zaeri Amirani; Narayana Prasad Santhanam (ISITA, 2024)