default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNarayana P. Santhanam
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c44]Narayana Prasad Santhanam, Mayank Bakshi:
Universal Compression of High Dimensional Gaussian Vectors with James-Stein shrinkage. ISIT 2023: 382-387- 2022
- [j13]Narayana Santhanam, Venkatachalam Anantharam, Wojciech Szpankowski:
Data-Derived Weak Universal Consistency. J. Mach. Learn. Res. 23: 27:1-27:55 (2022) - [j12]Maryam Hosseini, Narayana Santhanam
:
Tail Redundancy and its Characterization of Compression of Memoryless Sources. IEEE J. Sel. Areas Inf. Theory 3(4): 626-638 (2022) - 2021
- [c43]Changlong Wu, Narayana Santhanam:
Prediction with Finitely many Errors Almost Surely. AISTATS 2021: 3223-3231 - [c42]Changlong Wu, Narayana Santhanam:
Non-uniform Consistency of Online Learning with Random Sampling. ALT 2021: 1265-1285 - [c41]Changlong Wu, Narayana Santhanam:
Estimating Properties of Dynamic Graphical Models. ISIT 2021: 391-395 - 2020
- [c40]Changlong Wu, Narayana Prasad Santhanam:
Almost Uniform Sampling From Neural Networks. CISS 2020: 1-6 - [c39]Changlong Wu, Narayana Santhanam:
Entropy property testing with finitely many errors. ISIT 2020: 2568-2573
2010 – 2019
- 2019
- [c38]Maryam Hosseini, Narayana Santhanam:
Tail redundancy and its characterizations of universal compression. ISIT 2019: 557-561 - [c37]Changlong Wu, Narayana Santhanam:
Being correct eventually almost surely. ISIT 2019: 1989-1993 - [i15]Tom Conte, 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, Michael Robert DeWeese, Khari Douglas, Massimiliano Esposito, Michael P. Frank, Robert Fry, Peter Harsha, Mark D. Hill, Christopher T. Kello, Jeff Krichmar, Suhas Kumar, Shih-Chii Liu, Seth Lloyd, Matteo Marsili, Ilya Nemenman, Alex Nugent, Norman H. Packard, Dana Randall, Peter Sadowski, Narayana Santhanam, Robert Shaw, Adam Z. Stieg, Elan Stopnitzky, Christof Teuscher, Chris Watkins, David H. Wolpert, J. Joshua Yang, Yan Yufik:
Thermodynamic Computing. CoRR abs/1911.01968 (2019) - [i14]Changlong Wu, Narayana Prasad Santhanam:
Almost Uniform Sampling From Neural Networks. CoRR abs/1912.04994 (2019) - 2018
- [c36]Changlong Wu, Maryam Hosseini, Narayana Santhanam:
Redundancy of Unbounded Memory Markov Classes with Continuity Conditions. ISIT 2018: 211-215 - [i13]Changlong Wu, Maryam Hosseini, Narayana Santhanam:
Redundancy of unbounded memory Markov classes with continuity conditions. CoRR abs/1802.00136 (2018) - [i12]Maryam Hosseini, Narayana Santhanam:
Tail redundancy and its characterization of compression of memoryless sources. CoRR abs/1809.07005 (2018) - 2017
- [c35]Kevin Oshiro, Changlong Wu, Narayana P. Santhanam:
Jackknife estimation for Markov processes with no mixing constraints. ISIT 2017: 3020-3024 - 2016
- [j11]Meysam Asadi, Erich F. Haratsch, Aleksandar Kavcic, Narayana Prasad Santhanam:
Flash Memories: ISPP Renewal Theory and Flash Design Tradeoffs. IEEE J. Sel. Areas Commun. 34(9): 2325-2335 (2016) - 2015
- [j10]Narayana P. Santhanam, Venkat Anantharam:
Agnostic insurability of model classes. J. Mach. Learn. Res. 16: 2329-2355 (2015) - [c34]Maryam Hosseini, Narayana Santhanam:
Single letter characterization of average-case strong redundancy of compressing memoryless sequences. Allerton 2015: 935-940 - [c33]Ramezan Paravi Torghabeh, Narayana Prasad Santhanam:
Modeling community detection using slow mixing random walks. IEEE BigData 2015: 2205-2211 - [c32]Meysam Asadi, Erich F. Haratsch, Aleksandar Kavcic, Narayana P. Santhanam:
Write process modeling in MLC flash memories using renewal theory. ISIT 2015: 651-655 - [i11]Ramezan Paravi Torghabeh, Narayana Prasad Santhanam:
Community Detection Using Slow Mixing Markov Models. CoRR abs/1510.02583 (2015) - 2014
- [j9]Maryam Hosseini, Narayana Santhanam:
Characterizing the Asymptotic Per-Symbol Redundancy of Memoryless Sources over Countable Alphabets in Terms of Single-Letter Marginals. Entropy 16(7): 4168-4184 (2014) - [j8]Narayana P. Santhanam, Anand D. Sarwate, Jae Oh Woo:
Redundancy of Exchangeable Estimators. Entropy 16(10): 5339-5357 (2014) - [j7]Meysam Asadi, Xiujie Huang, Aleksandar Kavcic, Narayana Prasad Santhanam:
Optimal Detector for Multilevel NAND Flash Memory Channels with Intercell Interference. IEEE J. Sel. Areas Commun. 32(5): 825-835 (2014) - [j6]Meysam Asadi, Ramezan Paravi Torghabeh, Narayana P. Santhanam:
Stationary and Transition Probabilities in Slow Mixing, Long Memory Markov Processes. IEEE Trans. Inf. Theory 60(9): 5682-5701 (2014) - [c31]Navid Tafaghodi Khajavi, Anthony Kuh, Narayana P. Santhanam:
Spatial correlations for solar PV generation and its tree approximation analysis. APSIPA 2014: 1-5 - [c30]Xiujie Huang, Meysam Asadi, Aleksandar Kavcic, Narayana Prasad Santhanam:
All-bit-line MLC flash memories: Optimal detection strategies. ICC 2014: 3883-3888 - [c29]Narayana Prasad Santhanam, Venkat Anantharam, Aleksandar Kavcic, Wojciech Szpankowski:
Data-driven weak universal redundancy. ISIT 2014: 1877-1881 - [c28]Maryam Hosseini, Narayana Santhanam:
On redundancy of memoryless sources over countable alphabets. ISITA 2014: 299-303 - [i10]Maryam Hosseini, Narayana Santhanam:
On redundancy of memoryless sources over countable alphabets. CoRR abs/1404.0062 (2014) - [i9]Narayana P. Santhanam, Anand D. Sarwate, Jae Oh Woo:
Redundancy of Exchangeable Estimators. CoRR abs/1407.5383 (2014) - [i8]Alon Orlitsky, Narayana P. Santhanam:
Universal compression of Gaussian sources with unknown parameters. CoRR abs/1410.4550 (2014) - [i7]Narayana P. Santhanam, Venkat Anantharam, Aleksandar Kavcic, Wojciech Szpankowski:
Data driven consistency (working title). CoRR abs/1411.4407 (2014) - 2013
- [c27]Meysam Asadi, Ramezan Paravi Torghabeh, Narayana P. Santhanam:
Markov processes: Estimation in the undersampled regime. Allerton 2013: 167-172 - [c26]Meysam Asadi, Ramezan Paravi Torghabeh, Narayana P. Santhanam:
Estimation in slow mixing, long memory channels. ISIT 2013: 2104-2108 - [i6]Ramezan Paravi Torghabeh, Meysam Asadi, Narayana P. Santhanam:
Estimation in slow mixing, long memory channels. CoRR abs/1301.6798 (2013) - 2012
- [j5]Narayana P. Santhanam, Martin J. Wainwright:
Information-Theoretic Limits of Selecting Binary Graphical Models in High Dimensions. IEEE Trans. Inf. Theory 58(7): 4117-4134 (2012) - [c25]Narayana P. Santhanam, Venkat Anantharam:
Universal algorithms: Building a case for pointwise convergence. Allerton Conference 2012: 489-493 - [c24]Narayana P. Santhanam, Venkat Anantharam:
Prediction over countable alphabets. CISS 2012: 1-6 - [c23]Farzad Farnoud, Narayana P. Santhanam, Olgica Milenkovic:
Alternating Markov chains for distribution estimation in the presence of errors. ISIT 2012: 2017-2021 - [i5]Farzad Farnoud, Narayana P. Santhanam, Olgica Milenkovic:
Alternating Markov Chains for Distribution Estimation in the Presence of Errors. CoRR abs/1202.0925 (2012) - [i4]Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang:
On Modeling Profiles instead of Values. CoRR abs/1207.4175 (2012) - [i3]Narayana P. Santhanam, Dharmendra S. Modha:
Optimal Lempel-Ziv based lossy compression for memoryless data: how to make the right mistakes. CoRR abs/1210.4700 (2012) - [i2]Narayana P. Santhanam, Venkat Anantharam:
Agnostic insurability of model classes. CoRR abs/1212.3866 (2012) - 2011
- [c22]Narayana Prasad Santhanam, Dharmendra S. Modha:
Lossy Lempel-Ziv like compression algorithms for memoryless sources. Allerton 2011: 1751-1756 - 2010
- [c21]Narayana Santhanam, Venkat Anantharam:
What risks lead to ruin. Allerton 2010: 844-850 - [c20]Narayana P. Santhanam, Mokshay M. Madiman, Anand D. Sarwate:
Redundancy of exchangeable estimators. Allerton 2010: 1153-1157 - [c19]Narayana P. Santhanam, Mokshay M. Madiman:
Patterns and exchangeability. ISIT 2010: 1483-1487 - [c18]Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Shengjun Pan, Narayana P. Santhanam:
Classification using pattern probability estimators. ISIT 2010: 1493-1497
2000 – 2009
- 2009
- [c17]Farzad Farnoud, Olgica Milenkovic, Narayana P. Santhanam:
Small-sample distribution estimation over sticky channels. ISIT 2009: 1125-1129 - [c16]Narayana Santhanam, Janis Dingel, Olgica Milenkovic:
On modeling gene regulatory networks using Markov random fields. ITW 2009: 156-160 - [i1]Narayana P. Santhanam, Martin J. Wainwright:
Information-theoretic limits of selecting binary graphical models in high dimensions. CoRR abs/0905.2639 (2009) - 2008
- [c15]Narayana Santhanam, Martin J. Wainwright:
Sample complexity of determining structures of graphical models. Allerton 2008: 1232-1237 - [c14]Hirakendu Das, Alon Orlitsky, Narayana P. Santhanam, Junan Zhang:
Further results on relative redundancy. ISIT 2008: 1940-1943 - [c13]Narayana P. Santhanam, Martin J. Wainwright:
Information-theoretic limits of graphical model selection in high dimensions. ISIT 2008: 2136-2140 - 2007
- [c12]Alon Orlitsky, Narayana P. Santhanam, K. Viswanathan:
Population estimation with performance guarantees. ISIT 2007: 2026-2030 - 2006
- [j4]Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang:
Limit Results on Pattern Entropy. IEEE Trans. Inf. Theory 52(7): 2954-2964 (2006) - [c11]Dharmendra S. Modha, Narayana P. Santhanam:
Making the Correct Mistakes. DCC 2006: 302-311 - [c10]Alon Orlitsky, Narayana Santhanam, Junan Zhang:
Relative redundancy for large alphabets. ISIT 2006: 2672-2676 - [c9]Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang:
Theoretical and Experimental Results on Modeling Low Probabilities. ITW 2006: 242-246 - 2005
- [j3]Nikola Jevtic, Alon Orlitsky, Narayana P. Santhanam:
A lower bound on compression of unknown alphabets. Theor. Comput. Sci. 332(1-3): 293-311 (2005) - [c8]Alon Orlitsky, Narayana P. Santhanam, K. Viswanathan, Junan Zhang:
Convergence of profile based estimators. ISIT 2005: 1843-1847 - [c7]Alon Orlitsky, Narayana P. Santhanam, K. Viswanathan, Narayana Zhang:
Innovation and pattern entropy of stationary processes. ISIT 2005: 2203-2207 - 2004
- [j2]Alon Orlitsky, Narayana P. Santhanam, Junan Zhang:
Universal compression of memoryless sources over unknown alphabets. IEEE Trans. Inf. Theory 50(7): 1469-1481 (2004) - [j1]Alon Orlitsky, Narayana P. Santhanam:
Speaking of infinity [i.i.d. strings]. IEEE Trans. Inf. Theory 50(10): 2215-2230 (2004) - [c6]Alon Orlitsky, Narayana P. Santhanam, Junan Zhang:
Relative redundancy: a more stringent performance guarantee for universal compression. ISIT 2004: 25 - [c5]Alon Orlitsky, Sajama, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang:
Algorithms for modeling distributions over large alphabets. ISIT 2004: 306 - [c4]Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang:
Limit results on pattern entropy. ITW 2004: 99-104 - [c3]Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang:
On Modeling Profiles Instead of Values. UAI 2004: 426-435 - 2003
- [c2]Alon Orlitsky, Narayana P. Santhanam:
Performance of universal codes over infinite alphabets. DCC 2003: 402-412 - [c1]Alon Orlitsky, Narayana P. Santhanam, Junan Zhang:
Always Good Turing: Asymptotically Optimal Probability Estimation. FOCS 2003: 179-188
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 01:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
